662 search results - page 49 / 133 » Model Checking Procedures for Infinite State Systems |
135
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
127
Voted
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
116
click to vote
CAV
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. We describe the implementation, within ALDEBARAN of an algorithmic method allowing the generation of a minimal labeled transition rom an abstract model ; this minimality ...
186
Voted
CAV
1999
Springer
15 years 7 months ago
1999
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. A computation that violates a general linea...
138
Voted
FM
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...