On the Monniaux problem in abstract interpretation
From MaRDI portal
Publication:6536286
DOI10.1007/978-3-030-32304-2_9zbMATH Open1539.68063MaRDI QIDQ6536286FDOQ6536286
Authors: Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Publication date: 19 April 2024
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Why does Astrée scale up?
- Title not available (Why is that?)
- Affine relationships among variables of a program
- Polynomial-time algorithm for the orbit problem
- Making abstract interpretations complete
- Verification, Model Checking, and Abstract Interpretation
- Analyzing program analyses
- Static Analysis
- Extending constraint-only representation of polyhedra with Boolean constraints
- On the decidability of the existence of polyhedral invariants in transition systems
- Undecidability of infinite post correspondence problem for instances of Size 9
- O-Minimal Invariants for Discrete-Time Dynamical Systems
- Polynomial Invariants for Affine Programs
- The Complexity of theA B CProblem
- Donut domains: efficient non-convex domains for abstract interpretation
- Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: On the Monniaux problem in abstract interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536286)