Static Analysis in Disjunctive Numerical Domains
From MaRDI portal
Publication:3613374
DOI10.1007/11823230_2zbMath1225.68077OpenAlexW1570919259MaRDI QIDQ3613374
Sriram Sankaranarayanan, Ilya Shlyakhter, Franjo Ivančić, Aarti Gupta
Publication date: 12 March 2009
Published in: Static Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11823230_2
Analysis of algorithms (68W40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computer aspects of numerical algorithms (65Y99)
Related Items (11)
Backward symbolic execution with loop folding ⋮ Sound Bit-Precise Numerical Domains ⋮ Inferring Min and Max Invariants Using Max-Plus Polyhedra ⋮ Type-based amortized resource analysis with integers and arrays ⋮ Reachability analysis for timed automata using max-plus algebra ⋮ Linear Absolute Value Relation Analysis ⋮ Efficient SAT-based bounded model checking for software verification ⋮ Sweeping in Abstract Interpretation ⋮ An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints ⋮ Quadtrees as an Abstract Domain ⋮ Proving the Correctness of the Implementation of a Control-Command Algorithm
Uses Software
This page was built for publication: Static Analysis in Disjunctive Numerical Domains
