Advertisement

The Foundational Legacy of ASL

  • Donald Sannella
  • Andrzej Tarlecki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8950)

Abstract

We recall the kernel algebraic specification language ASL and outline its main features in the context of the state of research on algebraic specification at the time it was conceived in the early 1980s. We discuss the most significant new ideas in ASL and the influence they had on subsequent developments in the field and on our own work in particular.

Keywords

Proof System Semantic Consequence Proof Rule Equational Logic Abstract Data Type 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Asp97]
    Aspinall, D.: Type Systems for Modular Programming and Specification. Ph.D. thesis, University of Edinburgh, Department of Computer Science (1997)Google Scholar
  2. [BBB+85]
    Bauer, F.L., Berghammer, R., Broy, M., Dosch, W., Geiselbrechtinger, F., Gnatz, R., Hangel, E., Hesse, W., Krieg-Brückner, B., Laut, A., Matzner, T., Möller, B., Nickl, F., Partsch, H., Pepper, P.A., Samelson, K., Wirsing, M., Wössner, H.: The Munich Project CIP. LNCS, vol. 183. Springer, Heidelberg (1985)CrossRefGoogle Scholar
  3. [BG80]
    Burstall, R.M., Goguen, J.A.: The semantics of Clear, a specification language. In: Bjorner, D. (ed.) Abstract Software Specifications. LNCS, vol. 86, pp. 292–332. Springer, Heidelberg (1980)CrossRefGoogle Scholar
  4. [BH06]
    Bidoit, M., Hennicker, R.: Constructor-based observational logic. Journal of Logic and Algebraic Programming 67(1-2), 3–51 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [BHW95]
    Bidoit, M., Hennicker, R., Wirsing, M.: Behavioural and abstractor specifications. Science of Computer Programming 25(2-3), 149–186 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  6. [BM04]
    Bidoit, M., Mosses, P.D. (eds.): CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004), http://www.informatik.uni-bremen.de/cofi/index.php/CASL
  7. [Bor05]
    Borzyszkowski, T.: Generalized interpolation in first order logic. Fundamenta Informaticae 66(3), 199–219 (2005)MathSciNetzbMATHGoogle Scholar
  8. [BST02]
    Bidoit, M., Sannella, D., Tarlecki, A.: Architectural specifications in CASL. Formal Aspects of Computing 13, 252–273 (2002)CrossRefzbMATHGoogle Scholar
  9. [BST08]
    Bidoit, M., Sannella, D., Tarlecki, A.: Observational interpretation of CASL specifications. Mathematical Structures in Computer Science 18, 325–371 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  10. [CK90]
    Chang, C.-C., Keisler, H.J.: Model Theory, 3rd edn. North-Holland (1990)Google Scholar
  11. [DGS93]
    Diaconescu, R., Goguen, J.A., Stefaneas, P.: Logical support for modularisation. In: Huet, G., Plotkin, G. (eds.) Logical Environments, pp. 83–130. Cambridge University Press (1993)Google Scholar
  12. [Dia08]
    Diaconescu, R.: Institution-Independent Model Theory. Birkhäuser (2008)Google Scholar
  13. [EKMP82]
    Ehrig, H., Kreowski, H.-J., Mahr, B., Padawitz, P.: Algebraic implementation of abstract data types. Theoretical Computer Science 20, 209–263 (1982)CrossRefzbMATHGoogle Scholar
  14. [EM85]
    Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1. In: EATCS Monographs on Theoretical Computer Science, vol. 6. Springer (1985)Google Scholar
  15. [FJ90]
    Fitzgerald, J.S., Jones, C.B.: Modularizing the formal description of a database system. In: Langmaack, H., Hoare, C.A.R., Bjorner, D. (eds.) VDM 1990. LNCS, vol. 428, pp. 189–210. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  16. [Gan83]
    Ganzinger, H.: Parameterized specifications: Parameter passing and implementation with respect to observability. ACM Transactions on Programming Languages and Systems 5(3), 318–354 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  17. [GB80]
    Goguen, J.A., Burstall, R.M.: CAT, a system for the structured elaboration of correct programs from structured specifications. Technical Report CSL-118, Computer Science Laboratory, SRI International (1980)Google Scholar
  18. [GB92]
    Goguen, J.A., Burstall, R.M.: Institutions: Abstract model theory for specification and programming. Journal of the Association for Computing Machinery 39(1), 95–146 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  19. [GGM76]
    Giarratana, V., Gimona, F., Montanari, U.: Observability concepts in abstract data type specifications. In: Mazurkiewicz, A. (ed.) MFCS 1976. LNCS, vol. 45, pp. 567–578. Springer, Heidelberg (1976)CrossRefGoogle Scholar
  20. [GM82]
    Goguen, J.A., Meseguer, J.: Universal realization, persistent interconnection and implementation of abstract modules. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 265–281. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  21. [GR04]
    Goguen, J.A., Roşu, G.: Composing hidden information modules over inclusive institutions. In: Owe, O., Krogdahl, S., Lyche, T. (eds.) From Object-Orientation to Formal Methods. LNCS, vol. 2635, pp. 96–123. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  22. [GTW76]
    Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness and implementation of abstract data types. Technical Report RC 6487, IBM Watson Research Center, Yorktown Heights NY (1976), Also in: Yeh, R.T. (ed.): Current Trends in Programming Methodology. Data Structuring, vol. IV, pp. 80–149. Prentice-Hall (1978)Google Scholar
  23. [HWB97]
    Hennicker, R., Wirsing, M., Bidoit, M.: Proof systems for structured specifications with observability operators. Theoretical Computer Science 173(2), 393–443 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  24. [KBS91]
    Krieg-Brückner, B., Sannella, D.: Structuring specifications in-the-large and in-the-small: Higher-order functions, dependent types and inheritance in SPECTRAL. In: Abramsky, S. (ed.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol. 494, pp. 103–120. Springer, Heidelberg (1991)Google Scholar
  25. [LB88]
    Lampson, B., Burstall, R.M.: Pebble, a kernel language for modules and abstract data types. Information and Computation 76(2-3), 278–346 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  26. [MAH06]
    Mossakowski, T., Autexier, S., Hutter, D.: Development graphs — proof management for structured specifications. Journal of Logic and Algebraic Programming 67(1-2), 114–145 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  27. [MT14]
    Mossakowski, T., Tarlecki, A.: A relatively complete calculus for structured heterogeneous specifications. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol. 8412, pp. 441–456. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  28. [Rei81]
    Reichel, H.: Behavioural equivalence — a unifying concept for initial and final specification methods. In: Proceedings of the 3rd Hungarian Computer Science Conference, pp. 27–39 (1981)Google Scholar
  29. [RG00]
    Roşu, G., Goguen, J.A.: On equational Craig interpolation. Journal of Universal Computer Science 6(1), 194–200 (2000)MathSciNetzbMATHGoogle Scholar
  30. [Sch90]
    Schoett, O.: Behavioural correctness of data representations. Science of Computer Programming 14(1), 43–57 (1990)MathSciNetCrossRefzbMATHGoogle Scholar
  31. [SST92]
    Sannella, D., Sokołowski, S., Tarlecki, A.: Toward formal development of programs from algebraic specifications: Parameterisation revisited. Acta Informatica 29(8), 689–736 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  32. [ST87]
    Sannella, D., Tarlecki, A.: On observational equivalence and algebraic specification. Journal of Computer and System Sciences 34, 150–178 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  33. [ST88a]
    Sannella, D., Tarlecki, A.: Specifications in an arbitrary institution. Information and Computation 76(2-3), 165–210 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  34. [ST88b]
    Sannella, D., Tarlecki, A.: Toward formal development of programs from algebraic specifications: Implementations revisited. Acta Informatica 25, 233–281 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  35. [ST06]
    Sannella, D., Tarlecki, A.: Horizontal composability revisited. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 296–316. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  36. [ST12]
    Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. In: Monographs in Theoretical Computer Science. An EATCS Series. Springer (2012)Google Scholar
  37. [ST14]
    Sannella, D., Tarlecki, A.: Property-oriented semantics of structured specifications. Mathematical Structures in Computer Science 24(2), e240205 (2014)Google Scholar
  38. [SW82]
    Sannella, D., Wirsing, M.: Implementation of parameterised specifications. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 473–488. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  39. [SW83]
    Sannella, D., Wirsing, M.: A kernel language for algebraic specification and implementation. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 413–427. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  40. [Tar86]
    Tarlecki, A.: Bits and pieces of the theory of institutions. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 334–360. Springer, Heidelberg (1986)CrossRefGoogle Scholar
  41. [Tar11]
    Tarlecki, A.: Some nuances of many-sorted universal algebra: A review. Bulletin of the European Association for Theoretical Computer Science 104, 89–111 (2011)MathSciNetzbMATHGoogle Scholar
  42. [TWW82]
    Thatcher, J.W., Wagner, E.G., Wright, J.B.: Data type specification: Parameterization and the power of specification techniques. ACM Transactions on Programming Languages and Systems 4(4), 711–732 (1982)CrossRefzbMATHGoogle Scholar
  43. [Wan79]
    Wand, M.: Final algebra semantics and data type extensions. Journal of Computer and System Sciences 19, 27–44 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  44. [Wir82]
    Wirsing, M.: Structured algebraic specifications. In: Proceedings of the AFCET Symposium on Mathematics for Computer Science, Paris, pp. 93–107 (1982)Google Scholar
  45. [Wir86]
    Wirsing, M.: Structured algebraic specifications: A kernel language. Theoretical Computer Science 42(2), 123–249 (1986)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Donald Sannella
    • 1
  • Andrzej Tarlecki
    • 2
  1. 1.Laboratory for Foundations of Computer ScienceUniversity of EdinburghUK
  2. 2.Institute of InformaticsUniversity of WarsawPoland

Personalised recommendations