![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 26 June 2007, 13:00-14:00
A Deep Embedding of a Decidable Fragment of Separation Logic in HOL
- đ¤ Speaker: Thomas Tuerk (University of Cambridge)
- đ Date & Time: Tuesday 26 June 2007, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room GS15
Questions? Contact
Thomas Tuerk
Abstract
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.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room GS15
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.