Partially disjunctive heap abstraction

DOI10.1007/978-3-540-27864-1_20MaRDI QIDQ5466566zbMATH OpenOpenAlexFDO

Authors Roman Manevich, Mooly Sagiv, G. Ramalingam, John Field

Publication date 24 August 2005

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

Full work available at URL https://doi.org/10.1007/b99688

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05)

Recommendations

• Verification, Model Checking, and Abstract Interpretation
• Interprocedural Shape Analysis with Separated Heap Abstractions
• Shape analysis by predicate abstraction
• Semantic-directed clumping of disjunctive abstract states
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(16)

• Recognition of logically related regions based heap abstraction
• D^3: data-driven disjunctive abstraction
• Generic combination of heap and value analyses in abstract interpretation
• Heap Decomposition for Concurrent Shape Analysis
• A scalable segmented decision tree abstract domain
• A Posteriori Soundness for Non-deterministic Abstract Interpretations
• Abstract Counterexamples for Non-disjunctive Abstractions
• Compactly representing first-order structures for static analysis
• scientific article; zbMATH DE number 1471816 (Why is no real title available?)
• Existential heap abstraction entailment is undecidable
• A combination framework for tracking partition sizes
• Semantic-directed clumping of disjunctive abstract states
• Abstract interpretation with alien expressions and heap structures
• Static Analysis
• Verification, Model Checking, and Abstract Interpretation
• Volume-based merge heuristics for disjunctive numeric domains

This page was built for publication: Partially disjunctive heap abstraction

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