Global Development via Local Observational Construction Steps

  • Michel Bidoit
  • Donald Sannella
  • Andrzej Tarlecki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2420)


The way that refinement of individual “local” components of a specification relates to development of a “global” system from a specification of requirements is explored. Observational interpretation of specifications and refinements add expressive power and flexibility while bringing in some subtle problems. The results are instantiated in the context of Casl architectural specifications.


Model Semantic Global Context Global Development Amalgamation Property Local Construction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ABK+03]_E. Astesiano, M. Bidoit, H. Kirchner, B. Krieg-Brückner, P.D. Mosses, D. Sannella and A. Tarlecki. Casl: The Common Algebraic Specification Language. Theoretical Computer Science, to appear (2003). See also the Casl Summary at
  2. [AKBK99]
    E. Astesiano, B. Krieg-Brückner and H.-J. Kreowski, eds. Algebraic Foundations of Systems Specification. Springer (1999).Google Scholar
  3. [Ber87]
    G. Bernot. Good functors... are those preserving philosophy! Proc. 2nd Summer Conf. on Category Theory and Computer Science CTCS’87, Springer LNCS 283, 182–195 (1987).Google Scholar
  4. [BH93]
    M. Bidoit and R. Hennicker. A general framework for modular implementations of modular systems. Proc. 4th Int. Conf. Theory and Practice of Software Development TAPSoFT’93, Springer LNCS 668, 199–214 (1993).Google Scholar
  5. [BH98]
    M. Bidoit and R. Hennicker. Modular correctness proofs of behavioural implementations. Acta Informatica 35(11):951–1005 (1998).MathSciNetCrossRefGoogle Scholar
  6. [BT96]
    M. Bidoit and A. Tarlecki. Behavioural satisfaction and equivalence in concrete model categories. Proc. 20th Coll. on Trees in Algebra and Computing CAAP’96, Linköping, Springer LNCS1059, 241–256 (1996).Google Scholar
  7. [BHW95]
    M. Bidoit, R. Hennicker and M. Wirsing. Behavioural and abstractor specifications. Science of Computer Programming25:149–186 (1995).MATHMathSciNetCrossRefGoogle Scholar
  8. [BST02]
    M. Bidoit, D. Sannella and A. Tarlecki. Architectural specifications in Casl. Formal Aspects of Computing, to appear (2002). Available at Extended abstract: Proc. 7th Intl. Conf. on Algebraic Methodology and Software Technology, AMAST’98. Springer LNCS 1548, 341–357 (1999).
  9. [CoFI02]
    The CoFI Task Group on Semantics. Semantics of the Common Algebraic Specification Language Casl. Available at (2002).
  10. [EK99]
    H. Ehrig and H.-J. Kreowski. Refinement and implementation. In: B. Krieg-Brückner and H.-J. Kreowski, eds. Algebraic Foundations of Systems Specification. Springer (1999) [AKBK99], 201–242.Google Scholar
  11. [EKMP82]
    H. Ehrig, H.-J. Kreowski, B. Mahr and P. Padawitz. Algebraic implementation of abstract data types. Theoretical Sci. 20:209–263 (1982).MATHGoogle Scholar
  12. [EM85]
    H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification I: Equations and Initial Semantics. Springer (1985).Google Scholar
  13. [Gan83]
    H. Ganzinger. Parameterized specifications: parameter passing and implementation with respect to observability. ACM Transactions on Programming Languages and Systems 5:318–354 (1983).MATHCrossRefGoogle Scholar
  14. [Gin68]
    A. Ginzburg. Algebraic Theory of Automata. Academic Press (1968).Google Scholar
  15. [Gog84]
    J. Goguen. Parameterized programming. IEEE Trans. on Software Engineering SE-10(5):528–543 (1984).CrossRefGoogle Scholar
  16. [GB92]
    J. Goguen and R. Burstall. Institutions: abstract model theory for specification and programming. J. of the ACM 39:95–146 (1992).MATHMathSciNetCrossRefGoogle Scholar
  17. [GM82]
    J. Goguen and J. Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. Proc. 9th Intl. Coll. on Automata, Languages and Programming. Springer LNCS 140, 265–281 (1982).CrossRefGoogle Scholar
  18. [GGM76]
    V. Giarratana, F. Gimona and U. Montanari. Observability concepts in abstract data type specifications. Proc. 5th Intl. Symp. on Mathematical Foundations of Computer Science, Springer LNCS 45, 576–587 (1976).Google Scholar
  19. [Hoa72]
    C.A.R. Proofs of correctness of data representations. Acta Informatica 1:271–281 (1972).CrossRefGoogle Scholar
  20. [Hof01]
    P. Hoffman. Verifying architectural specifications. Recent Trends in Algebraic development Techniques, Selected Papers, WADT’01, Springer LNCS 2267, 152–175 (2001).CrossRefGoogle Scholar
  21. [HLST00]
    F. Honsell, J. Longley, D. Sannella and A. Tarlecki. Constructive data refinement in typed lambda calculus. Proc. 2nd Intl. Conf. on Foundations of Software Science and Computation Structures. Springer LNCS 1784, 149–164 (2000).CrossRefGoogle Scholar
  22. [KHT+01]_B. Klin, P. Hoffman, A. Tarlecki, L. Schröder and T. Mossakowski. Checking amalgamability conditions for Casl architectural specifications. Proc. 26th Intl. Symp. Mathematical Foundations of Computer Science MFCS’01, Springer LNCS 2136, 451–463 (2001).Google Scholar
  23. [Mil71]
    R. Milner. An algebraic definition of simulation between programs. Proc. 2nd Intl. Joint Conf. on Artificial Intelligence, London, 481–489 (1971).Google Scholar
  24. [Rei81]
    H. Reichel. Behavioural equivalence-a unifying concept for initial and final specification methods. Proc. 3rd Hungarian Sci. Conference, 27–39 (1981).Google Scholar
  25. [Sch87]
    O. Schoett. Data Abstraction and the Correctness of Modular Programming. Ph.D. thesis, report CST-42-87, Dept. of Computer Science, Univ. of Edinburgh (1987).Google Scholar
  26. [Sch90]
    O. Schoett. Behavioural correctness of data representations. Science of Computer Programming 14:43–57 (1990).MATHMathSciNetCrossRefGoogle Scholar
  27. [SB83]
    D. Sannella and R. Burstall. Structured theories in LCF. Proc. Colloq. on Trees in Algebra and Programming Springer LNCS 159, 377–391 (1983).Google Scholar
  28. [ST87]
    D. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. J. of Computer and System Sciences 34:150–178 (1987).MATHMathSciNetCrossRefGoogle Scholar
  29. [ST88a]
    D. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation 76:165–210 (1988).MathSciNetCrossRefMATHGoogle Scholar
  30. [ST88b]
    D. Sannella and A. Tarlecki. Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233–281 (1988).MATHMathSciNetCrossRefGoogle Scholar
  31. [ST89]
    D. Sannella and A. Tarlecki. Toward formal development of ML programs: foundations and methodology. Proc. Colloq. on Current Issues in Programming Languages, Intl. Joint Conf. on Theory and Practice of Software Development TAPSOFT’89, Barcelona. Springer LNCS 352, 375–389 (1989).Google Scholar
  32. [ST97]
    D. Sannella and A. Tarlecki. Essential concepts of algebraic specification and program development. Formal Aspects of Computing 9:229–269 (1997).MATHCrossRefGoogle Scholar
  33. [ST99]
    D. Sannella and A. Tarlecki. Algebraic preliminaries. In: B. Krieg-Brückner and H.-J. Kreowski, eds. Algebraic Foundations of Systems Specification. Springer (1999) [AKBK99], 13–30.Google Scholar
  34. [SMT+01]_L. Schröder, T. Mossakowski, A. Tarlecki, P. Hoffman and B. Klin. Semantics of architectural specifications in Casl. Proc. 4th Intl. Conf. Fundamental Approaches to Software Engineering FASE’01, Genova. Springer LNCS 2029, 253–268 (2001).CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Michel Bidoit
    • 1
  • Donald Sannella
    • 2
  • Andrzej Tarlecki
    • 3
  1. 1.Laboratoire Spécification et VérificationCNRS & ENS de CachanFrance
  2. 2.Laboratory for Foundations of Computer ScienceUniversity of EdinburghUK
  3. 3.Institute of InformaticsWarsaw University and Institute of Computer Science, Polish Academy of SciencesWarsawPoland

Personalised recommendations