A generic framework for heap and value analyses of object-oriented programming languages
DOI10.1016/j.tcs.2016.04.001zbMath1343.68040OpenAlexW2323946099MaRDI QIDQ278744
Publication date: 2 May 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.001
static analysisabstract interpretationgeneric analyzersheap analysisstandard pointer analysisvalue analysis
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- The octagon abstract domain
- Affine relationships among variables of a program
- Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data
- Generic Combination of Heap and Value Analyses in Abstract Interpretation
- Static Contract Checking with Abstract Interpretation
- Relational inductive shape analysis
- Arithmetic Strengthening for Shape Analysis
- Abstract interpretation and application to logic programs
- A Formally-Verified Alias Analysis
- Statically Inferring Complex Heap, Array, and Numeric Invariants
- Abstract cofibered domains: Application to the alias analysis of untyped programs
- Automatic numeric abstractions for heap-manipulating programs
- A framework for numeric analysis of array operations
- Tools and Algorithms for the Construction and Analysis of Systems
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: A generic framework for heap and value analyses of object-oriented programming languages
