Enforcing termination of interprocedural analysis
From MaRDI portal
Publication:5915716
DOI10.1007/978-3-662-53413-7_22zbMath1394.68086arXiv1606.07687OpenAlexW2949646179MaRDI QIDQ5915716
Helmut Seidl, Stefan Schulze Frielinghaus, Ralf Vogler
Publication date: 27 August 2018
Published in: Formal Methods in System Design, Static Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.07687
interprocedural analysisabstract interpretationstatic program analysislocal solverspartial tabulation
Related Items
Three improvements to the top-down solver ⋮ Incremental Abstract Interpretation ⋮ Enforcing termination of interprocedural analysis ⋮ Demand-driven interprocedural analysis for map-based abstract domains
Uses Software
Cites Work
- Unnamed Item
- Why does Astrée scale up?
- Precise widening operators for convex polyhedra
- Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor)
- Enhancing Top-Down Solving with Widening and Narrowing
- An overview of Ciao and its design philosophy
- What Is a Pure Functional?
- Combining Widening and Acceleration in Linear Relation Analysis
- An Abstract Domain to Discover Interval Linear Equalities
- On Monadic Parametricity of Second-Order Functionals
- Verifying a Local Generic Solver in Coq
- Interprocedural analyses: a comparison
- An even faster solver for general systems of equations
- Abstracting Induction by Extrapolation and Interpolation
- Abstract Interpretation Frameworks
- Enforcing termination of interprocedural analysis
