Sciweavers

FORTE
1994
13 years 6 months ago
Verifying timing properties of concurrent algorithms
Victor Luchangco, Ekrem Söylemez, Stephen J. ...
FORTE
1994
13 years 6 months ago
An improvement in formal verification
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
Gerard J. Holzmann, Doron Peled
FORTE
1994
13 years 6 months ago
Proving the value of formal methods
The record of successful applications of formal verification techniques is slowly growing. Our ultimate aim, however, is not to perform small pilot projects that show that verific...
Gerard J. Holzmann
FORTE
1994
13 years 6 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue