2003/06/25 by John Reynolds · 13 citations
Computer Science · Mathematics · #Computer science #Conservative extension #Data structure #Disjoint sets #Distributed systems and fault tolerance #Extension (predicate logic) #Heap (data structure) #Logic, programming, and type systems #Mathematics #Parallel Computing and Optimization Techniques #Programming language #Separation logic #Theoretical computer science
paper · doi:10.1109/lics.2002.1029817
openalex publication_date 2003/06/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure. The simple imperative programming language is extended with commands (not expressions) for accessing and modifying shared structures, and for explicit allocation and deallocation of storage. Assertions are extended by introducing a "separating conjunction" that asserts that its subformulas hold for disjoint parts of the heap, and a closely related "separating implication". Coupled with the inductive definition of predicates on abstract data structures, this extension permits the concise and flexible description of structures with controlled sharing. In this paper, we survey the current development of this program logic, including extensions that permit unrestricted address arithmetic, dynamically allocated arrays, and recursive procedures. We also discuss promising future directions.