traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...
traction with Interpolants K. L. McMillan Cadence Berkeley Labs Abstract. We describe a model checker for infinite-state sequential proased on Craig interpolation and the lazy abst...
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...