|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 listsCERF One Day Workshop on: "The Greek language in Pontus: Romeyka in contemporary Trebizond" Cambridge University Southeast Asia Forum
Other talksSophia Dobson Collet and the Brahma Samaj: religious cosmopolitanism between nineteenth-century Britain and Bengal The Pardoner's Passing and How it Matters: Gender, Relics and Speech Acts Towards Ageing Well: Nature, Nurture and Epigenetics Insights into non-linear structure evolution from controlled linear initial conditions From C to Proton Sea: Bjorken-x Dependence of the Parton Distribution Functions New York City's affordable housing plan under Mayor De Blasio and the limits of local initiative in making housing affordable