2872 search results - page 115 / 575 » On (Omega-)Regular Model Checking |
PVM
2007
Springer
15 years 5 months ago
2007
Springer
Formal program verification often requires creating a model of the program and running it through a model-checking tool. However, this model-creation step is itself error prone, t...
TACAS
2007
Springer
15 years 5 months ago
2007
Springer
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
105
click to vote
FM
2003
Springer
15 years 4 months ago
2003
Springer
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
SPIN
2000
Springer
15 years 2 months ago
2000
Springer
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...
DIMACS
1996
15 years 12 days ago
1996
There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...