University of Cambridge > Talks.cam > Computer Laboratory Automated Reasoning Group Lunches > A Deep Embedding of a Decidable Fragment of Separation Logic in HOL

A Deep Embedding of a Decidable Fragment of Separation Logic in HOL

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Thomas Tuerk.

Smallfoot is a tool to automatically check separation logic specifications of imperative programs. It uses a decidable fragment of separation logic. In this talk, I will present a deep embedding of this fragment of separation logic in HOL . Additionally, I will present a HOL implementation of a decision procedure for entailments, which is based on the inferences used by Smallfoot.

This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity