Implementations of nondeterministic programs

  • Pedro Guerreiro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 167)


Non-determinism is an important concept for program development. Nevertheless, at some low level of detail, the existing machines work in a deterministic manner. Therefore, it is necessary to know how to suppress the non-determinism of a given program, without disturbing its behaviour. This paper treats that problem formally, within the framework of the relational semantics of non-deterministic programs, and provides the justification of the validity of some usual techniques which are based on a intuitive understanding of the concept.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Apt e Plotkin 1981]
    K.R. Apt e G.D. Plotkin, "A Cook's tour of countable non-determinism". ICALP 1981, LNCS 115, pp. 479–494. Springer (1981).Google Scholar
  2. [Back 1981]
    R.-J. Back, "Semantics of unbounded non-determinism". ICALP 1980, LNCS 85, pp. 51–63. Springer (1981).Google Scholar
  3. [Dijkstra 1975]
    E.W. Dijkstra, "Guarded commands, non-determinacy and formal derivation of programs". CACM 18,8 (August 1975), pp. 453–457.Google Scholar
  4. [Dijkstra 1976]
    E.W. Dijkstra, "A Discipline of Programming", Prentice Hall (1976).Google Scholar
  5. [Guerreiro 1980]
    P. Guerreiro, "A relational model for non-deterministic programs and predicate transformers". Fourth International Colloquium on Programming, Paris, 1980. LNCS 83, Springer (1980).Google Scholar
  6. [Guerreiro 1981]
    P. Guerreiro, "Relational semantics of strongly communicating sequential processes". First International Colloquium on the Formalization of Programming Concepts, Peñiscola, Spain, 1981. LNCS 108, Springer (1981).Google Scholar
  7. [Guerreiro 1982]
    P. Guerreiro, "Another characterization of weakest preconditions". Fifth International Symposium on Programming, Torino, 1982. LNCS 137. Springer (1982).Google Scholar
  8. [Guerreiro 1983a]
    P. Guerreiro, "Implementations of nondeterministic programs". Relatório UNL-2/82, Dept. Informática, FCT, UNL (Feb. 1983).Google Scholar
  9. [Guerreiro 1983b]
    P. Guerreiro, "Sílabas-Bruxo — Um sistema de processamento de texto para o Português". Anais do XVI Congresso Brasileiro de Informática. Edição SUCESU, São Paulo, Brasil (1983).Google Scholar
  10. [Hennessy 1982]
    M.C.B. Hennessy, "Powerdomains and non-deterministic recursive functions". Fifth International Symposium on Programming, Torino, 1982. LNCS 137, pp. 178–193. Springer (1982).Google Scholar
  11. [Hoare 1978]
    C.A.R. Hoare, "Communicating sequential processes". CACM 21,8 (August 1978), pp. 666–677.Google Scholar
  12. [Milne e Milner 1979]
    G. Milne e R. Milner, "Concurrent processes and their syntax". JACM 26,2 (April 1980), pp. 302–321.Google Scholar
  13. [Plotkin 1976]
    G.D. Plotkin, "A powerdomain construction". SIAM Journal of Computation 5,3 (1976), pp. 452–487.Google Scholar
  14. [Poigné 1982]
    A. Poigné, "On effective computations of non-deterministic schemes". Fifth International Symposium on Programming, Torino, 1982. LNCS 137, pp. 323–336. Springer (1982).Google Scholar
  15. [de Roever 1976]
    W.P. de Roever, "Dijkstra's predicate transformer, non-determinism, recursion and termination". MFCS 1976, LNCS 45, pp. 472–481. Springer (1976).Google Scholar
  16. [Schmidt 1979]
    G. Schmidt, "Investigating programs in terms of partial graphs". ICALP 1979, LNCS 71, pp. 515–519. Springer (1979).Google Scholar
  17. [Wand 1977]
    M. Wand, "A characterization of weakest preconditions". JCSS 15 (1977) pp. 209–212.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Pedro Guerreiro
    • 1
  1. 1.Departamento de Informática Faculdade de Ciências e TecnologiaUniversidade Nova de LisboaMonte da CaparicaPortugal

Personalised recommendations