CoFI: The Common Framework Initiative for Algebraic Specification and Development

An open collaborative effort has been initiated: to design a common framework for algebraic specification and development of software. The rationale behind this initiative is that the lack of such a common framework greatly hinders the dissemination and application of research results in algebraic specification. In particular, the proliferation of specification languages, some differing in only quite minor ways from each other, is a considerable obstacle for the use of algebraic methods in industrial contexts, making it difficult to exploit standard examples, case studies and training material. A common framework with widespread acceptance throughout the research community is urgently needed.

[1]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[2]  Hans-Dieter Ehrich,et al.  Specification of abstract data types , 1996 .

[3]  Hans-Jörg Kreowski,et al.  Recent Trends in Data Type Specification , 1985, Informatik-Fachberichte.

[4]  J. Davenport.  Editor , 1960 .

[5]  Till Mossakowski.  Colimits of order-sorted specifications , 1997, WADT.

[6]  Donald Sannella,et al.  On Observational Equivalence and Algebraic Specification , 1985, TAPSOFT, Vol.1.

[7]  Christine Choppy,et al.  Interchange Format for Inter-operability of Tools and Translation: The SALSA and ASSPEGIQU+/LP Experience , 1995, COMPASS/ADT.

[8]  Bernd Krieg-Brückner,et al.  Seven Years of COMPASS , 1995, COMPASS/ADT.

[9]  Hans-Jörg Kreowski,et al.  Algebraic system specification and development , 1991, Lecture Notes in Computer Science.

[10]  Anders Sandholm,et al.  Distributed Safety Controllers for Web Services , 1997, FASE.

[11]  Andrzej Tarlecki.  Moving Between Logical Systems , 1995, COMPASS/ADT.

[12]  Rob J. van Glabbeek,et al.  The meaning of negative premises in transition system specifications II , 1996, J. Log. Algebraic Methods Program..

[13]  Joseph A. Goguen,et al.  Institutions: abstract model theory for specification and programming , 1992, JACM.

[14]  Vincenzo Manca,et al.  Equational Type Logic , 1990, Theor. Comput. Sci..

[15]  Till Mossakowski,et al.  Equivalences among Various Logical Frameworks of Partial Algebras , 1995, CSL.

[16]  Jan A. Bergstra,et al.  The Discrete Time TOOLBUS - A Software Coordination Architecture , 1998, Science of Computer Programming.

[17]  Till Mossakowski,et al.  From Total Equational to Partial First-Order Logic , 1999, Algebraic Foundations of Systems Specification.

[18]  Christopher Alexander,et al.  The Timeless Way of Building , 1979 .

[19]  José Meseguer,et al.  Membership algebra as a logical framework for equational specification , 1997, WADT.

[20]  Ingo Claßen,et al.  Categorical concepts for parameterized partial specifications , 1995, Mathematical Structures in Computer Science.

[21]  Peter D. Mosses,et al.  Unified algebras and institutions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[22]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[23]  Peter D. Mosses.  CoFI: The Common Framework Initiative for Algebraic Specification , 1996, Bull. EATCS.

[24]  J. Meseguer.  Rewriting as a unified model of concurrency , 1990, OOPSLA/ECOOP '90.

[25]  Olivier Danvy,et al.  Higher-Order Rewriting and Partial Evaluation , 1997, RTA.

[26]  Peter Burmeister,et al.  Partial algebras—survey of a unifying approach towards a two-valued model theory for partial algebras , 1982 .

[27]  Jacques Loeckx,et al.  Algorithmic specifications: a constructive specification method for abstract data types , 1987, TOPL.

[28]  Anne Elisabeth Haxthausen,et al.  Permissive Subsorted Partial Logic in CASL , 1997, AMAST.