Verification, Model Checking, and Abstract Interpretation

DOI10.1007/11609773zbMath1176.68051OpenAlexW2496613029MaRDI QIDQ5898613

Henny B. Sipma, Zohar Manna, Sriram Sankaranarayanan, Michael A. Colón

Publication date: 12 February 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11609773

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

On the efficiency of convex polyhedra ⋮ Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Change-of-bases abstractions for non-linear hybrid systems ⋮ Finding Relevant Templates via the Principal Component Analysis ⋮ Abstract interpretation meets convex optimization ⋮ Tropical linear-fractional programming and parametric mean payoff games ⋮ The two variable per inequality abstract domain ⋮ Generalizing the Template Polyhedral Domain ⋮ Efficient SAT-based bounded model checking for software verification ⋮ The Abstract Domain of Parallelotopes ⋮ A Note on the Inversion Join for Polyhedral Analysis ⋮ Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems ⋮ Applications of polyhedral computations to the analysis and verification of hardware and software systems

This page was built for publication: Verification, Model Checking, and Abstract Interpretation