Advertisement

Toward a general theory of computation and specification over abstract data types

  • J. V. Tucker
  • J. I. Zucker
Theory Of Computing, Algorithms And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 468)

Abstract

We describe an ongoing project, to develop a general theory of computation and specification over classes of structures, modelling abstract data types. Applications include logic programming module development and hardware design for synchronous concurrent algorithms.

Key words and phrases

abstract data type computation computability specification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J Derrick and J V Tucker, Logic programming and abstract data types, in “Proceedings of 1988 UK IT Conference,” held under the auspices of the Information Engineering Directorate of the Department of Trade and Industry (DTI), Institute of Electrical Engineers (IEE), 1988, pp. 217–219.Google Scholar
  2. 2.
    N A Harman and J V Tucker, Clocks, retimings, and the formal specification of a UART, in “The Fusion of Hardware Design and Verification,” Proceedings of IFIP Working Group 10.2 Working Conference (ed. G Milne), North-Holland, 1988, pp. 375–396.Google Scholar
  3. 3.
    K M Hobley, B C Thompson, and J V Tucker, Specification and verification of synchronous concurrent algorithms: a case study of a convolution algorithm, in “The Fusion of Hardware Design and Verification,” Proceedings of IFIP Working Group 10.2 Working Conference (ed. G Milne), North-Holland, 1988, pp. 347–374.Google Scholar
  4. 4.
    K Meinke and J V Tucker, Specification and representation of synchronous concurrent algorithms, in “Concurrency '88,” (ed. F H Vogt), Lecture Notes in Computer Science 335, Springer-Verlag, 1988, pp. 163–180.Google Scholar
  5. 5.
    K Meinke and J V Tucker, Universal algebra, in “Handbook of Logic in Computer Science,” (ed. S Abramsky, D Gabbay, T Maibaum), Oxford University Press (to appear).Google Scholar
  6. 6.
    J C Shepherdson, Algorithmic procedures, generalised Turing algorithms, and elementary recursion theory, in “Harvey Friedman's Research on the Foundations of Mathematics,” (ed. L A Harrington et al.), North-Holland, 1985, pp. 285–308.Google Scholar
  7. 7.
    B C Thompson and J V Tucker, A parallel deterministic language and its application to synchronous concurrent algorithms, in “Proceedings of 1988 UK IT Conference, held under the auspices of the Information Engineering Directorate of the Department of Trade and Industry (DTI), Institute of Electrical Engineers (IEE),” 1988, pp. 228–231.Google Scholar
  8. 8.
    J V Tucker and J I Zucker, “Program correctness over abstract data types, with error state semantics,” CWI Monograph 6, North Holland, 1988.Google Scholar
  9. 9.
    J V Tucker and J I Zucker, Horn programs and semicomputable relations on abstract structures, in “Proceedings of the 16th International Colloquium on Automata, Languages and Programming, Stresa, Italy,” (ed. G Ausiello et al.) Lecture Notes in Computer Science 372, Springer-Verlag, 1989, pp. 745–760.Google Scholar
  10. 10.
    J V Tucker and J I Zucker, Provable computable functions on abstract data types, Department of Computer Science & Systems, McMaster University, Technical Report 90-02, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • J. V. Tucker
    • 1
  • J. I. Zucker
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity College of SwanseaSwanseaWales
  2. 2.Department of Computer Science and SystemsMcMaster UniversityHamiltonCanada

Personalised recommendations