Verification, Model Checking, and Abstract Interpretation
From MaRDI portal
Publication:5711512
DOI10.1007/b105073zbMath1112.68094MaRDI 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
68Q60: Specification and verification (program logics, model checking, etc.)
03B25: Decidability of theories and sets of sentences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Paths, tree homomorphisms and disequalities for -clauses, What’s Decidable About Program Verification Modulo Axioms?, Upper Adjoints for Fast Inter-procedural Variable Equalities, Context unification with one context variable, Detection of redundant expressions: a precise, efficient, and pragmatic algorithm in SSA, Extending \(H_1\)-clauses with disequalities, Invariant Checking for Programs with Procedure Calls