Polynomial Precise Interval Analysis Revisited
From MaRDI portal
Publication:3644736
DOI10.1007/978-3-642-03456-5_28zbMath1258.65048MaRDI QIDQ3644736
Jérôme Leroux, Thomas Martin Gawlitza, Jan Reineke, Grégoire Sutre, Helmut Seidl, Reinhard Wilhelm
Publication date: 12 November 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_28
65G40: General methods in interval analysis
Related Items
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach, Improving Strategies via SMT Solving, Computing Game Values for Crash Games
Cites Work
- Unnamed Item
- Unnamed Item
- A generalization of Dijkstra's algorithm
- A class of polynomially solvable range constraints for interval analysis without widenings
- Accelerated Data-Flow Analysis
- Programming Languages and Systems
- Programming Languages and Systems
- Precise Fixpoint Computation Through Strategy Iteration
- Verification, Model Checking, and Abstract Interpretation