Write a Blog >>
Mon 20 Jan 2020 16:40 - 17:45 at Conde - Closing Session

Separation logics build on so-called separation algebras, which allow expressing properties of heap regions such that modifications to a region do not invalidate properties stated about the remainder of the heap. This concept is key to enabling modular reasoning and also extends to concurrency. While heaps are naturally related to mathematical graphs, many ubiquitous graph properties are non-local in character, such as reachability between nodes, path lengths, acyclicity and other structural invariants, as well as data invariants which combine with these notions. Reasoning modularly about such graph properties remains notoriously difficult, since a local modification can have side-effects on a global property that cannot be easily confined to a small region.

In this talk, we address the question: What separation algebra can be used to avoid proof arguments reverting back to tedious global reasoning in such cases? To this end, we consider a general class of global graph properties expressed as fixpoints of algebraic equations over graphs. We present mathematical foundations for reasoning about this class of properties, imposing minimal requirements on the underlying theory that allow us to define a suitable separation algebra. Building on this theory we develop a general proof technique for modular reasoning about global graph properties over program heaps, in a way which can be integrated with existing separation logics. To demonstrate our approach, we present preliminary work on automating local proofs for challenging examples such as a priority inheritance protocol, the composite design pattern, and overlaid data structures. This is joint work with Siddharth Krishna and Alexander J. Summers.

Mon 20 Jan
Times are displayed in time zone: (GMT-06:00) Saskatchewan, Central America change

15:35 - 17:45: ADSL 2020 - Closing Session at Conde
adsl-2020-papers15:35 - 16:40
Nadia PolikarpovaUniversity of California, San Diego
adsl-2020-papers16:40 - 17:45
Thomas WiesNew York University