A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Verifying behavioural specifications in CafeOBJ environment
[chapter]
1999
Lecture Notes in Computer Science
In this paper, we present techniques for automated verification of behavioural specifications using hidden algebra. Two non-trivial examples, the Alternating Bit Protocol and a snooping cache coherence protocol, are presented with complete specification code and proof scores for CafeOBJ verification system. The refinement proof based on behavioural coinduction is given for the first example, and the coherence proof based on invariance is given for the second.
doi:10.1007/3-540-48118-4_36
fatcat:t6h4vbxn2rcpniite4xvrstjre