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.
KeywordsProof System Proper State Correctness Formula Correctness Proof Composition Rule
Unable to display preview. Download preview PDF.