Separation and information hiding

From MaRDI portal
Revision as of 20:13, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3452266

DOI10.1145/964001.964024zbMath1325.68069OpenAlexW2080769562MaRDI QIDQ3452266

John C. Reynolds, Hongseok Yang, Peter W. O'Hearn

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964024




Related Items (31)

Program Verification with Separation LogicCompleteness for recursive procedures in separation logicA First-Order Logic with FramesCertifying low-level programs with hardware interrupts and preemptive threadsBringing Order to the Separation Logic JungleTowards imperative modules: reasoning about invariants and sharing of mutable stateOn assertion-based encapsulation for object invariants and simulationsVerifying pointer safety for programs with unknown callsA semantics for concurrent separation logicResources, concurrency, and local reasoningExploring an Interface Model for CKAAn observationally complete program logic for imperative higher-order functionsSafe Modification of Pointer Programs in Refinement CalculusThe \(\mathbf{M}\)-computations induced by accessibility relations in nonstandard models \(\mathbf{M}\) of Hoare logicTackling Real-Life Relaxed Concurrency with FSL++Abstracting Complex Data Structures by Hyperedge ReplacementHoare type theory, polymorphism and separationSeparation Logic for Multiple InheritanceWeak updates and separation logicThe dynamic frames theoryFifty years of Hoare's logicUnifying separation logic and region logic to allow interoperabilitySecure the ClonesVerification of Equivalent-Results MethodsA shape graph logic and a shape systemJuggrnaut: using graph grammars for abstracting unbounded heap structuresParameterised notions of computationCertificates and Separation LogicBehaviour approximated on subgroupsSeparation Logic Contracts for a Java-Like Language with Fork/JoinA proof outline logic for object-oriented programming




This page was built for publication: Separation and information hiding