Is Sometimes Ever Better Than Always?
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving termination with multiset orderings
Communications of the ACM
Communications of the ACM
A Discipline of Programming
Journal of the ACM (JACM) - The MIT Press scientific computation series
Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Fairness in parallel programs: the transformational approach
ACM Transactions on Programming Languages and Systems (TOPLAS)
Adding fair choice to Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A general result on infinite trees and its applications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Term transformers: A new approach to state
ACM Transactions on Programming Languages and Systems (TOPLAS)
Alternating states for dual nondeterminism in imperative programming
Theoretical Computer Science
An unbounded nondeterministic model for CSP-like Languages
IW-FM'98 Proceedings of the 2nd Irish conference on Formal Methods
| Hi-index | 0.00 |