Automated Termination in Model Checking Modulo Theories

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

Silvio Ranise, Silvio Ghilardi, Alessandro Carioni

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)

Cited In (2)

• An extension of lazy abstraction with interpolation for programs with arrays
• Termination Modulo Combinations of Equational Theories

Uses Software

• SMT-LIB

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Modeling, specification, and verification of automaton programs 👍 👎
• Automated modular termination proofs for real Prolog programs 👍 👎

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)