Demand-driven interprocedural analysis for map-based abstract domains
DOI10.1016/j.jlamp.2018.06.003zbMath1400.68054OpenAlexW2808800056WikidataQ129654097 ScholiaQ129654097MaRDI QIDQ1785851
Varmo Vene, Kalmer Apinis, Vesal Vojdani
Publication date: 1 October 2018
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2018.06.003
abstract interpretationstatic program analysisconstraint systemslocal solvinginterprocedural data flow analysis
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Precise interprocedural dataflow analysis with applications to constant propagation
- ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
- Monotone data flow analysis frameworks
- Constructive versions of Tarski's fixed point theorems
- Reversing abstract interpretations
- A faster solver for general systems of equations
- Enhancing Top-Down Solving with Widening and Narrowing
- Reduced Product Combination of Abstract Domains for Shapes
- Static Contract Checking with Abstract Interpretation
- Region Analysis for Race Detection
- Precise interprocedural analysis through linear algebra
- What Is a Pure Functional?
- Grammar Analysis and Parsing by Abstract Interpretation
- Compositional may-must program analysis
- Demand-Driven Compositional Symbolic Execution
- Logic Programming
- Programming Languages and Systems
- Compiler Design
- Enforcing termination of interprocedural analysis
This page was built for publication: Demand-driven interprocedural analysis for map-based abstract domains
