2584 search results - page 181 / 517 » On the Forward Checking Algorithm |
CAV
2010
Springer
14 years 6 days ago
2010
Springer
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
FM
2008
Springer
13 years 9 months ago
2008
Springer
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
TSE
2010
13 years 6 months ago
2010
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
ACSD
2010
IEEE
13 years 6 months ago
2010
IEEE
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
CAV
2010
Springer
14 years 6 days ago
2010
Springer
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...