A boundary between decidability and undecidability for parallel program schemata (Extended Abstract)

Authors:
Raymond E. Miller
Affiliations:
Mathematical Sciences Department, IBM Thomas J . Watson Research Center, Yorktown Heights, New York
Venue:
Proceedings of ACM conference on Proving assertions about programs
Year:
1972

Citing 1
Cited 1

On Ianov's Program Schemata

Journal of the ACM (JACM)

A Comparison of Some Theoretical Models of Parallel Computation

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some theorems showing undecidability for computational commutativity, boundedness, termination and determinacy of parallel program schemata are given. These results are then compared with contrasting decidability results in [1] showing that the deletion of the hypothesis of repetition-freeness from the decidability theorems produces undecidability.