10 search results - page 2 / 2 » A Refinement-Based Correctness Proof of Symmetry Reduced Mod... |
DC
2010
13 years 5 months ago
2010
Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
QSIC
2007
IEEE
13 years 11 months ago
2007
IEEE
The advanced electric power grid is a complex real-time system having both Cyber and Physical components. While each component may function correctly, independently, their composi...
RTCSA
1999
IEEE
13 years 9 months ago
1999
IEEE
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
CSFW
1999
IEEE
13 years 9 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
JACM
2002
13 years 5 months ago
2002
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: ...