Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Fairness
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
A Weaker Precondition for Loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
A Discipline of Programming
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Topological Characterizations of Infinite Behaviours of Transition Systems
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the extremely fair treatment of probabilistic algorithms
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fair termination of communicating processes
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
A generic translation between various kinds of recursive trees is presented. It is shown that trees of either finite or countably-infinite branching can be effectively put into one-one correspondence with infinitely-branching trees in such a way that the infinite paths of the latter correspond to the “@@@@-abiding” infinite paths of the former. Here @@@@ an be any member of a very wide class of properties of infinite paths. Two of the applications involve the formulation of large classes of &pgr;11 variants of classical computational problems, and the existence of a general method for proving termination of nondeterministic or concurrent programs under any reasonable notion of fairness.