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.
Research supported by SERC Research Grant GR/F 59070 under the Alvey Programme (IKBS 103).
Research supported by SERC Research Grant GR/F 10606 under the Alvey Programme, and by a grant from the Science & Engineering Research Board of McMaster University.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
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.
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).
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.
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.
J V Tucker and J I Zucker, “Program correctness over abstract data types, with error state semantics,” CWI Monograph 6, North Holland, 1988.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tucker, J.V., Zucker, J.I. (1991). Toward a general theory of computation and specification over abstract data types. In: Akl, S.G., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '90. ICCI 1990. Lecture Notes in Computer Science, vol 468. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53504-7_69
Download citation
DOI: https://doi.org/10.1007/3-540-53504-7_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53504-1
Online ISBN: 978-3-540-46677-2
eBook Packages: Springer Book Archive