Shape Analysis of Single-Parent Heaps

DOI10.1007/978-3-540-69738-1_7zbMath1132.68346OpenAlexW1505309070MaRDI QIDQ5452600

Lenore D. Zuck, Ittai Balaban, Amir Pnueli

Publication date: 4 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69738-1_7

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

A Logic-Based Framework for Reasoning about Composite Data Structures ⋮ Monotonic Abstraction for Programs with Dynamic Memory Heaps ⋮ Verification of multi-linked heaps ⋮ An Efficient Decision Procedure for Imperative Tree Data Structures

This page was built for publication: Shape Analysis of Single-Parent Heaps