Decoupling the ascending and descending phases in abstract interpretation
From MaRDI portal
Publication:6176563
DOI10.1007/978-3-031-21037-2_2zbMath1524.68072arXiv2206.10893OpenAlexW4312607842MaRDI QIDQ6176563
Isabella Mastroeni, Vincenzo Arceri, Enea Zaffanella
Publication date: 25 July 2023
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.10893
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Some ways to reduce the space dimension in polyhedra computations
- The octagon abstract domain
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence
- Descending chains and narrowing on template abstract domains
- On collecting semantics for program analysis
- PPLite: zero-overhead encoding of NNC polyhedra
- Precise widening operators for convex polyhedra
- Guided Static Analysis
- Combining Widening and Acceleration in Linear Relation Analysis
- Abstract interpretation and application to logic programs
- Stratified Static Analysis Based on Variable Dependencies
- Systematic design of program transformation frameworks by abstract interpretation
- Abstract Interpretation Frameworks
- Fast polyhedra abstract domain
- Widening Polyhedra with Landmarks
- Static Analysis by Policy Iteration on Relational Domains
- Precise Fixpoint Computation Through Strategy Iteration
- Verification, Model Checking, and Abstract Interpretation
- Program analysis is harder than verification: a computability perspective
- An efficient abstract domain for not necessarily closed polyhedra
- A direct encoding for NNC polyhedra
This page was built for publication: Decoupling the ascending and descending phases in abstract interpretation