Termination of programs represented as interpreted graphs

Authors:
Zohar Manna
Affiliations:
Carnegie-Mellon University, Pittsburgh, Pennsylvania
Venue:
AFIPS '70 (Spring) Proceedings of the May 5-7, 1970, spring joint computer conference
Year:
1970

Citing 2
Cited 1

Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Termination of algorithms

Termination of algorithms

Survey: A survey of state vectors

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work is concerned with the termination problem of interpreted graphs. An interpreted graph can be considered as an abstract model of algorithms; it consists of a directed graph, where: 1. With each vertex v, there is associated a domain Dv, and 2. With each arc a leading from vertex v to vertex v', there is associated a total test predicate Pa(Dv → {T, F}) and a total function fa (Dv* → Dv'), where Dv* = {x | x ∈ Dv ∧ Pa (x) = T}.