|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Automating reasoning tasks for separation logic
If you have a question about this talk, please contact Jonathan Hayman.
One of the main goals of program analysis and verification is to develop fully automated tools that can reason efficiently about as many programs as possible. However, scalable automated reasoning is still among the main challenges for programs which operate on user-defined data structures on the heap.
In this talk I will give an overview of recent work on the automation of separation logic, a formalism which has proved quite powerful for reasoning about such data structures. I will introduce the basic techniques behind a decision procedure for entailment checking on a fragment of the logic restricted to list segments, and describe how such techniques are generalised in two directions: to provide combined reasoning with other theories (SMT), and to decide the satisfiability of inductive definitions of arbitrary heap shapes.
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsQueens' College Politics Society Quaternary Discussion Group (QDG) Cambridge University Algorithmic Trading Society list
Other talksContributions of the APC protein to mechanisms regulating normal epithelial tissue organisation in the intestine On Nonreflecting Boundary Conditions TBC From C to Proton Sea: Bjorken-x Dependence of the Parton Distribution Functions Differential forms and the abundance conjecture What does it look like to work in Market Research today (and tomorrow)