A Simple Refinement Language for Casl

We extend Casl architectural specifications with a simple refinement language that allows the formalization of developments as refinement trees. The essence of the extension is to allow refinements of unit specifications in Casl architectural specifications.

[1]  Donald Sannella,et al.  Global Development via Local Observational Construction Steps , 2002, MFCS.

[2]  Cliff B. Jones,et al.  Modularizing the Formal Description of a Database System , 1990, VDM Europe.

[3]  Donald Sannella,et al.  Architectural Specifications in CASL , 2002, Formal Aspects of Computing.

[4]  Peter D. Mosses,et al.  CASL User Manual , 2004, Lecture Notes in Computer Science.

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

[6]  Egidio Astesiano,et al.  Algebraic Foundations of Systems Specification , 1999, IFIP State-of-the-Art Reports.

[7]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[8]  Douglas R. Smith.  Designware: Software Development by Refinement , 1999, CTCS.

[9]  Donald Sannella,et al.  Toward formal development of programs from algebraic specifications: Implementations revisited , 1987, TAPSOFT, Vol.1.

[10]  C. A. R. Hoare,et al.  Proof of correctness of data representations , 1972, Acta Informatica.

[11]  M. A. Malik.  Correctness of Data Representations , 1976 .

[12]  Peter D. Mosses,et al.  Casl Reference Manual , 2004, Lecture Notes in Computer Science.

[13]  Patrícia Duarte de Lima Machado,et al.  Unit Testing for CASL Architectural Specifications , 2002, MFCS.

[14]  Robin Milner,et al.  An Algebraic Definition of Simulation Between Programs , 1971, IJCAI.

[15]  Joseph Goguen,et al.  Morphisms and Semantics for Higher Order Parameterized Programming , 2002 .