Local Reasoning about Data Update

Authors:
Cristiano Calcagno;Philippa Gardner;Uri Zarfaty
Affiliations:
Department of Computing, Imperial College London, London, UK;Department of Computing, Imperial College London, London, UK;Department of Computing, Imperial College London, London, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 13
Cited 6

Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An axiomatic basis for computer programming

Communications of the ACM
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Semantic Basis for Local Reasoning

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Possible worlds and resources: the semantics of BI

Theoretical Computer Science - Mathematical foundations of programming semantics
Context logic and tree update

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Elimination of spatial connectives in static spatial logics

Theoretical Computer Science - Expressiveness in concurrency
Context logic as modal logic: completeness and parametric inexpressivity

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Variance analyses from invariance analyses

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Smallfoot: modular automatic assertion checking with separation logic

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Spatial logics for bigraphs

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Automatic termination proofs for programs with shape-shifting heaps

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification

Footprints in local reasoning

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Concurrent abstract predicates

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
The next 700 separation logics

VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Abstraction and refinement for local reasoning

VSTTE'10 Proceedings of the Third international conference on Verified software: theories, tools, experiments
Abstract local reasoning for program modules

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Views: compositional reasoning for concurrent programs

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present local Hoare reasoning about data update, introducing Context Logic for analysing structured data. We apply our reasoning to tree update, heap update, and term rewriting. Our reasoning about heap update is exactly analogous to the local Hoare reasoning of Separation Logic. Our reasoning about tree update and term rewriting can only be done with Context Logic.