Software Verification "Across the Stack"
Producing reliable programs has always been tough, and the complexity and variety of programming tasks just keeps on growing. Fortunately, the growth of computing power has also enabled substantial advances in automated reasoning, particularly the development of SMT solvers and automatic theorem provers. In turn, this has resulted in new research directions for program correctness, with the aim of producing tools which can verify complex properties of software automatically.
Developing useful verification techniques requires balancing a number of competing factors. We want to be as expressive as possible in the program properties we can support - if we can write it down, we’d like to be able to prove it. But to progress beyond pen-and-paper efforts, we also need to tailor our approaches such that they can be implemented or encoded by tools, ideally with both precise and efficient results. To make things harder still, if we hope to produce tools which everyday programmers can benefit from, we also need techniques that require manageable interaction from a user, and give understandable feedback.
In this talk, I’ll describe some of the fun experiences I’ve had working on these kinds of problems, from the design of front-end program logics and reasoning techniques to the development of underlying implementation technology, and the tricky encoding challenges that show up in between.
I am working at ETH Zürich as a postdoc in Peter Müller’s group in the area of program verification. I am mainly interested in specifying and verifying object-oriented programs, ideally in ways which can be supported by tools which are both automatic and usable by typical programmers.
Fri 10 JulDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
09:00 - 10:00
DN Junior: SummersResearch Track at Bohemia
Chair(s): John Boyland University of Wisconsin, Milwaukee
|Software Verification "Across the Stack"|
S: Alexander J. Summers ETH ZurichMedia Attached