Unbounded allocation in bounded heaps

DOI10.1007/978-3-642-40213-5_1MaRDI QIDQ2948233zbMATH OpenOpenAlexFDO

Authors Jurriaan Rot, Marcello M. Bonsangue, Frank S. de Boer

Publication date 30 September 2015

Published in Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40213-5_1

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 7149819
• Computer Science Logic
• A semantics for procedure local heaps and its abstractions
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• A logic of reachable patterns in linked data-structures

Cited in

(2)

• Correctness of data representations involving heap data structures
• Extra heads and invariant allocations

This page was built for publication: Unbounded allocation in bounded heaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948233)