The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carroll Morgan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  52. Testing Finitary Probabilistic Processes. [Citation Graph (, )][DBLP]


  53. Security, Probability and Nearly Fair Coins in the Cryptographers' Café. [Citation Graph (, )][DBLP]


  54. Compositional Closure for Bayes Risk in Probabilistic Noninterference. [Citation Graph (, )][DBLP]


  55. Characterising Testing Preorders for Finite Probabilistic Processes [Citation Graph (, )][DBLP]


  56. Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications [Citation Graph (, )][DBLP]


  57. Compositional closure for Bayes Risk in probabilistic noninterference [Citation Graph (, )][DBLP]


  58. How to Brew-up a Refinement Ordering. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002