Automated Termination in Model Checking Modulo Theories

DOI10.1007/978-3-642-24288-5_11zbMATH Open1348.68124OpenAlexW2173515606MaRDI QIDQ3172869FDOQ3172869

Authors Alessandro Carioni, Silvio Ghilardi, Silvio Ranise 

Publication date 7 October 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-24288-5_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Automated termination in model-checking modulo theories
• Modular and incremental automated termination proofs
• Automata-Theoretic Model Checking Revisited
• Automata-theoretic techniques for modal logics of programs
• CTL model checking in deduction modulo
• Publication:4503921
• Modeling, specification, and verification of automaton programs
• Automated modular termination proofs for real Prolog programs

Cited in

(3)

• An extension of lazy abstraction with interpolation for programs with arrays
• Automated termination in model-checking modulo theories
• Termination Modulo Combinations of Equational Theories

Describes a project that uses

Uses Software

• SMT-LIB

This page was built for publication: Automated Termination in Model Checking Modulo Theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172869)