4047 search results - page 153 / 810 » Algebraic Model Checking |
151
click to vote
FORMATS
2007
Springer
16 years 12 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
147
click to vote
TACAS
2007
Springer
16 years 10 days ago
2007
Springer
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
149
click to vote
GLVLSI
2006
IEEE
16 years 8 days ago
2006
IEEE
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...
157
click to vote
FATES
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents a method for reducing the cost of test generation. A spanning set for a coverage criterion is a set of entities such that exercising every entity in the spannin...
195
click to vote
FM
2003
Springer
15 years 11 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...