2873 search results - page 388 / 575 » Model Checking and the Mu-calculus |
CONCUR
2006
Springer
14 years 2 hour ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
APN
1995
Springer
13 years 12 months ago
1995
Springer
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce ...
APLAS
2008
ACM
13 years 10 months ago
2008
ACM
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
FORTE
2004
13 years 9 months ago
2004
Abstract. We present automated techniques for the explanation of counterexamples, where a counter-example should be understood as a sequence of program statements. Our approach is ...
FORTE
2000
13 years 9 months ago
2000
The paper addresses the problem of test derivation from partially defined specifications. A specification is modeled by an Input/Output FSM such that transitions from some states ...