![[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)
Viktor Vafeiadis (Microsoft Research Cambridge)
Monday 23 March 2009, 12:45-14:00
Segment logic (work in progress)
- đ¤ Speaker: Viktor Vafeiadis (Microsoft Research Cambridge)
- đ Date & Time: Monday 23 March 2009, 12:45 - 14:00
- đ Venue: Room FW26, Computer Laboratory, William Gates Building
Questions? Contact
Sam Staton
Abstract
I shall present segment logic, a logic for reasoning about programs that manipulate shared data structures. Segment logic extends separation logic by logically partitioning the heap into a finite number of shared heap segments. Its ass ertions contain a special modality for describing segments and a nominal quantifier over segmen t names. Segment logic often enables more concise descriptions of pointer aliasing patterns tha n separation logic, has a better frame rule, and yet has a simple soundness statement.
Series This talk is part of the Semantics Lunch (Computer Laboratory) series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
- Semantics Lunch (Computer Laboratory)
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.