Parallel program design: a foundation
Parallel program design: a foundation
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic non-determinism
Building on the unity experience: compositionality, fairness and probability in parallelism
Building on the unity experience: compositionality, fairness and probability in parallelism
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Selected papers of the workshop on Topology and completion in semantics
Handbook of logic in computer science (vol. 3)
Probabilistic predicate transformers
ACM Transactions on Programming Languages and Systems (TOPLAS)
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Information Processing Letters
Probabilistic models for the guarded command language
Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
A Discipline of Programming
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Probabilistic guarded commands mechanized in HOL
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Remarks on Testing Probabilistic Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof rules for the correctness of quantum programs
Theoretical Computer Science
Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Predicate transformers for extended probability and non-determinism
Mathematical Structures in Computer Science
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Guarded Commands Mechanized in HOL
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantics of non-deterministic possibility computation
Fuzzy Sets and Systems
| Hi-index | 5.23 |
Recent work in sequential program semantics has produced both an operational (He et al., Sci. Comput. Programming 28(2, 3) (1997) 171-192) and an axiomatic (Morgan et al., ACM Trans. Programming Languages Systems 18(3) (1996) 325-353; Seidel et al., Tech Report PRG-TR-6-96, Programming Research group, February 1996) treatment of total correctness for probabilistic demonic programs, extending Kozen's original work (J. Comput. System Sci. 22 (1981) 328-350; Kozen, Proc. 15th ACM Symp. on Theory of Computing, ACM, New York, 1983) by adding demonic nondeterminism. For practical applications (e.g. combining loop invariants with termination constraints) it is important to retain the traditional distinction between partial and total correctness. Jones (Monograph ECS-LFCS-90-105, Ph.D. Thesis, Edinburgh University, Edinburgh, UK, 1990) defines probabilistic partial correctness for probabilistic, but again not demonic programs. In this paper we combine all the above, giving an operational and axiomatic framework for both partial and total correctness of probabilistic and demonic sequential programs; among other things, that provides the theory to support our earlier---and practical---publication on probabilistic demonic loops (Morgan, in: Jifeng et al. (Eds.), Proc. BCS-FACS Seventh Refinement Workshop, Workshops in Computing, Springer, Berlin, 1996. Copyright 2001 Elsevier Science B.V.