COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Undecidability of propositional separation logic and its neighbours

## Undecidability of propositional separation logic and its neighboursAdd to your list(s) Download to your calendar using vCal - James Brotherston, Imperial College London
- Friday 12 March 2010, 14:00-15:00
- Room FW26, Computer Laboratory, William Gates Building.
If you have a question about this talk, please contact Sam Staton. Separation logic has become well-established in recent years as
an effective formalism for reasoning about memory-manipulating
programs. In this talk I shall explain how, and why, it happens
that even the purely propositional fragment of separation logic
is (a) provability in Boolean BI (BBI) and its extensions, even when negation and falsum are excluded; (b) validity in the class of separation models; (c) validity in the class of separation models with indivisible units; (d) validity in We also gain new insights into the nature of existing
Furthermore, we additionally establish the undecidability of the following properties of propositional formulas, which are related to Classical BI and its ’’dualising’’ resource models: (e) provability in Classical BI (CBI) and its extensions; (f) validity in the class of CBI -models; (g) validity in the class of CBI -models with indivisible units. All of the above results are new but, in particular, decidability of BBI has been an open problem for some years, while decidability of CBI was a recent open problem. This is joint work with Max Kanovich, Queen Mary University of London. The talk is based on the paper of the same name which can be found at the speaker’s home page:
This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. ## This talk is included in these lists:- All Talks (aka the CURE list)
- Cambridge talks
- Computer Laboratory talks
- Computing and Mathematics
- Interested Talks
- Logic and Semantics Seminar (Computer Laboratory)
- Room FW26, Computer Laboratory, William Gates Building
- School of Technology
- Trust & Technology Initiative - interesting events
- bld31
- yk373's list
Note that ex-directory lists are not shown. |
## Other liststalks Topics in theoretical and experimental semantics and pragmatics (PhD course) MethSoc: Cambridge Student Methodist Society## Other talksEvolution’s Bite: Dental evidence for the diets of our distant ancestors CANCELLED Ñande reko: alterity and (non-)participatory research with guaraní women in Bolivia Making Refuge: Flight Intrinsically Motivating Teachers;STIR's use of Data Driven Insight to Iterate, Pivot and (where necessary) Fail Fast Understanding and Estimating Physical Parameters in Electric Motors using Mathematical Modelling Biological and Clinical Features of High Grade Serous Ovarian Cancer |