Verifying Behavioural Specifications in CafeOBJ Environment

Authors:
Akira Mori;Kokichi Futatsugi
Affiliations:
-;-
Venue:
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Year:
1999

Citing 12
Cited 1

Behavioural and abstractor specifications

ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Evolving algebras 1993: Lipari guide

Specification and validation methods
Symbolic state model: a new approach for the verification of cache coherence protocols

Symbolic state model: a new approach for the verification of cache coherence protocols
A note on reliable full-duplex transmission over half-duplex links

Communications of the ACM
Distributed Algorithms

Distributed Algorithms
Communication and Concurrency

Communication and Concurrency
Refining Model Checking by Abstract Interpretation

Automated Software Engineering
Semantic Constructions for Hidden Algebra

WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Invariants, Bisimulations and the Correctness of Coalgebraic Refinements

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Distributed cooperative formal methods tools

ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
A low-overhead coherence solution for multiprocessors with private cache memories

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks

ICFEM '97 Proceedings of the 1st International Conference on Formal Engineering Methods

Fostering proof scores in CafeOBJ

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.