Verification, Model Checking, and Abstract Interpretation
From MaRDI portal
Publication:5711512
DOI10.1007/b105073zbMath1112.68094OpenAlexW2611288859MaRDI QIDQ5711512
Markus Müller-Olm, Helmut Seidl, Oliver Rüthing
Publication date: 6 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b105073
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Extending \(H_1\)-clauses with disequalities ⋮ Detection of redundant expressions: a precise, efficient, and pragmatic algorithm in SSA ⋮ What’s Decidable About Program Verification Modulo Axioms? ⋮ Upper Adjoints for Fast Inter-procedural Variable Equalities ⋮ Paths, tree homomorphisms and disequalities for -clauses ⋮ Invariant Checking for Programs with Procedure Calls ⋮ Context unification with one context variable
This page was built for publication: Verification, Model Checking, and Abstract Interpretation