Global development via local observational construction steps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2420, Issue , 2002, Pages 1-24

  Bidoit, Michel ^a   Sannella, Donald ^b   Tarlecki, Andrzej ^c  

^a CNRS   (France)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARCHITECTURAL SPECIFICATIONS; CONSTRUCTION STEPS; EXPRESSIVE POWER; GLOBAL DEVELOPMENT;

SPECIFICATIONS;

EID: 23044533050     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_1     Document Type: Conference Paper

References (34)

1. 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 http://www.brics.dk/Projects/CoFI/Documents/CASL/Summary/.
2. E. Astesiano, B. Krieg-Brückner and H.-J. Kreowski, eds. Algebraic Foundations ofSystems Specification. Springer (1999).
3. G. Bernot. Good functors… are those preservingphilosoph y! Proc. 2nd Summer Conf. on Category Theory and Computer Science CTCS’87, Springer LNCS 283, 182–195 (1987).
4. 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).
5. M. Bidoit and R. Hennicker. Modular correctness proofs of behavioural implementations. Acta Informatica 35(11):951–1005 (1998).
6. 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 LNCS 1059, 241–256 (1996).
7. M. Bidoit, R. Hennicker and M. Wirsing. Behavioural and abstractor specifications. Science ofComputer Programming 25:149–186 (1995).
8. M. Bidoit, D. Sannella and A. Tarlecki. Architectural specifications in Casl. Formal Aspects ofComputing, to appear (2002). Available at http://www.lsv.ens-cachan.fr/Publis/PAPERS/BST-FAC2002.ps. Extended abstract: Proc. 7th Intl. Conf. on Algebraic Methodology and Software Technology, AMAST’98. Springer LNCS 1548, 341–357 (1999).
9. The CoFI Task Group on Semantics. Semantics of the Common Algebraic Specification Language Casl. Available at http://www.brics.dk/Projects/CoFI/Documents/CASL/Semantics/ (2002).
10. H. Ehrigand, H.-J. Kreowski. Refinement and implementation. In:[AKBK99], 201–242.
11. H. Ehrig, H.-J. Kreowski, B. Mahr and P. Padawitz. Algebraic implementation of abstract data types. Theoretical Comp. Sci. 20:209–263 (1982).
12. H. Ehrigand B. Mahr. Fundamentals ofA lgebraic Specification I: Equations and Initial Semantics. Springer (1985).
13. H. Ganzinger. Parameterized specifications: parameter passing and implementation with respect to observability. ACM Transactions on Programming Languages and Systems 5:318–354 (1983).
14. A. Ginzburg. Algebraic Theory ofA utomata. Academic Press (1968).
15. J. Goguen. Parameterized programming. IEEE Trans. on Software Engineering SE-10(5):528–543 (1984).
16. J. Goguen and R. Burstall. Institutions: abstract model theory for specification and programming. J. ofthe ACM 39:95–146 (1992).
17. J. Goguen and J. Meseguer. szinterconnection and implementation of abstract modules. Proc. 9th Intl. Coll. on Automata, Languages and Programming. Springer LNCS 140, 265–281 (1982).
18. V. Giarratana, F. Gimona and U. Montanari. Observability concepts in abstract data type specifications. Proc. 5th Intl. Symp. on Mathematical Foundations ofComputer Science, Springer LNCS 45, 576–587 (1976).
19. C.A.R. Hoare. Proofs of correctness of data representations. Acta Informatica 1:271–281 (1972).
20. P. Hoffman. Verifyingarc hitectural specifications. Recent Trends in Algebraic development Techniques, Selected Papers, WADT’01, Springer LNCS 2267, 152-175 (2001).
21. F. Honsell, J. Longley, D. Sannella and A. Tarlecki. Constructive data refinement in typed lambda calculus. Proc. 2nd Intl. Conf. on Foundations ofSof tware Science and Computation Structures. Springer LNCS 1784, 149–164 (2000).
22. B. Klin, P. Hoffman, A. Tarlecki, L. Schröder and T. Mossakowski. Checkingamalg amability conditions for Casl architectural specifications. Proc. 26th Intl. Symp. Mathematical Foundations ofComputer Science MFCS’01, Springer LNCS 2136, 451–463 (2001).
23. R. Milner. An algebraic definition of simulation between programs. Proc. 2nd Intl. Joint Conf. on Artificial Intelligence, London, 481–489 (1971).
24. H. Reichel. Behavioural equivalence – a unifyingconcept for initial and final specification methods. Proc. 3rd Hungarian Comp. Sci. Conference, 27–39 (1981).
25. O. Schoett. Data Abstraction and the Correctness ofMo dular Programming. Ph.D. thesis, report CST-42-87, Dept. of Computer Science, Univ. of Edinburgh (1987).
26. O. Schoett. Behavioural correctness of data representations. Science of Computer Programming 14:43–57 (1990).
27. D. Sannella and R. Burstall. Structured theories in LCF. Proc. Colloq. on Trees in Algebra and Programming. Springer LNCS 159, 377–391 (1983).
28. D. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. J. ofComputer and System Sciences 34:150–178 (1987).
29. D. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation 76:165–210 (1988).
30. D. Sannella and A. Tarlecki. Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25:233–281 (1988).
31. 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).
32. D. Sannella and A. Tarlecki. Essential concepts of algebraic specification and program development. Formal Aspects ofComputing 9:229–269 (1997).
33. D. Sannella and A. Tarlecki. Algebraic preliminaries. In:[AKBK99], 13–30.
34. 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).