Bottom-Up Shape Analysis

DOI10.1007/978-3-642-03237-0_14zbMath1248.68145OpenAlexW2147492162MaRDI QIDQ3392926

Supratik Chakraborty, G. Ramalingam, Aditya V. Nori, Bhargav S. Gulavani

Publication date: 18 August 2009

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03237-0_14

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Convergence: integrating termination and abort-freedom ⋮ Verifying pointer safety for programs with unknown calls ⋮ Interprocedural shape analysis using separation logic-based transformer summaries ⋮ A relational shape abstract domain ⋮ Bottom-Up Shape Analysis ⋮ Abstract Contract Synthesis and Verification in the Symbolic 𝕂 Framework

Cites Work

• Unnamed Item
• Unnamed Item
• Bottom-Up Shape Analysis
• Heap Assumptions on Demand
• Monotonic Abstraction for Programs with Dynamic Memory Heaps
• Abstract Regular Tree Model Checking of Complex Dynamic Data Structures
• Regular Model Checking using Widening Techniques
• Compositional shape analysis by means of bi-abduction
• CONCUR 2004 - Concurrency Theory
• Computer Aided Verification
• Automated Technology for Verification and Analysis
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification

This page was built for publication: Bottom-Up Shape Analysis