Sciweavers

2488 search results - page 265 / 498
» An improvement in formal verification
Sort
View
ASE
2002
160views more  ASE 2002»
15 years 1 months ago
Proving Invariants of I/O Automata with TAME
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...
CI
2000
114views more  CI 2000»
15 years 1 months ago
A Guided Tour through Some Extensions of the Event Calculus
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...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
FORMATS
2004
Springer
15 years 5 months ago
Some Progress in Satisfiability Checking for Difference Logic
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...
CAISE
2006
Springer
15 years 5 months ago
A Formalisation of the Soccer Substitution Rules
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...
Yves Ledru
FMCAD
2000
Springer
15 years 5 months ago
An Algorithm for Strongly Connected Component Analysis in n log n Symbolic Steps
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...
Roderick Bloem, Harold N. Gabow, Fabio Somenzi