481 search results - page 22 / 97 » Model Checking Abstract State Machines and Beyond |
113
click to vote
ACSD
2004
IEEE
15 years 5 months ago
2004
IEEE
Abstract. This paper presents a formal verification algorithm for finding errors in models of complex concurrent systems. The algorithm improves explicit guided model checking by a...
101
click to vote
ATVA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Symbolic model checking provides partially effective verification procedures that can handle systems with an infinite state space. So-called “acceleration techniques...
134
click to vote
CADE
2008
Springer
16 years 2 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
138
click to vote
TACAS
2010
Springer
14 years 11 months ago
2010
Springer
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 ...
143
click to vote
FASE
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...