Share This Author
Principles of OBJ2
Four clsssrs of design principles for 01352 ate discussed briefly in this inttoduct, and then in mote detail brlnw: motlulntizntion and patnmcteriantion; (2) subsorts; (3) implcmcntnt; and (4) inlrtaction and flexibility.
Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification
Basic specifications - signatures models sentences satisfaction proof system structuring specifications - fundamental semantics concepts module imports views parameterized modules module expressions…
Logical foundations of CafeOBJ
An overview of CAFE specification environment-an algebraic approach for creating, verifying, and maintaining formal specifications over networks
- K. Futatsugi, A. T. Nakagawa
- Computer ScienceFirst IEEE International Conference on Formal…
- 12 November 1997
The paper gives an overview and design considerations of the CAFE environment, featuring mainly CafeOBJ and Forsdonnet languages, designed to be a network based environment.
Operational semantics of rewriting with the on-demand evaluation strategy
The operational semantics of rewriting with the on-demand E-strategy is written in CafeOBJ so that the author can deeply understand rewriting withThe on- demand E-Strategy.
Behavioural Coherence in Object-Oriented Algebraic Specification
Some Tips on Writing Proof Scores in the OTS/CafeOBJ Method
The OTS/CafeOBJ method is an instance of the proof score approach to systems analysis, which has been mainly devoted by researchers in the OBJ community. We describe some tips on writing proof scores…
CafeOBJ: Logical Foundations and Methodologies
CafeOBJ is an executable industrial strength multi-logicgebraic specification language which is a modern successor of OBJ and incorporates several new algebraic specification paradigms and its logical foundations are surveyed.
Parameterized programming in OBJ2
OBJ2 is designed to support parameterized programming, using algebraic specification techniques, and provides facilities for user-definable abstract data types, parameterized over very general interfaces.
Proof Scores in the OTS/CafeOBJ Method
A way to write proof scores showing that distributed systems have invariant properties in algebraic specification languages is described, which has been devised through several case studies and can decrease the number of subcases into which the case is split in case analysis.