Deterministic Programs

  • Krzysztof R. Apt
  • Ernst-Rüdiger Olderog
Chapter
Part of the Graduate Texts in Computer Science book series (TCS)

Abstract

In a deterministic program there is at most one instruction to be executed “next,” so that from a given initial state only one execution sequence is generated. In classical programming languages like Pascal, only deterministic programs can be written. In this chapter we study a small class of deterministic programs, which are included in all other classes of programs studied in this book.

Keywords

Proof System Proper State Correctness Formula Correctness Proof Composition Rule 
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.
This is a preview of subscription content, log in to check access

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • Krzysztof R. Apt
    • 1
  • Ernst-Rüdiger Olderog
    • 2
  1. 1.Centrum voor Wiskunde en InformaticaStichling Mathematisch CentrumAmsterdamThe Netherlands
  2. 2.Fachbereich 10-Theoretische InformatikChristian Albrechts UniversityOldenburgGermany

Personalised recommendations