The Complexity of Reversal-Bounded Model-Checking
type: Item
instance of: scholarly article
title: The Complexity of Reversal-Bounded Model-Checking
zbMATH Open document ID: 1348.68121
DOI: 10.1007/978-3-642-24364-6_6
author: Marcello M. Bersani
author: Stéphane Demri
published in: Frontiers of Combining Systems
publication date: 2011-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5954762
describes a project that uses: cvc3
describes a project that uses: z3
describes a project that uses: TaPAS
describes a project that uses: LIRA
MaRDI profile type: Publication
full work available at URL: 978-3-642-24364-6 6
OpenAlex ID: W80793323
cites work: A really temporal logic
cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations
cites work: Q4474213
cites work: Q4247290
cites work: Reversal-Bounded Counter Machines Revisited
cites work: The complexity of decision problems for finite-turn multicounter machines
cites work: An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines
cites work: Q4536602
cites work: Counter machines and verification problems.
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: TaPAS: The Talence Presburger Arithmetic Suite
cites work: Automated Technology for Verification and Analysis
cites work: NEXP TIME-complete description logics with concrete domains
cites work: On the complexity of integer programming
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: The covering and boundedness problems for vector addition systems
cites work: Verification Decidability of Presburger Array Programs
cites work: Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
cites work: Reasoning about infinite computations
description: scientific article