Solving Second-Order Constraints with Program Synthesis
- đ¤ Speaker: Cristina David, Oxford University
- đ Date & Time: Tuesday 14 July 2015, 11:00 - 11:45
- đ Venue: Small lecture room, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
Abstract
In this talk I’ll summarise my work on expressing and solving program analysis problems as second-order satisfiability with an emphasis on the solving part. I’ll start by introducing a decidable fragment of second-order logic that is expressive enough to capture numerous program analysis problems (e.g. safety proving, bug finding, termination and non-termination proving, superoptimisation, complexity analysis). Subsequently, I will describe the solver we have built for this fragment, which is based on program synthesis. In particular, we rely on the synthesis of finite state programs, which we showed to be NEXPTIME -complete. Our synthesiser is an instance of the Counterexample Guided Inductive Synthesis (CEGIS) framework and can be used to synthesise C programs from a specification written in a subset of C. For this purpose it makes use of explicit proof search, symbolic bounded model checking and genetic programming. I’ll conclude with some experimental results.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Small lecture room, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Cristina David, Oxford University
Tuesday 14 July 2015, 11:00-11:45