lecture1-overview-topics

lecture1-overview-topics - “Problem X reduces to SAT so...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE 503: Software Engineering Winter 2010 Lecturer: Michael Ernst
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
503 Software Engineering Research Not: how to write good software and get a good job at Amazon/Google/Microsoft Research methods and ideas in SE (this may make you a more thoughtful developer) In alternating years: broad overview in-depth examination of one topic
Background image of page 2
Type systems Checking Inference Non-standard type systems Example: view type system as a set of constraints to compute legal refactorings
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Abstract interpretation A.k.a. dataflow analysis “Run” your program statically Choose an abstract domain; e.g., { +, 0, - } Assign semantics to operators Start at beginning of program Examine possible values of variables Used daily on aeronautics software
Background image of page 4
Model checking In simplest terms, exhaustive testing How to make this scale? Choose abstractions that lose just the right amount of precision Efficient encodings
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Analysis back-ends Binary Decision Diagrams (BDDs) Reduction to SAT 1979:
Background image of page 6
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: “Problem X reduces to SAT, so it is hard .” – 2009: “Problem X reduces to SAT, so it is easy .” • Datalog Dynamic analysis • Testing • Type inference • Model creation • Counterexample-guided refinement • Concolic execution Applications • Security • Correctness • Performance • Rapid development • System analysis • Maintenance and evolution Broader themes • Precision vs. performance • Power vs. transparency • Static vs. dynamic • Tuning analysis to the real problem Format • 50% of lectures: classic background • 50% of lectures: current research • Homework: – 1 in-class presentation – Group project to put the ideas into practice • Makes you a better researcher, in any field Who cares? • Intellectually exciting and deep • Spans both “hard” and “soft” areas of computing • Connections to PL, security, systems, architecture, databases, … (many more!) • Quals credit...
View Full Document

This note was uploaded on 02/24/2012 for the course CSE 503 taught by Professor Davidnotikin during the Winter '11 term at University of Washington.

Page1 / 11

lecture1-overview-topics - “Problem X reduces to SAT so...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online