Unbounded allocation in bounded heaps

DOI10.1007/978-3-642-40213-5_1zbMATH Open1434.68113OpenAlexW1492008054MaRDI QIDQ2948233FDOQ2948233

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

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

Mathematics Subject Classification ID

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

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)