2514 search results - page 190 / 503 » The use of industrial-strength formal methods |
144
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
Networks of communicating finite-state machines equipped with local clocks generate timed MSCs. We consider the problem of checking whether these timed MSCs are "consistent&qu...
172
click to vote
FORMATS
2006
Springer
15 years 10 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
163
click to vote
ICDCSW
2000
IEEE
15 years 10 months ago
2000
IEEE
Model-checking has turned out to be an efficient and relatively easy-to-use technique in the verification of formally described programs. However, there is one major drawback in u...
136
click to vote
SAS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. It is often the case at runtime that variables and registers in programs are "quasi-invariant," i.e., the distribution of the values they take on is very skewed...
169
click to vote
TYPES
2000
Springer
15 years 10 months ago
2000
Springer
We describe a construction of the real numbers carried out in the Coq proof assistant. The basis is a set of axioms for the constructive real numbers as used in the FTA (Fundamenta...