Sciweavers

89 search results - page 1 / 18
» Reachability Analysis for Some Models of Infinite-State Tran...
Sort
View
CONCUR
2000
Springer
13 years 7 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 1 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
CONCUR
2004
Springer
13 years 7 months ago
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
Antonín Kucera, Ph. Schnoebelen
CONCUR
2007
Springer
13 years 7 months ago
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Rohit Chadha, Mahesh Viswanathan
CADE
2010
Springer
13 years 4 months ago
MCMT: A Model Checker Modulo Theories
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Silvio Ghilardi, Silvio Ranise