Algebraically specified programming systems and Hoare's logic

  • J. A. Bergstra
  • J. V. Tucker
Session 11: J. W. deBakker, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


Data Type Conditional Equation Hoare Logic Computable Algebra Algebraic Specification 
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.


  1. [1]
    APT, K.R., Ten years of Hoare's logic, a survey in F.V. JENSEN, B.H. MAYOH and K.K. MØLLER (eds.), Proceedings from 5th Scandinavian Logic Symposium, Aalborg University Press, Aalborg, 1979, 1–44. (A second edition of this paper will appear in ACM Transactions on Programming Languages and Systems.)Google Scholar
  2. [2]
    —, Recursive assertions and parallel programs, Preprint Erasmus University, Rotterdam, 1979.Google Scholar
  3. [3]
    APT, K.R., J.A. BERGSTRA & L.G.L.T. MEERTENS, Recursive assertions are not enough — or are they?, Theoretical Computer Science 8 (1979), 73–87.Google Scholar
  4. [4]
    BACK, R.J.R., Correctness preserving program refinements: proof theory and applications, Mathematical Centre Tracts 131 (1980), Amsterdam.Google Scholar
  5. [5]
    —, Proving total correctness of nondeterministic programs in infinitary logic, to appear in Acta Informatica.Google Scholar
  6. [6]
    DE BAKKER, J.W., Mathematical theory of program correctness, Prentice-Hall International, London, 1980.Google Scholar
  7. [7]
    BERGSTRA, J.A., & J. TERLOUW, A completeness result for algebraic Hoare logics, University of Leiden, Department of Computer Science Report 81-09, Leiden 1981.Google Scholar
  8. [8]
    BERGSTRA, J.A., J. TIURYN & J.V. TUCKER, Floyd's principle correctness theories and program equivalence, Mathematical Centre, Department of Computer Science Research Report IW 145, Amsterdam, 1980. (To appear in Theoretical Computer Science.)Google Scholar
  9. [9]
    BERGSTRA, J.A. & J.V. TUCKER, Algebraic specifications of computable and semicomputable data structures, Mathematical Centre, Department of Computer Science Research Report IW 115, Amsterdam 1979.Google Scholar
  10. [10]
    — & —, A characterisation of computable data types by means of a finite, equational specification method, in J.W. DE BAKKER and J. VAN LEEUWEN (Eds.), Automata, languages and programming, 7th colloquium, Noordwijkerhout, 1980, Springer-Verlag, Berlin, 1980, 76–90.Google Scholar
  11. [11]
    — & —, Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds, Mathematical Centre, Department of Computer Science Research Report IW 128, Amsterdam, 1980.Google Scholar
  12. [12]
    — & —, On bounds for the specification of finite data types by means of equations and conditional equations, Mathematical Centre, Department of Computer Science Research Report IW 131, Amsterdam, 1980.Google Scholar
  13. [13]
    — & —, A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification, Bulletin European Association for Theoretical Computer Science, 11 (1980), 22–33.Google Scholar
  14. [14]
    — & —, Initial and final algebra semantics for data type specifications: two characterisation theorems, Mathematical Centre, Department of Computer Science Research Report IW 142, Amsterdam, 1980.Google Scholar
  15. [15]
    — & —, On the adequacy of finite equational methods for data type specifications, ACM-SIGPLAN Notices 14 (11) (1979) 13–18.Google Scholar
  16. [16]
    BURSTALL, R.M. & J.A. GOGUEN, Putting theories together to make specifications, Proceedings 5th International Joint Conference on Artificial Intelligence, Cambridge, Mass., 1977, 1045–1058.Google Scholar
  17. [17]
    COOK, S.A., Soundness and completeness of an axiom system for program verification, SIAM J. Computing 7 (1978) 70–90.Google Scholar
  18. [18]
    EHRIG, H., H.-J. KREOWSKI, J.W. THATCHER, E. WAGNER, J.B. WRIGHT, Parameterized data types in algebraic specification languages, in J.W. DE BAKKER and J. VAN LEEUWEN (eds.), Automata, languages and programming, 7th Colloquium, Noordwijkerhout, 1980, Springer-Verlag, Berlin, 1980, 157–168.Google Scholar
  19. [19]
    ENGELER, E., Algorithmic logic, in J.W. DE BAKKER (ed.), Foundations of Computer Science, Mathematical Centre Tracts 63 (1975) 57–85.Google Scholar
  20. [20]
    GOGUEN, J.A. & J.J. TARDO, An introduction to OBJ: a language for writing and testing formal algebraic program specifications, Proceedings IEEE Conference on Specifications of Reliable Software, Cambridge, Mass., 1979, 170–189.Google Scholar
  21. [21]
    GOGUEN, J.A., J.W. THATCHER & E.G. WAGNER, An initial algebra approach to the specification, correctness and implementation of abstract data types, in R.T. YEH (ed.), Current trends in programming methodology IV, Data structuring, Prentice-Hall, Engelwood Cliffs, New Jersey, 1978, 80–149.Google Scholar
  22. [22]
    GREIBACH, S.A., Theory of program structures: schemes, semantics, verification, Springer-Verlag, Berlin, 1975.Google Scholar
  23. [23]
    HOARE, C.A.R., An axiomatic basis for computer programming, Communications Association Computing Machinery 12 (1969) 576–583.Google Scholar
  24. [24]
    KAPUR, D., Towards a theory for abstract data types, M.I.T. Laboratory for Computer Science Research Report TR-237, Boston, 1980.Google Scholar
  25. [25]
    MACHTEY, M. & P. YOUNG, An introduction to the general theory of algorithms, North-Holland, New York, 1978.Google Scholar
  26. [26]
    MAL'CEV, A.I., Constructive algebras, I., Russian Mathematical Surveys, 16, (1961), 77–129.Google Scholar
  27. [27]
    MANIN, Y., A course in mathematical logic, Springer-Verlag, New York, 1977.Google Scholar
  28. [28]
    RABIN, M.O., Computable algebra, general theory and the theory of computable fields, Transactions American Mathematical Society, 95, (1960), 341–360.Google Scholar
  29. [29]
    THATCHER, J.W., E.G. WAGNER & J.B. WRIGHT, Data type specification: parameterizations and the power of specification techniques, IBM-T.J. Watson Research Center Report RC 7757, Yorktown Heights, 1979.Google Scholar
  30. [30]
    TUCKER, J.V., Computing in algebraic systems, in F.R. DRAKE and S.S. WAINER (eds.), Recursion theory, its generalisations and applications, Cambridge University Press, Cambridge, 1980, 215–235.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • J. A. Bergstra
    • 1
  • J. V. Tucker
    • 1
  1. 1.Department of Computer ScienceUniversity of LeidenLeidenThe Netherlands

Personalised recommendations