Abstract
This paper describes techniques which are being used to specify the behaviour of programs written in DTL. The intended Semantics of DTL are similar in many respects to those of Hoare's CSP. However, DTL forces a hierarchical structure on a network of communicating processes and the language specification described capitalises on this to simplify the definition.
The principle technique employed in the DTL Semantic specification involves the generation of a set of reduction rules. Each rule specifies a class of behaviours for some DTL construct. An important aspect of these reduction rules is that they can be viewed as defining the behaviour of a reduction machine which would execute the specification of a particular DTL program. Such a reduction machine could be implemented by software on conventional machines or with much greater efficiency on the kind of recursive architecture made possible by VLSI technology.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ashcroft E.A. and Wadge W.W. "Lucid: a formal system for writing and proving programs" SIAM J. Computing 5, 3 pp 336–354 (Sept 1976)
Backus J. "Can programming be liberated from the von-Neumann Style?" A Functional Style and its Algebra of Programs" CACM 21, 8 pp 613–641 (August 1978)
Coleman D. and Hughes J.W. "The Clean Determination of Pascal Programs" Acta Informatica 11, pp 195–210 (1979)
Hoare C.A.R. "Communicating Sequential Processes" CACM 21, 8 pp 666–677 (August 1978)
Hoare C.A.R. and Wirth N. "An Axiomatic Definition of the Programming Language PASCAL" Acta Informatica 2, pp 335–353 (1973)
Hughes J.W. and Powell M.S. "Program Specifications using DTL" Workshop on Program Specification, Aarhus (August 1981)
Kahn G. "The Semantics of a Simple Language for Parallel Programming" Information Processing 74 — North Holland Publishing Co (1974)
Turner D.A. "A New Implementation Technique for Applicative Languages" Software P and E 9, pp 31–49 (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hughes, J.W., Powell, M.S. (1982). A reduction specification for DTL. In: Staunstrup, J. (eds) Program Specification. ProgSpec 1981. Lecture Notes in Computer Science, vol 134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11490-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-11490-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11490-1
Online ISBN: 978-3-540-39176-0
eBook Packages: Springer Book Archive