Advertisement

A reduction specification for DTL

  • J. W. Hughes
  • M. S. Powell
Chapter 5 Submitted Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 134)

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.

Keywords

Input Sequence Language Specification Abstract Syntax Reduction Rule Abstract Machine 
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. 1.
    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)Google Scholar
  2. 2.
    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)Google Scholar
  3. 3.
    Coleman D. and Hughes J.W. "The Clean Determination of Pascal Programs" Acta Informatica 11, pp 195–210 (1979)Google Scholar
  4. 4.
    Hoare C.A.R. "Communicating Sequential Processes" CACM 21, 8 pp 666–677 (August 1978)Google Scholar
  5. 5.
    Hoare C.A.R. and Wirth N. "An Axiomatic Definition of the Programming Language PASCAL" Acta Informatica 2, pp 335–353 (1973)CrossRefGoogle Scholar
  6. 6.
    Hughes J.W. and Powell M.S. "Program Specifications using DTL" Workshop on Program Specification, Aarhus (August 1981)Google Scholar
  7. 7.
    Kahn G. "The Semantics of a Simple Language for Parallel Programming" Information Processing 74 — North Holland Publishing Co (1974)Google Scholar
  8. 8.
    Turner D.A. "A New Implementation Technique for Applicative Languages" Software P and E 9, pp 31–49 (1979)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • J. W. Hughes
    • 1
  • M. S. Powell
    • 1
  1. 1.Department of ComputationU.M.I.S.T.Manchester

Personalised recommendations