6608 search results - page 10 / 1322 » On the Completeness of Model Checking |
103
click to vote
LATIN
2004
Springer
15 years 5 months ago
2004
Springer
The paper settles a long standing problem for Mazurkiewicz traces: the pure future local temporal logic defined with the basic modalities exists-next and until is expressively com...
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
106
Voted
ATVA
2008
Springer
15 years 1 months ago
2008
Springer
We present a new property driven pruning algorithm in dynamic model checking to efficiently detect race conditions in multithreaded programs. The main idea is to use a lockset base...
108
click to vote
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...