2291 search results - page 191 / 459 » Representational Reasoning and Verification |
166
click to vote
FMSD
2006
15 years 6 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
187
click to vote
JUCS
2008
15 years 6 months ago
2008
: This paper gives a definition of ASM refinement suitable for the verification that a protocol implements atomic transactions. We used this definition as the basis of the formal v...
192
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
State-based model checking methods comprise computing and storing reachable states, while stateless model checking methods directly reason about reachable paths using decision proc...
193
click to vote
SEKE
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--Property specification is still one of the most challenging tasks for transference of software verification technology like model checking. The use of patterns has been p...
180
click to vote
ESORICS
2002
Springer
16 years 6 months ago
2002
Springer
We introduce the ISM approach, a framework for modeling and verifying reactive systems in a formal, even machine-checked, way. The framework has been developed for applications in ...