Automated Termination in Model Checking Modulo Theories
type: Item
instance of: scholarly article
title: Automated Termination in Model Checking Modulo Theories
zbMATH Open document ID: 1348.68124
DOI: 10.1007/978-3-642-24288-5_11
author: Alessandro Carioni
author: Silvio Ghilardi
author: Silvio Ranise
published in: Lecture Notes in Computer Science
publication date: 2011-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5954747
describes a project that uses: SMT-LIB
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-642-24288-5 11
OpenAlex ID: W2173515606
Recommended article: Automated termination in model-checking modulo theories
Recommended article: Modular and incremental automated termination proofs
Recommended article: Automata-Theoretic Model Checking Revisited
Recommended article: Automata-theoretic techniques for modal logics of programs
Recommended article: CTL Model Checking in Deduction Modulo
Recommended article: Q4503921
Recommended article: Modeling, specification, and verification of automaton programs
Recommended article: Automated modular termination proofs for real Prolog programs
description: scientific article; zbMATH DE number 5954747