Raymond E. Miller, Chee K. Yap
STOC 1978
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. © 1972, ACM. All rights reserved.
Raymond E. Miller, Chee K. Yap
STOC 1978
Richard M. Karp, Raymond E. Miller
SWAT 1967
Raymond E. Miller
IEEE TC
Raymond E. Miller, Takumi Kasai
COMPSAC 1979