4036 search results - page 413 / 808 » Formal Methods |
184
click to vote
CAV
2004
Springer
16 years 6 days ago
2004
Springer
The counterexamples produced by model checkers are often lengthy and difficult to understand. In practical verification, showing the existence of a (potential) bug is not enough: ...
162
Voted
CAV
2004
Springer
16 years 6 days ago
2004
Springer
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
220
click to vote
FMCO
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
164
click to vote
FORMATS
2004
Springer
16 years 5 days ago
2004
Springer
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...
188
click to vote
FORMATS
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. In this paper we introduce a variant of temporal logic tailored for specifying desired properties of continuous signals. The logic is based on a bounded subset of the rea...