| 2008 |
|---|
| 53 | EE | Yuxin Deng,
Matthew Hennessy,
Rob J. van Glabbeek,
Carroll Morgan:
Characterising Testing Preorders for Finite Probabilistic Processes
CoRR abs/0810.3708: (2008) |
| 2007 |
|---|
| 52 | EE | Yuxin Deng,
Rob J. van Glabbeek,
Carroll Morgan,
Chenyi Zhang:
Scalar Outcomes Suffice for Finitary Probabilistic Testing.
ESOP 2007: 363-378 |
| 51 | EE | Yuxin Deng,
Rob J. van Glabbeek,
Matthew Hennessy,
Carroll Morgan,
Chenyi Zhang:
Characterising Testing Preorders for Finite Probabilistic Processes.
LICS 2007: 313-325 |
| 50 | EE | Annabelle McIver,
Carroll Morgan:
Results on the quantitative µ-calculus qMµ.
ACM Trans. Comput. Log. 8(1): (2007) |
| 49 | EE | Yuxin Deng,
Rob J. van Glabbeek,
Matthew Hennessy,
Carroll Morgan,
Chenyi Zhang:
Remarks on Testing Probabilistic Processes.
Electr. Notes Theor. Comput. Sci. 172: 359-397 (2007) |
| 2006 |
|---|
| 48 | EE | Carroll Morgan:
The Shadow Knows: Refinement of Ignorance in Sequential Programs.
MPC 2006: 359-378 |
| 47 | EE | Carroll Morgan,
Annabelle McIver:
Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation.
RODIN Book 2006: 288-305 |
| 46 | EE | Annabelle McIver,
E. Cohen,
Carroll Morgan:
Using Probabilistic Kleene Algebra for Protocol Verification.
RelMiCS 2006: 296-310 |
| 45 | EE | Annabelle McIver,
Carroll Morgan:
A Novel Stochastic Game Via the Quantitative mu-calculus.
Electr. Notes Theor. Comput. Sci. 153(2): 195-212 (2006) |
| 2005 |
|---|
| 44 | EE | Carroll Morgan,
Thai Son Hoang,
Jean-Raymond Abrial:
The Challenge of Probabilistic Event B - Extended Abstract.
ZB 2005: 162-171 |
| 43 | EE | Thai Son Hoang,
Zhendong Jin,
Ken Robinson,
Annabelle McIver,
Carroll Morgan:
Development via Refinement in Probabilistic B - Foundation and Case Study.
ZB 2005: 355-373 |
| 42 | EE | Joe Hurd,
Annabelle McIver,
Carroll Morgan:
Probabilistic Guarded Commands Mechanized in HOL.
Electr. Notes Theor. Comput. Sci. 112: 95-111 (2005) |
| 41 | EE | Carroll Morgan,
Annabelle McIver:
Memoryless Strategies for Stochastic Games via Domain Theory.
Electr. Notes Theor. Comput. Sci. 130: 23-37 (2005) |
| 40 | EE | Annabelle McIver,
Carroll Morgan:
An elementary proof that Herman's Ring is Theta (N2).
Inf. Process. Lett. 94(2): 79-84 (2005) |
| 39 | EE | Annabelle McIver,
Carroll Morgan:
Abstraction and refinement in probabilistic systems.
SIGMETRICS Performance Evaluation Review 32(4): 41-47 (2005) |
| 38 | EE | Joe Hurd,
Annabelle McIver,
Carroll Morgan:
Probabilistic guarded commands mechanized in HOL.
Theor. Comput. Sci. 346(1): 96-112 (2005) |
| 2004 |
|---|
| 37 | EE | Carroll Morgan:
Of Probabilistic Wp and SP-and Compositionality.
25 Years Communicating Sequential Processes 2004: 220-241 |
| 36 | EE | Jifeng He,
Carroll Morgan,
Annabelle McIver:
Deriving Probabilistic Semantics Via the 'Weakest Completion'.
ICFEM 2004: 131-145 |
| 35 | EE | Annabelle McIver,
Carroll Morgan:
Developing and Reasoning About Probabilistic Programs in pGCL.
PSSE 2004: 123-155 |
| 2003 |
|---|
| 34 | EE | Annabelle McIver,
Carroll Morgan,
Thai Son Hoang:
Probabilistic Termination in B.
ZB 2003: 216-239 |
| 33 | EE | Thai Son Hoang,
Zhendong Jin,
Ken Robinson,
Annabelle McIver,
Carroll Morgan:
Probabilistic Invariants for Probabilistic Machines.
ZB 2003: 240-259 |
| 32 | EE | Annabelle McIver,
Carroll Morgan:
Results on the quantitative mu-calculus qMu
CoRR cs.LO/0309024: (2003) |
| 31 | | Annabelle McIver,
Carroll Morgan:
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL.
Theor. Comput. Sci. 293(3): 507-534 (2003) |
| 2002 |
|---|
| 30 | EE | Annabelle McIver,
Carroll Morgan:
Games, Probability and the Quantitative µ-Calculus qMµ.
LPAR 2002: 292-310 |
| 2001 |
|---|
| 29 | EE | Carroll Morgan,
Annabelle McIver:
Cost Analysis of Games, Using Program Logic.
APSEC 2001: 351- |
| 28 | EE | Annabelle McIver,
Carroll Morgan:
Demonic, angelic and unbounded probabilistic choices in sequential programs.
Acta Inf. 37(4/5): 329-354 (2001) |
| 27 | EE | Annabelle McIver,
Carroll Morgan:
Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL.
Electr. Notes Theor. Comput. Sci. 42: (2001) |
| 26 | EE | Annabelle McIver,
Carroll Morgan:
Partial correctness for probabilistic demonic programs.
Theor. Comput. Sci. 266(1-2): 513-541 (2001) |
| 2000 |
|---|
| 25 | EE | Steve King,
Carroll Morgan:
An Iterator Construct for the Refinement Calculus.
IWFM 2000 |
| 1999 |
|---|
| 24 | EE | Carroll Morgan,
Annabelle McIver:
An Expectation-Transformer Model for Probabilistic Temporal Logic.
Logic Journal of the IGPL 7(6): 779-804 (1999) |
| 1998 |
|---|
| 23 | EE | Carroll Morgan:
The Generalised Substitution Language Extended to Probabilistic Programs.
B 1998: 9-25 |
| 1996 |
|---|
| 22 | EE | Carroll Morgan,
Annabelle McIver,
Karen Seidel:
Probabilistic Predicate Transformers.
ACM Trans. Program. Lang. Syst. 18(3): 325-353 (1996) |
| 21 | | Carroll Morgan,
Annabelle McIver,
Karen Seidel,
Jeff W. Sanders:
Refinement-Oriented Probability for CSP.
Formal Asp. Comput. 8(6): 617-647 (1996) |
| 20 | EE | Carroll Morgan,
Annabelle McIver:
Unifying wp and wlp.
Inf. Process. Lett. 59(3): 159-163 (1996) |
| 1995 |
|---|
| 19 | | Michael J. Butler,
Carroll Morgan:
Action Systemes, Unbounded Nondeterminism, and Infinite Traces.
Formal Asp. Comput. 7(1): 37-53 (1995) |
| 18 | | Steve King,
Carroll Morgan:
Exits in the Refinement Calculus.
Formal Asp. Comput. 7(1): 54-76 (1995) |
| 1994 |
|---|
| 17 | | Carroll Morgan:
Foreword: Special Issue on Mathematics of Program Construction.
Sci. Comput. Program. 22(1-2): 1-2 (1994) |
| 1993 |
|---|
| 16 | | Richard S. Bird,
Carroll Morgan,
Jim Woodcock:
Mathematics of Program Construction, Second International Conference, Oxford, U.K., June 29 - July 3, 1992, Proceedings
Springer 1993 |
| 15 | | Carroll Morgan:
The Refinement Calculus, and Literate Development.
Formal Program Development 1993: 161-182 |
| 14 | | Paul H. B. Gardiner,
Carroll Morgan:
A Single Complete Rule for Data Refinement.
Formal Asp. Comput. 5(4): 367-382 (1993) |
| 1991 |
|---|
| 13 | | Paul H. B. Gardiner,
Carroll Morgan:
Data Refinement of Predicate Transformers.
Theor. Comput. Sci. 87(1): 143-162 (1991) |
| 1990 |
|---|
| 12 | | Jim Woodcock,
Carroll Morgan:
Refinement of State-Based Concurrent Systems.
VDM Europe 1990: 340-351 |
| 11 | | Carroll Morgan,
Trevor Vickers:
Types and Invariants in the Refinement Calculus.
Sci. Comput. Program. 14(2-3): 281-304 (1990) |
| 1989 |
|---|
| 10 | | Carroll Morgan:
Types and Invariants in the Refinement Calculus.
MPC 1989: 363-378 |
| 9 | | Carroll Morgan,
Paul H. B. Gardiner:
Data Refinement by Calculation.
Acta Inf. 27(6): 481-503 (1989) |
| 1988 |
|---|
| 8 | EE | Carroll Morgan:
The Specification Statement.
ACM Trans. Program. Lang. Syst. 10(3): 403-419 (1988) |
| 7 | | Carroll Morgan:
Data Refinement by Miracles.
Inf. Process. Lett. 26(5): 243-246 (1988) |
| 6 | | Carroll Morgan:
Auxiliary Variables in Data Refinement.
Inf. Process. Lett. 29(6): 293-296 (1988) |
| 1987 |
|---|
| 5 | | C. A. R. Hoare,
Ian J. Hayes,
Jifeng He,
Carroll Morgan,
A. W. Roscoe,
Jeff W. Sanders,
Ib Holm Sørensen,
J. Michael Spivey,
Bernard Sufrin:
Laws of Programming.
Commun. ACM 30(8): 672-686 (1987) |
| 1985 |
|---|
| 4 | | Carroll Morgan:
Global and Logical Time in Distributed Algorithms.
Inf. Process. Lett. 20(4): 189-194 (1985) |
| 1984 |
|---|
| 3 | | Carroll Morgan,
Bernard Sufrin:
Specification of the UNIX Filing System.
IEEE Trans. Software Eng. 10(2): 128-142 (1984) |
| 1983 |
|---|
| 2 | | Carroll Morgan:
Specification of a simplified Network Service in Z.
The Analysis of Concurrent Systems 1983: 318-344 |
| 1 | | Carroll Morgan,
C. A. R. Hoare:
Specification of a simplified Network Service in CSP.
The Analysis of Concurrent Systems 1983: 345-353 |
