Tools and Algorithms for the Construction and Analysis of Systems

DOI10.1007/b96393zbMath1126.68573OpenAlexW4299869287MaRDI QIDQ5308386

K. L. McMillan

Publication date: 28 September 2007

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

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

Mathematics Subject Classification ID

Related Items

SAT-Based Model Checking ⋮ An institution-independent proof of the Robinson consistency theorem ⋮ SAT-based verification for timed component connectors ⋮ Interpolants for Linear Arithmetic in SMT ⋮ Resolution proof transformation for compression and interpolation ⋮ Farkas-based tree interpolation ⋮ Quantifier-free interpolation in combinations of equality interpolating theories ⋮ Rewriting Interpolants ⋮ Interpolation and Symbol Elimination ⋮ Unnamed Item ⋮ On Interpolation and Symbol Elimination in Theory Extensions ⋮ NIL: learning nonlinear interpolants ⋮ Reasoning in the theory of heap: satisfiability and interpolation

Uses Software

• FOCI