R. Diaconescu and K. Futatsugi, "Logical foundations of CafeOBJ," Theoretical Computer Science, vol. 285, no. 2, pp. 289--318, 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... [3] To achieve this we applied rewriting logic that extends the pure rewriting paradigm allowing for a logical control of the application of the rewriting rules by strategies [21,7] Important programming environments based on the rewriting logic paradigm are ELAN [9,7] Maude [21,8] and Cafe OBJ [12]. The impact of rewriting logic as a successful programming paradigm in computer science as well as of the applicability of the related programming environments is witnessed by [20] All our experiments were implemented in ELAN because of its great flexibility and easy manipulation of strategies. ....

R. Diaconescu and K. Futatsugi, Logical foundations of CafeOBJ, pages 289-318 of [20].

....denotes the category of theories over I, see [10] Definition 24. Given two institutions I = Sign; Mod;Sen; j= and I (Sign ; Mod ; Sen ; j= then an institution theoroidal forward morphism , from I to I is ( Phi; fi; ff) where: However, the most recent version of [7] treats coherence assertions as sentences. This terminology is a preliminary attempt to bring some order to the chaos of relationships among institutions, by using names that suggest the nature of the relationship involved. 15 Phi : Sign Th(I ) is a map such that Phi; U : Sign ....

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ, 1999. Submitted for publication.

....coinduction [11, 22, 18, 12, 13, 15] and context induction [16, 6, 1] are among the most frequent techniques to prove behavioral equivalences of states and they both require human intervention. Proving automatically behavioral equivalences is a useful feature of specification languages. CafeOBJ [4, 5] has implemented behavioral rewriting 2 to make behaviorally sound reductions of terms. In this report, we propose a new technique which combines behavioral rewriting and coinduction. Equational logic is not sound for behavioral satisfaction since there might be operations which are not ....

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ. Submitted for publication.

....the category of theories over I, see [10] Definition 24. Given two institutions I = Sign; Mod;Sen; j= and I 0 = Sign 0 ; Mod 0 ; Sen 0 ; j= 0 ) then an institution theoroidal forward morphism 4 , from I to I 0 is ( Phi; fi; ff) where: 3 However, the most recent version of [8] treats coherence assertions as sentences. 4 This terminology is a preliminary attempt to bring some order to the chaos of relationships among institutions, by using names that suggest the nature of the relationship involved. Phi : Sign Th(I 0 ) is a map such that Phi; U 0 : Sign ....

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ. Submitted for publication.

....At the author s knowledge, coinduction [7, 8] and context induction [10] are among the most frequent techniques to prove behavioral equivalences of states and they both require human intervention. Proving automatically behavioral equivalences is a useful feature of specification languages. CafeOBJ [1, 2] has implemented behavioral rewriting to make behaviorally sound reductions of terms. In this report, we propose a new technique which combines behavioral rewriting and coinduction. Equational logic is not sound for behavioral satisfaction since there might be operations which are not behaviorally ....

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ. Submitted for publication.

....[74, 87] object oriented specification (OOZE [3] requirements tracing (TOOR [130] higher order functional programming [97, 110] and LOTOS style specification for communication protocols [127, 128] Recent developments within the OBJ community include CafeOBJ, Maude, and CASL. CafeOBJ [26, 27] is being built at the Japan Institute of Science and Technology under the direction of Prof. Kokichi Futatsugi; it extends OBJ3 with hidden algebra [55, 80, 68, 67] for behavioral specification, and with rewriting logic [113, 114] for applications programming. Maude [112, 16] is being built at ....

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ, 1999. Submitted for publication.

....systems, etc. 1.3 CafeOBJ Logical Foundations CafeOBJ is a declarative language with firm mathematical and logical foundations in the same way as other OBJ family languages (OBJ, Eqlog [15, 3] FOOPS [16] Maude [20] are. The reference paper for the CafeOBJ mathematical foundations is [6], while the book [7] gives a somehow less mathematical easy to read (including many examples) presentation of the semantics of CafeOBJ. In this section we give a very brief overview of the CafeOBJ logical and mathematical foundations, for a full understanding of this aspect of CafeOBJ the reader ....

....[7] gives a somehow less mathematical easy to read (including many examples) presentation of the semantics of CafeOBJ. In this section we give a very brief overview of the CafeOBJ logical and mathematical foundations, for a full understanding of this aspect of CafeOBJ the reader is referred to [6] and [7] The mathematical semantics of CafeOBJ is based on state of the art algebraic specification concepts and results, and is strongly based on category theory and the theory of institutions [11, 5, 9] The following are the principles governing the logical and mathematical foundations of ....

[Article contains additional citation context not shown here]

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ. 1998. Submitted to publication.

....operations is given by MEL. 1.1.6. Logical semantics. CafeOBJ is a declarative language with firm mathematical and logical foundations in the same way as other OBJ family languages (OBJ, Eqlog [18, 4] FOOPS [19] Maude [25] are. The reference paper for the CafeOBJ mathematical foundations is [6], while the book [8] gives a somehow less mathematical easy to read (including many examples) presentation of the semantics of CafeOBJ. In this section we give a very brief overview of the CafeOBJ logical and mathematical foundations, for a full understanding of this aspect of CafeOBJ the reader ....

....[8] gives a somehow less mathematical easy to read (including many examples) presentation of the semantics of CafeOBJ. In this section we give a very brief overview of the CafeOBJ logical and mathematical foundations, for a full understanding of this aspect of CafeOBJ the reader is referred to [6] and [8] The mathematical semantics of CafeOBJ is based on state of the art algebraic specification concepts and results, and is strongly based on category theory and the theory of institutions 4 [14, 5, 11] The following are the principles governing the logical and mathematical foundations of ....

[Article contains additional citation context not shown here]

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ. 1998. Submitted to publication.

No context found.

R. Diaconescu and K. Futatsugi, "Logical foundations of CafeOBJ," Theoretical Computer Science, vol. 285, no. 2, pp. 289--318, 2002.

No context found.

Razvan Diaconescu and Kokichi Futatsugi. Logical foundations of CafeOBJ. Journal of Theoretical Computer Science, 285(2):289-318, August 2002.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC