777 search results - page 84 / 156 » Model Checking with Formula-Dependent Abstract Models |
CAV
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. Operator precedence grammars define a classical Boolean and deterministic context-free family (called Floyd languages or FLs). FLs have been shown to strictly include the...
STTT
2010
14 years 4 months ago
2010
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
RTCSA
1999
IEEE
15 years 2 months ago
1999
IEEE
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
RTAS
2006
IEEE
15 years 3 months ago
2006
IEEE
A notable features of many proposed Wireless Sensor Networks (WSNs) deployments is their scale: hundreds to thousands of nodes linked together. In such systems, modeling the state...