6608 search results - page 181 / 1322 » On the Completeness of Model Checking |
161
click to vote
ACSC
2004
IEEE
15 years 8 months ago
2004
IEEE
This paper presents a case study for automatic verification using the Communicating Sequential Processes formalism. The case study concerns the Futurebus+ cache coherency standard...
152
click to vote
IJCSA
2007
15 years 4 months ago
2007
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
151
click to vote
TACAS
2004
Springer
15 years 10 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
144
click to vote
LICS
1999
IEEE
15 years 9 months ago
1999
IEEE
A new concurrent form of game semantics is introduced. This overcomes the problems which had arisen with previous, sequential forms of game semantics in modelling Linear Logic. It...
138
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing: MRMC – the only tool t...