This document is available for browsing on WWW as Hypertext, and for printing on A4 paper in Postscript and DVI formats.
The previous version of this document (version 0.95) summarized the Tentative Design of CASL, the CoFI Algebraic Specification Language. Version 0.96 incorporates several significant changes to the Tentative Design, following its closer investigation by several CoFI task groups. The main changes in the text are highlighted in the same way as this paragraph.This document is the basis for the final CASL Design Proposal, which is to be submitted for approval to the sponsoring IFIP Working Group on Foundations of System Specification (WG 1.3) in May 1997. Please take a close look at this draft version, and report any mistakes or inconsistencies that you notice, as well as pointing out any parts that still need further clarification (bearing in mind the informal nature of this summary). All comments on the Proposed Design of CASL and on this summary should be sent to the CoFI Language Design mailing list (
cofi-language@brics.dk). Deadline for comments: Monday, 12 May, 1997!The language CASL is central to CoFI: it is a reasonably expressive algebraic language for specifying requirements and design for conventional software. From CASL, simpler CoFI languages (e.g., for interfacing with existing tools) are to be obtained by restriction, and CASL is to be incorporated in more advanced CoFI languages (e.g., for specifying reactive systems). CASL strikes a balance between simplicity and expressiveness. The main features of its design are as follows:
Many-sorted basic specifications in CASL denote classes of many-sorted partial first-order structures: algebras where the functions are partial or total, and where also predicates are allowed. Axioms are first-order formulae built from definedness assertions and both strong and existential equations. Sort generation constraints can be stated. Datatype declarations are provided for concise specification of enumerations and products. Subsorted basic specifications provide moreover a simple treatment of subsorts, interpreting subsort inclusion as embedding.
Structured specifications allow translation, reduction, union, and extension of specifications. Extensions may be required to be conservative and/or free; initiality constraints are a special case. A simple form of generic (parametrized) specifications is provided, together with instantiation involving parameter-fitting translations.
Architectural specifications express that the specified software is to be composed from separately-developed, reusable units with clear interfaces.
Finally, libraries allow the (distributed) storage and retrieval of named specifications.
For further details of the original requirements and functionality for the CoFI Common Language for Algebraic Specification, see the Working Documents "Meta-Requirements" and "Meta-Design", accessible via the CoFI Home Page.