A proof rule for fair termination of guarded commands
Information and Control - The MIT Press scientific computation series
Journal of the ACM (JACM) - The MIT Press scientific computation series
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
The &mgr;-calculus as an assertion-language for fairness arguments
Information and Computation
Temporal predicate transforms and fair termination
Acta Informatica
Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
The existence of refinement mappings
Theoretical Computer Science
Proving correctness with respect to nondeterministic safety specifications
Information Processing Letters
Progress measures for complementation of &ohgr;-automata with applications to temporal logic
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Proving nondeterministically specified safety properties using progress measures
Information and Computation
The Science of Programming
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Impartiality, Justice and Fairness: The Ethics of Concurrent Termination
Proceedings of the 8th Colloquium on Automata, Languages and Programming
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Progress measures and finite arguments for infinite computations
Progress measures and finite arguments for infinite computations
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Transition predicate abstraction and fair termination
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Separating fairness and well-foundedness for the analysis of fair discrete systems
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |