Towards Behavioral Maude: Behavioral Membership Equational Logic
暂无分享,去创建一个
[1] B. Jacobs,et al. A tutorial on (co)algebras and (co)induction , 1997 .
[2] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .
[3] Joseph A. Goguen,et al. A hidden agenda , 2000, Theor. Comput. Sci..
[4] 二木 厚吉,et al. Logical semantics for CafeOBJ , 1996 .
[5] Reiko Heckel,et al. Compositional SOS and beyond: a coalgebraic view of open systems , 2002, Theor. Comput. Sci..
[6] Francisco Durn. Termination Checker and Knuth-Bendix Completion Tools for Maude Equational Specifications , 2000 .
[7] Francisco Durán,et al. Parameterized Theories and Views in Full Maude 2.0 , 2000, WRLA.
[8] Lutz Hamel,et al. Behavioural verification and implementation of an optimising compiler for OBJ3 , 1995 .
[9] José Meseguer,et al. A logical theory of concurrent objects and its realization in the Maude language , 1993 .
[10] Razvan Diaconescu,et al. Cafeobj Report - The Language, Proof Techniques, and Methodologies for Object-Oriented Algebraic Specification , 1998, AMAST Series in Computing.
[11] Alan Bundy,et al. Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs , 1997, CADE.
[12] José Meseguer,et al. Unifying Functional, Object-Oriented and Relational Programming with Logical Semantics , 1987, Research Directions in Object-Oriented Programming.
[13] G. Malcolm,et al. Behavioral Correctness Proofs for Objects , 1999 .
[14] Grigore Rosu. Equational axiomatizability for coalgebra , 2001, Theor. Comput. Sci..
[15] Kokichi Futatsugi,et al. Verifying Behavioural Specifications in CafeOBJ Environment , 1999, World Congress on Formal Methods.
[16] Razvan Diaconescu. Grothendieck Institutions , 2002, Appl. Categorical Struct..
[17] Răzvan Diaconescu. Foundations of behavioural specification in rewriting logic , 1996, WRLA.
[18] Grigore Rosu,et al. Institution Morphisms , 2013, Formal Aspects of Computing.
[19] M. Clavel. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications , 2000 .
[20] José Meseguer,et al. Membership algebra as a logical framework for equational specification , 1997, WADT.
[21] Peter Csaba Ölveczky,et al. Real-Time Maude: A Tool for Simulating and Analyzing Real-Time and Hybrid Systems , 2000, WRLA.
[22] Joseph A. Goguen,et al. Institutions: abstract model theory for specification and programming , 1992, JACM.
[23] José Meseguer,et al. Specification and proof in membership equational logic , 2000, Theor. Comput. Sci..
[24] Grigore Rosu. Kan Extensions of Institutions , 1999, J. Univers. Comput. Sci..
[25] Samuel R. Buss,et al. Incompleteness of Behavioral Logics , 2000, CMCS.
[26] Alexander Kurz,et al. On the Duality between Observability and Reachability , 2001, FoSSaCS.
[27] Michel Bidoit,et al. Observational Logic , 1998, AMAST.
[28] Michel Bidoit,et al. Observer Complete Definitions are Behaviourally Coherent , 1999 .
[29] Joseph A. Goguen,et al. Software Engineering with Obj: Algebraic Specification In Action , 2010 .
[30] Bart Jacobs,et al. Inheritance and Cofree Constructions , 1996, ECOOP.
[31] Razvan Diaconescu,et al. Logical foundations of CafeOBJ , 2002, Theor. Comput. Sci..
[32] Alexander Kurz,et al. On institutions for modular coalgebraic specifications , 2002, Theor. Comput. Sci..
[33] Grigore Ro. Behavioral Coinductive Rewriting , 1999 .
[34] Michel Bidoit,et al. Towards an Adequate Notion of Observation , 1992, ESOP.
[35] Grigore Rosu. A Birkhoff-like Axiomatizability Result for Hidden Algebra and Coalgebra , 1998, CMCS.
[36] Michel Bidoit,et al. Observational Specifications and the Indistinguishability Assumption , 1995, Theor. Comput. Sci..
[37] Joseph A. Goguen,et al. Towards an Algebraic Semantics for the Object Paradigm , 1992, COMPASS/ADT.
[38] José Meseguer,et al. A Total Approach to Partial Algebraic Specification , 2002, ICALP.
[39] José Meseguer,et al. Initiality, induction, and computability , 1986 .
[40] Peter Padawitz. Towards the one-tiered design of data types and transition systems , 1997, WADT.
[41] Horst Reichel,et al. Nested Sketches , 1998 .
[42] Michel Bidoit,et al. Proving the Correctness of Algebraically Specified Software: Modularity and Observability Issues , 1991, AMAST.
[43] Grigore Rosu,et al. Circular Coinduction , 2000 .
[44] J. Meseguer,et al. Building Equational Proving Tools by Reflection in Rewriting Logic , 2000 .
[45] José Meseguer,et al. Rewriting Logic as a Metalogical Framework , 2000, FSTTCS.
[46] Corina Cîrstea. Semantic Constructions for Hidden Algebra , 1998, WADT.
[47] Grigore Rosu,et al. Hiding More of Hidden Algebra , 1999, World Congress on Formal Methods.
[48] Joseph A. Goguen,et al. Types as theories , 1991 .
[49] Peter Padawitz,et al. Swinging Data Types: Syntax, Semantics, and Theory , 1995, COMPASS/ADT.
[50] Grigore Rosu,et al. Circular coinductive rewriting , 2000, Proceedings ASE 2000. Fifteenth IEEE International Conference on Automated Software Engineering.
[51] Michaël Rusinowitch,et al. Observational proofs by rewriting , 2002, Theor. Comput. Sci..
[52] Dorel Lucanu,et al. Concurrent object composition in CafeOBJ , 1998 .
[53] Manuel Clavel,et al. Reflection in conditional rewriting logic , 2002, Theor. Comput. Sci..
[54] José Meseguer,et al. Universal Realization, Persistent Interconnection and Implementation of Abstract Modules , 1982, ICALP.
[55] Narciso Martí-Oliet,et al. Maude: specification and programming in rewriting logic , 2002, Theor. Comput. Sci..
[56] Horst Reichel,et al. An approach to object semantics based on terminal co-algebras , 1995, Mathematical Structures in Computer Science.
[57] Grigore Rosu. On implementing behavioral rewriting , 2002, RULE '02.
[58] Grigore Rosu,et al. Hidden Congruent Deduction , 1998, FTP.
[59] Horst Reichel,et al. Defining Equations in Terminal Coalgebras , 1994, COMPASS/ADT.
[60] Alexander Kurz,et al. (Omega, Xi)-Logic: On the Algebraic Extension of Coalgebraic Specifications , 1999, CMCS.
[61] Joseph A. Goguen,et al. Introducing Institutions , 1983, Logic of Programs.
[62] G. Rosu,et al. Towards Behavioral Compiler Correctness Proofs using Hidden Logic , 2002 .
[63] Narciso Martí-Oliet,et al. Towards Maude 2.0 , 2000, WRLA.
[64] Joseph A. Goguen,et al. Proof of correctness of object representations , 1994 .
[65] Grant Malcolm,et al. Behavioural Equivalence, Bisimulation, and Minimal Realisation , 1995, COMPASS/ADT.
[66] Martin Wirsing,et al. Characterizing Behavioural Semantics and Abstractor Semantics , 1994, ESOP.
[67] Grigore Rosu,et al. Behavioral and Coinductive Rewriting , 2000, WRLA.
[68] Rolf Hennicker,et al. Context Induction: a Proof Principle for Behavioural Abstractions , 1990, DISCO.
[69] Jan J. M. M. Rutten,et al. Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..
[70] Francisco Durn. Coherence Checker and Completion Tools for Maude Specifications , 2000 .
[71] Michaël Rusinowitch,et al. Observational Proofs with Critical Contexts , 1998, FASE.
[72] Michel Bidoit,et al. Behavioural Theories and the Proof of Behavioural Properties , 1996, Theor. Comput. Sci..
[73] Michel Bidoit,et al. Modular correctness proofs of behavioural implementations , 1998, Acta Informatica.
[74] Francisco Durán,et al. An extensible module algebra for Maude , 1998, WRLA.
[75] Dirk Pattinson,et al. Modal Logic for Rewriting Theories , 2000, WRLA.
[76] Bart Jacobs,et al. Mongruences and Cofree Coalgebras , 1995, AMAST.
[77] Francisco Durán. The Extensibility of Maude's Module Algebra , 2000, AMAST.
[78] Răzvan Diaconescu,et al. Hiding and behaviour: an institutional approach , 1994 .