This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
Scott Cotton, Eugene Asarin, Oded Maler, Peter Nie...
This paper presents a formal model of the substitution rules for soccer games as they existed at the 1994 World Cup. The model is expressed in VDM and can be animated with the VDMT...
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...