713 search results - page 46 / 143 » Model Checking and Transitive-Closure Logic |
FSTTCS
2006
Springer
15 years 2 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
111
click to vote
ENTCS
2007
14 years 11 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
CONCUR
1999
Springer
15 years 3 months ago
1999
Springer
In order to check whether an open system satisfies a desired property, we need to check the behavior of the system with respect to an arbitrary environment. In the most general se...
PTS
2007
15 years 13 days ago
2007
Black-box testing is a popular technique for assessing the quality of a system. However, in case of a test failure, only little information is available to identify the root-cause ...
118
click to vote
SPIN
2001
Springer
15 years 3 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...