Skip to main content
Springer Nature Link
Log in

Toward formal development of programs from algebraic specifications: Model-theoretic foundations

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 623))

Included in the following conference series:

Abstract

This paper presents in an informal way the main ideas underlying our work on the model-theoretic foundations of algebraic specification and program development. We attempt to offer an overall view, rather than new results, and focus on the basic motivation behind the technicalities presented elsewhere and on the conclusions from this work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. Barwise. Axioms for abstract model theory. Ann. Math. Logic 7, 221–265 (1974).

    Article  Google Scholar 

  2. M. Bidoit et al (eds.) Algebraic System Specification and Development: A Survey and Annotated Bibliography. Springer LNCS 501 (1991).

    Google Scholar 

  3. R. Burstall and J. Goguen. Putting theories together to make specifications. Proc. 5th Intl. Joint Conf. on Artificial Intelligence, Cambridge, Massachusetts, 1045–1058 (1977).

    Google Scholar 

  4. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984).

    Article  Google Scholar 

  5. H. Ehrig, H.-J. Kreowski, B. Mahr and P. Padawitz. Algebraic implementation of abstract data types. Theoretical Computer Science 20, 209–263 (1982).

    Google Scholar 

  6. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification I: Equations and Initial Semantics. Springer (1985).

    Google Scholar 

  7. J. Farrés-Casals. Verification in ASL and Related Specification Languages. Ph.D. thesis, Dept. of Computer Science, Univ. of Edinburgh, to appear (1992).

    Google Scholar 

  8. J. Fitzgerald and C. Jones. Modularizing the formal description of a database system. Proc. VDM'90 Conference, Kiel. Springer LNCS 428 (1990).

    Google Scholar 

  9. M.-C. Gaudel. A first introduction to PLUSS. Technical report, LRI, Université de Paris-Sud, Orsay (1984).

    Google Scholar 

  10. J. Goguen. Parameterized programming. IEEE Trans. on Software Engineering SE-10(5), 528–543 (1984).

    Google Scholar 

  11. J. Goguen and R. Burstall. CAT, a system for the structured elaboration of correct programs from structured specifications. Technical report CSL-118, SRI International (1980).

    Google Scholar 

  12. J. Goguen and R. Burstall. Introducing institutions. Proc. Logics of Programming Workshop, Carnegie-Mellon. Springer LNCS 164, 221–256 (1984).

    Google Scholar 

  13. J. Goguen and R. Burstall. Institutions: abstract model theory for specification and programming. Report ECS-LFCS-90-106, Univ. of Edinburgh (1990). J. ACM, to appear.

    Google Scholar 

  14. J. Goguen and J. Meseguer. Universal realization, persistent interconnection and implementation of abstract modules. Proc. Intl. Colloq. on Automata, Languages and Programming, Aarhus. Springer LNCS 140, 265–281 (1982).

    Google Scholar 

  15. J. Goguen and J. Meseguer. Completeness of many-sorted equational logic. Houston Journal of Mathematics 11(3), 307–334 (1985).

    Google Scholar 

  16. J. Guttag and J. Horning. Formal specification as a design tool. Proc. ACM Symp. on Principles of Programming Languages, Las Vegas, 251–261 (1980).

    Google Scholar 

  17. R. Harper, D. Sannella and A. Tarlecki. Structure and representation in LF. Proc. 4th IEEE Symp. on Logic in Computer Science, Asilomar, 226–237 (1989).

    Google Scholar 

  18. H. Hußmann. Rapid prototyping for algebraic specifications: RAP system user's manual. Report MIP-8504, Universität Passau (1985).

    Google Scholar 

  19. C. Jones. Systematic Software Development using VDM. Prentice Hall (1986).

    Google Scholar 

  20. R. Milner, M. Tofte and R. Harper. The Definition of Standard ML. MIT Press (1990).

    Google Scholar 

  21. J. Morris. A methodology for designing and refining specifications. Proc. 3rd Refinement Workshop, Hursley Park. Springer BCS Workshop series (1990).

    Google Scholar 

  22. P. Nivela and F. Orejas. Initial behaviour semantics for algebraic specifications. Selected Papers from the 5th Workshop on Specification of Abstract Data Types, Gullane. Springer LNCS 332, 184–207 (1988).

    Google Scholar 

  23. F. Orejas. Characterizing composability of abstract implementations. Proc. 1983 Intl. Conf. on Foundations of Computation Theory, Borgholm. Springer LNCS 158 (1983).

    Google Scholar 

  24. H. Partsch. Requirements Engineering. Handbuch der Informatik. Oldenbourg (1991).

    Google Scholar 

  25. H. Reichel. Behavioural equivalence — a unifying concept for initial and final specification methods. Proc. 3rd Hungarian Computer Science Conference, 27–39 (1981).

    Google Scholar 

  26. D. Sannella and R. Burstall. Structured theories in LCF. Proc. Colloq. on Trees in Algebra and Programming, L'Aquila. Springer LNCS 159, 377–391 (1983).

    Google Scholar 

  27. D. Sannella, S. Sokołowski and A. Tarlecki. Toward formal development of programs from algebraic specifications: parameterisation revisited. Report 6/90, FB Informatik, Universität Bremen (1990). Acta Informatica, to appear.

    Google Scholar 

  28. D. Sannella and A. Tarlecki. On observational equivalence and algebraic specification. J. of Computer and System Sciences 34, 150–178 (1987).

    Article  Google Scholar 

  29. D. Sannella and A. Tarlecki. Specifications in an arbitrary institution. Information and Computation 76, 165–210 (1988).

    Article  Google Scholar 

  30. D. Sannella and A. Tarlecki. Toward formal development of programs from algebraic specifications: implementations revisited. Acta Informatica 25, 233–281 (1988).

    Article  Google Scholar 

  31. D. Sannella and A. Tarlecki. Toward formal development of ML programs: foundations and methodology. Proc. 3rd Joint Conf. on Theory and Practice of Software Development, Barcelona. Springer LNCS 352, 375–389 (1989).

    Google Scholar 

  32. D. Sannella and A. Tarlecki. A kernel specification formalism with higher-order parameterisation. Proc. 7th Intl. Workshop on Specification of Abstract Data Types, Wusterhausen. Springer LNCS 534, 274–296 (1991).

    Google Scholar 

  33. D. Sannella and A. Tarlecki. Extended ML: past, present and future. Proc. 7th Intl. Workshop on Specification of Abstract Data Types, Wusterhausen. Springer LNCS 534, 297–322 (1991).

    Google Scholar 

  34. D. Sannella and A. Tarlecki. Foundations of Algebraic Specifications and Formal Program Development. Cambridge Univ. Press, to appear (1993?).

    Google Scholar 

  35. D. Sannella and M. Wirsing. Implementation of parameterised specifications. Proc. Intl. Colloq. on Automata, Languages and Programming, Aarhus. Springer LNCS 140, 473–488 (1982).

    Google Scholar 

  36. D. Sannella and M. Wirsing. A kernel language for algebraic specification and implementation. Proc. 1983 Intl. Conf. on Foundations of Computation Theory, Borgholm. Springer LNCS 158, 413–427 (1983).

    Google Scholar 

  37. 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 

  38. O. Schoett. An observational subset of first-order logic cannot specify the behaviour of a counter. Proc. 8th Symp. on Theoretical Aspects of Computer Science, Hamburg. Springer LNCS 480, 499–510 (1991).

    Google Scholar 

  39. M. Wirsing. Structured algebraic specifications: a kernel language. Theoretical Computer Science 42, 123–249 (1986).

    Article  Google Scholar 

  40. M. Wirsing. Structured specifications: syntax, semantics and proof calculus. Technical report, Universität Passau (1992).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, Edinburgh, UK

    Donald Sannella

  2. Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland

    Andrzej Tarlecki

Authors
  1. Donald Sannella
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Tarlecki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Kuich

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sannella, D., Tarlecki, A. (1992). Toward formal development of programs from algebraic specifications: Model-theoretic foundations. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_112

Download citation

  • DOI: https://doi.org/10.1007/3-540-55719-9_112

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55719-7

  • Online ISBN: 978-3-540-47278-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics