Sciweavers

12981 search results - page 66 / 2597
» Model Checking and Abstraction
Sort
View
DAC
1996
ACM
15 years 8 months ago
State Reduction Using Reversible Rules
We reduce the state explosion problem in automatic verification of finite-state systems by automatically collapsing subgraphs of the aph into abstract states. The key idea of the ...
C. Norris Ip, David L. Dill
CIBSE
2008
ACM
15 years 6 months ago
Using Refinement Checking as System Testing
Abstract. Software testing is an expensive and time-consuming activity; it is also error-prone due to human factors. But, it still is the most common effort used in the software in...
Cristiano Bertolini, Alexandre Mota
146
Voted
SIGSOFT
2007
ACM
16 years 4 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
SCP
2010
155views more  SCP 2010»
15 years 2 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
TACAS
2004
Springer
94views Algorithms» more  TACAS 2004»
15 years 9 months ago
A Tool for Checking ANSI-C Programs
Abstract. We present a tool for the formal verification of ANSI-C programs using Bounded Model Checking (BMC). The emphasis is on usability: the tool supports almost all ANSI-C la...
Edmund M. Clarke, Daniel Kroening, Flavio Lerda