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 ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
Michael Emmi, Dimitra Giannakopoulou, Corina S. Pa...
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 ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
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...
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)...