Complete Program Run

program-proofing

Definition

Complete Program Run

A complete program run is a finite program run whose last configuration has no successor configuration.

Formally, a finite run

$${\gamma }_0\Rightarrow {\gamma }_1\Rightarrow \cdots \Rightarrow {\gamma }_k$$

is complete if there is no $\gamma \in \mathcal{C}$ such that ${\gamma }_k\Rightarrow \gamma$.