Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Carroll Morgan
Carroll C. Morgan
2010 – today
- 2012
[j35]Carroll Morgan: Compositional noninterference from first principles. Formal Asp. Comput. 24(1): 3-26 (2012)- [c30]Annabelle McIver, Larissa Meinicke, Carroll Morgan: A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism. LICS 2012: 461-470
- [c29]
- 2011
- [j34]A. K. McIver, Carroll C. Morgan: Compositional refinement in agent-based security protocols. Formal Asp. Comput. 23(6): 711-737 (2011)
- [c28]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan: Real-Reward Testing for Probabilistic Processes (Extended Abstract). QAPL 2011: 61-73
- [e4]Adenilso da Silva Simão, Carroll Morgan (Eds.): Formal Methods, Foundations and Applications - 14th Brazilian Symposium, SBMF 2011, São Paulo, Brazil, September 26-30, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7021, Springer 2011, ISBN 978-3-642-25031-6
- [i4]Annabelle McIver, Larissa Meinicke, Carroll Morgan: Hidden-Markov Program Algebra with iteration. CoRR abs/1102.0333 (2011)
- 2010
- [c27]Annabelle McIver, Larissa Meinicke, Carroll Morgan: Compositional Closure for Bayes Risk in Probabilistic Noninterference. ICALP (2) 2010: 223-235
- [c26]Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, Carroll C. Morgan: Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods. SAS 2010: 390-406
- [i3]Annabelle McIver, Larissa Meinicke, Carroll Morgan: Compositional closure for Bayes Risk in probabilistic noninterference. CoRR abs/1007.1054 (2010)
2000 – 2009
- 2009
- [j33]Carroll Morgan: How to Brew-up a Refinement Ordering. Electr. Notes Theor. Comput. Sci. 259: 123-141 (2009)
- [j32]Carroll Morgan: The Shadow Knows: Refinement and security in sequential programs. Sci. Comput. Program. 74(8): 629-653 (2009)
- [c25]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan: Testing Finitary Probabilistic Processes. CONCUR 2009: 274-288
- [c24]Annabelle McIver, Larissa Meinicke, Carroll Morgan: Security, Probability and Nearly Fair Coins in the Cryptographers' Café. FM 2009: 41-71
- [c23]Annabelle McIver, Carroll C. Morgan: Sums and Lovers: Case Studies in Security, Compositionality and Refinement. FM 2009: 289-304
- [e3]Martin Leucker, Carroll Morgan (Eds.): Theoretical Aspects of Computing - ICTAC 2009, 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009. Proceedings. Lecture Notes in Computer Science 5684, Springer 2009, ISBN 978-3-642-03465-7
- [e2]Suzana Andova, Annabelle McIver, Pedro R. D'Argenio, Pieter J. L. Cuijpers, Jasen Markovski, Carroll Morgan, Manuel Núñez (Eds.): Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications. EPTCS 13, 2009
- 2008
- [j31]A. K. McIver, C. Gonzalia, E. Cohen, Carroll C. Morgan: Using probabilistic Kleene algebra pKA for protocol verification. J. Log. Algebr. Program. 76(1): 90-111 (2008)
- [j30]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan: Characterising Testing Preorders for Finite Probabilistic Processes. Logical Methods in Computer Science 4(4) (2008)
- [c22]A. K. McIver, Carroll C. Morgan, C. Gonzalia: Proofs and Refutations for Probabilistic Refinement. FM 2008: 100-115
- [i2]Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan: Characterising Testing Preorders for Finite Probabilistic Processes. CoRR abs/0810.3708 (2008)
- 2007
- [j29]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)
- [j28]Annabelle McIver, Carroll Morgan: Results on the quantitative µ-calculus qMµ. ACM Trans. Comput. Log. 8(1) (2007)
- [c21]Yuxin Deng, Rob J. van Glabbeek, Carroll Morgan, Chenyi Zhang: Scalar Outcomes Suffice for Finitary Probabilistic Testing. ESOP 2007: 363-378
- [c20]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang: Characterising Testing Preorders for Finite Probabilistic Processes. LICS 2007: 313-325
- 2006
- [j27]Annabelle McIver, Carroll Morgan: A Novel Stochastic Game Via the Quantitative mu-calculus. Electr. Notes Theor. Comput. Sci. 153(2): 195-212 (2006)
- [c19]Annabelle McIver, E. Cohen, Carroll Morgan: Using Probabilistic Kleene Algebra for Protocol Verification. RelMiCS 2006: 296-310
- [c18]
- [c17]Carroll Morgan, Annabelle McIver: Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation. RODIN Book 2006: 288-305
- 2005
- [j26]Joe Hurd, Annabelle McIver, Carroll Morgan: Probabilistic Guarded Commands Mechanized in HOL. Electr. Notes Theor. Comput. Sci. 112: 95-111 (2005)
- [j25]Carroll Morgan, Annabelle McIver: Memoryless Strategies for Stochastic Games via Domain Theory. Electr. Notes Theor. Comput. Sci. 130: 23-37 (2005)
- [j24]Annabelle McIver, Carroll Morgan: An elementary proof that Herman's Ring is Theta (N2). Inf. Process. Lett. 94(2): 79-84 (2005)
- [j23]Annabelle McIver, Carroll Morgan: Abstraction and refinement in probabilistic systems. SIGMETRICS Performance Evaluation Review 32(4): 41-47 (2005)
- [j22]Joe Hurd, Annabelle McIver, Carroll Morgan: Probabilistic guarded commands mechanized in HOL. Theor. Comput. Sci. 346(1): 96-112 (2005)
- [c16]Carroll Morgan, Thai Son Hoang, Jean-Raymond Abrial: The Challenge of Probabilistic Event B - Extended Abstract. ZB 2005: 162-171
- [c15]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
- 2004
- [c14]Carroll Morgan: Of Probabilistic Wp and SP-and Compositionality. 25 Years Communicating Sequential Processes 2004: 220-241
- [c13]Jifeng He, Carroll Morgan, Annabelle McIver: Deriving Probabilistic Semantics Via the 'Weakest Completion'. ICFEM 2004: 131-145
- [c12]Annabelle McIver, Carroll Morgan: Developing and Reasoning About Probabilistic Programs in pGCL. PSSE 2004: 123-155
- 2003
- [j21]Annabelle McIver, Carroll Morgan: Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. Theor. Comput. Sci. 293(3): 507-534 (2003)
- [c11]
- [c10]Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan: Probabilistic Invariants for Probabilistic Machines. ZB 2003: 240-259
- [i1]Annabelle McIver, Carroll Morgan: Results on the quantitative mu-calculus qMu. CoRR cs.LO/0309024 (2003)
- 2002
- [c9]Annabelle McIver, Carroll Morgan: Games, Probability and the Quantitative µ-Calculus qMµ. LPAR 2002: 292-310
- 2001
- [j20]Annabelle McIver, Carroll Morgan: Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Inf. 37(4/5): 329-354 (2001)
- [j19]Annabelle McIver, Carroll Morgan: Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL. Electr. Notes Theor. Comput. Sci. 42: 12-40 (2001)
- [j18]Annabelle McIver, Carroll Morgan: Partial correctness for probabilistic demonic programs. Theor. Comput. Sci. 266(1-2): 513-541 (2001)
- [c8]
- 2000
- [c7]
1990 – 1999
- 1999
- [j17]Carroll Morgan, Annabelle McIver: An Expectation-Transformer Model for Probabilistic Temporal Logic. Logic Journal of the IGPL 7(6): 779-804 (1999)
- 1998
- [c6]Carroll Morgan: The Generalised Substitution Language Extended to Probabilistic Programs. B 1998: 9-25
- 1996
- [j16]Carroll Morgan, Annabelle McIver, Karen Seidel, Jeff W. Sanders: Refinement-Oriented Probability for CSP. Formal Asp. Comput. 8(6): 617-647 (1996)
- [j15]
- [j14]Carroll Morgan, Annabelle McIver, Karen Seidel: Probabilistic Predicate Transformers. ACM Trans. Program. Lang. Syst. 18(3): 325-353 (1996)
- 1995
- [j13]Michael J. Butler, Carroll Morgan: Action Systemes, Unbounded Nondeterminism, and Infinite Traces. Formal Asp. Comput. 7(1): 37-53 (1995)
- [j12]Steve King, Carroll Morgan: Exits in the Refinement Calculus. Formal Asp. Comput. 7(1): 54-76 (1995)
- 1994
- [b2]Carroll C. Morgan: Programming from specifications, 2nd Edition. Prentice Hall International series in computer science, Prentice Hall 1994, ISBN 978-0-13-123274-7, pp. I-XV, 1-332
- [j11]Carroll Morgan: Foreword: Special Issue on Mathematics of Program Construction. Sci. Comput. Program. 22(1-2): 1-2 (1994)
- 1993
- [j10]Paul H. B. Gardiner, Carroll Morgan: A Single Complete Rule for Data Refinement. Formal Asp. Comput. 5(4): 367-382 (1993)
- [c5]Carroll Morgan: The Refinement Calculus, and Literate Development. Formal Program Development 1993: 161-182
- [e1]Richard S. Bird, Carroll Morgan, Jim Woodcock (Eds.): Mathematics of Program Construction, Second International Conference, Oxford, U.K., June 29 - July 3, 1992, Proceedings. Lecture Notes in Computer Science 669, Springer 1993, ISBN 3-540-56625-2
- 1991
- [j9]Paul H. B. Gardiner, Carroll Morgan: Data Refinement of Predicate Transformers. Theor. Comput. Sci. 87(1): 143-162 (1991)
- 1990
- [b1]Carroll C. Morgan: Programming from specifications. Prentice Hall International Series in computer science, Prentice Hall 1990, ISBN 978-0-13-726233-5, pp. I-XI, 1-255
- [j8]Carroll Morgan, Trevor Vickers: Types and Invariants in the Refinement Calculus. Sci. Comput. Program. 14(2-3): 281-304 (1990)
- [c4]Jim Woodcock, Carroll Morgan: Refinement of State-Based Concurrent Systems. VDM Europe 1990: 340-351
1980 – 1989
- 1989
- [j7]Carroll Morgan, Paul H. B. Gardiner: Data Refinement by Calculation. Acta Inf. 27(6): 481-503 (1989)
- [c3]
- 1988
- [j6]
- [j5]
- [j4]
- 1987
- [j3]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
- [j2]Carroll Morgan: Global and Logical Time in Distributed Algorithms. Inf. Process. Lett. 20(4): 189-194 (1985)
- 1984
- [j1]Carroll Morgan, Bernard Sufrin: Specification of the UNIX Filing System. IEEE Trans. Software Eng. 10(2): 128-142 (1984)
- 1983
- [c2]Carroll Morgan: Specification of a simplified Network Service in Z. The Analysis of Concurrent Systems 1983: 318-344
- [c1]Carroll Morgan, C. A. R. Hoare: Specification of a simplified Network Service in CSP. The Analysis of Concurrent Systems 1983: 345-353
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:21 CEST by the dblp team