6608 search results - page 32 / 1322 » On the Completeness of Model Checking |
91
Voted
HPCA
2009
IEEE
16 years 1 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
105
click to vote
FM
2008
Springer
15 years 2 months ago
2008
Springer
Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based ...
105
Voted
SCAM
2009
IEEE
15 years 7 months ago
2009
IEEE
ing Abstractions in Model Checking and Testing Michael Achenbach Klaus Ostermann
73
Voted
CONCUR
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
90
Voted
ICALP
2004
Springer
15 years 6 months ago
2004
Springer
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorith...