On the Monniaux problem in abstract interpretation
From MaRDI portal
Publication:6536286
DOI10.1007/978-3-030-32304-2_9zbMath1539.68063MaRDI QIDQ6536286
Engel Lefaucheux, Nathanaël Fijalkow, James Worrell, Joël Ouaknine, Amaury Pouly, Pierre Ohlmann
Publication date: 19 April 2024
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Why does Astrée scale up?
- Affine relationships among variables of a program
- Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
- On the decidability of the existence of polyhedral invariants in transition systems
- Analyzing Program Analyses
- Donut Domains: Efficient Non-convex Domains for Abstract Interpretation
- Undecidability of infinite post correspondence problem for instances of Size 9
- Polynomial-time algorithm for the orbit problem
- The Complexity of theA B CProblem
- O-Minimal Invariants for Discrete-Time Dynamical Systems
- Polynomial Invariants for Affine Programs
- Making abstract interpretations complete
- Static Analysis
- Verification, Model Checking, and Abstract Interpretation
- Extending constraint-only representation of polyhedra with Boolean constraints
Related Items (1)
This page was built for publication: On the Monniaux problem in abstract interpretation
