Carroll Morgan

发表

Proving that Programs Are Differentially Private

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2019, APLAS.

Probabilistic Termination in B

Annabelle McIver, Carroll Morgan, Thai Son Hoang, 2003, ZB.

Of wp and CSP

Carroll Morgan, Carroll Morgan, 1990 .

Cost analysis of games, using program logic

Annabelle McIver, Carroll Morgan, 2001, Proceedings Eighth Asia-Pacific Software Engineering Conference.

Remarks on Testing Probabilistic Processes

Carroll Morgan, Matthew Hennessy, Yuxin Deng, 2007, Computation, Meaning, and Logic.

A Demonic Lattice of Information

Carroll Morgan, 2017, Concurrency, Security, and Puzzles.

Probabilistic predicate transformers

Annabelle McIver, Carroll Morgan, Karen Seidel, 1996, TOPL.

A single complete rule for data refinement

Carroll Morgan, Paul H. B. Gardiner, Carroll Morgan, 1993, Formal Aspects of Computing.

Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2001, CATS.

pGCL: formal reasoning for random algorithms

Carroll Morgan, A McI, 1998 .

Of Probabilistic Wp and SP-and Compositionality

Carroll Morgan, Carroll Morgan, 2004, 25 Years Communicating Sequential Processes.

Time service

Carroll Morgan, Roger Gimson, 1987 .

Developing and Reasoning About Probabilistic Programs in pGCL

Annabelle McIver, Carroll Morgan, 2004, PSSE.

Proceedings of the Second International Conference on Mathematics of Program Construction

Jim Woodcock, Carroll Morgan, Richard S. Bird, 1992 .

Programming from specifications, 2nd Edition

Carroll Morgan, Carroll Morgan, 1994, Prentice Hall International series in computer science.

Partial correctness for probabilistic demonic programs

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2001, Theor. Comput. Sci..

The Generalised Substitution Language Extended to Probabilistic Programs

Carroll Morgan, 1998, B.

Programming: The derivation of algorithms: Anne Kaldewaij, (Prentice-Hall, Hemel Hempstead, United Kingdom, 1990), ISBN 0-13-204108-1 (paperback).☆

Carroll Morgan, 1992 .

Lattices of Information for Security: Deterministic, Demonic, Probabilistic

Carroll Morgan, 2013, ICFEM.

Global and Logical Time in Distributed Algorithms

Carroll Morgan, Carroll Morgan, 1985, Inf. Process. Lett..

Characterising Testing Preorders for Finite Probabilistic Processes

Carroll Morgan, Matthew Hennessy, Yuxin Deng, 2007, LICS.

Probabilistic Guarded Commands Mechanized in HOL

Annabelle McIver, Carroll Morgan, Joe Hurd, 2005, Electron. Notes Theor. Comput. Sci..

The Refinement Calculus, and Literate Development

Carroll Morgan, 1993, Formal Program Development.

Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing

Carroll Morgan, Martin Leucker, 2009 .

Programming from specifications (2nd ed.)

Carroll Morgan, Carroll Morgan, 1994 .

Proofs and Refutations for Probabilistic Refinement

Annabelle McIver, Carroll Morgan, C. Gonzalia, 2008, FM.

Specification statements and refinements

Ken Robinson, Carroll Morgan, Carroll Morgan, 1987 .

The Thousand-and-One Cryptographers

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2010, Reflections on the Work of C. A. R. Hoare.

Results on the quantitative mu-calculus qMu

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2003, ArXiv.

Demonic, angelic and unbounded probabilistic choices in sequential programs

Annabelle McIver, Carroll Morgan, 2001, Acta Informatica.

An elementary proof that Herman's Ring is Theta (N2)

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2005, Inf. Process. Lett..

Elementary Probability Theory in the Eindhoven Style

Carroll Morgan, Carroll Morgan, 2012, MPC.

Real-reward testing for probabilistic processes

Carroll Morgan, Matthew Hennessy, Yuxin Deng, 2014, Theor. Comput. Sci..

An Expectation-Transformer Model for Probabilistic Temporal Logic

Annabelle McIver, Carroll Morgan, Carroll Morgan, 1999, Log. J. IGPL.

Specification of the UNIX Filing System

Carroll Morgan, Bernard Sufrin, B. Sufrin, 1984, IEEE Transactions on Software Engineering.

The Challenge of Probabilistic Event B - Extended Abstract

Carroll Morgan, Thai Son Hoang, Jean-Raymond Abrial, 2005, ZB.

Mathematics of Program Construction: Second International Conference, Oxford, U.K., June 29 - July 3, 1992. Proceedings

Jim Woodcock, Carroll Morgan, Richard S. Bird, 1993 .

Mathematics of Program Construction: Proceedings of the 2nd International Conference, Oxford, U. K., June-July 1992

Carroll Morgan, Richard S. Bird, Jim Woodcock, 1993 .

Laws of the Logical Calculi

Carroll Morgan, J. W. Sanders, J. Sanders, 1989 .

Controlled Owicki-Gries Concurrency: Reasoning about the Preemptible eChronos Embedded Operating System

Carroll Morgan, June Andronick, Corey Lewis, 2015, MARS.

Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2003, Theor. Comput. Sci..

The Shadow Knows: Refinement and security in sequential programs

Carroll Morgan, 2009, Sci. Comput. Program..

Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications

Carroll Morgan, Adenilso Simao, Carroll Morgan, 2011 .

The cuppest capjunctive capping, and Galois

Carroll Morgan, 1994 .

Abstractions of non-interference security: probabilistic versus possibilistic

Annabelle McIver, Anthony M. Sloane, Carroll Morgan, 2012, Formal Aspects of Computing.

Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2004 .

An Iterator Construct for the Refinement Calculus

Carroll Morgan, Steve King, 2000, IWFM.

Compositional refinement in agent-based security protocols

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2011, Formal Aspects of Computing.

Foreword: Special Issue on Mathematics of Program Construction

Carroll Morgan, 1994, Sci. Comput. Program..

Scalar Outcomes Suffice for Finitary Probabilistic Testing

Carroll Morgan, Yuxin Deng, Rob J. van Glabbeek, 2007, ESOP.

Characterising Testing Preorders for Finite Probabilistic Processes

Carroll Morgan, Matthew Hennessy, Yuxin Deng, 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

Auxiliary Variables in Data Refinement

Carroll Morgan, Carroll Morgan, 1988, Inf. Process. Lett..

The logical basis for computer programming, vol. 2: Deductive systems : Zohar Manna and Richard Waldinger, (Addison-Wesley, Wokingham, United Kingdom, 1990), Price £30.55 (hardback), ISBN 0-201-1826-1.

Carroll Morgan, 1991 .

Theoretical aspects of computing -- ICTAC 2009 : 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009 : proceedings

Carroll Morgan, Martin Leucker, 2009 .

Application-oriented program semantics

Annabelle McIver, Carroll Morgan, J. W. Sanders, 1997 .

Program algebra for quantitative information flow

Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja, 2019, J. Log. Algebraic Methods Program..

Refinement of State-Based Concurrent Systems

Jim Woodcock, Carroll Morgan, J. Woodcock, 1990, VDM Europe.

Privacy in elections: How small is "small"?

Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja, 2017, J. Inf. Secur. Appl..

Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow

Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja, 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

The Refinement Calculus

Carroll Morgan, Carroll Morgan, 1994, NATO ASI PDC.

Procedures, parameters, and abstraction: Separate concerns

Carroll Morgan, 1988, Sci. Comput. Program..

Data Refinement by Miracles

Carroll Morgan, 1988, Inf. Process. Lett..

Refinement-oriented probability for CSP

Annabelle McIver, Carroll Morgan, Jeff W. Sanders, 1996, Formal Aspects of Computing.

Reasoning About Distributed Secrets

Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja, 2017, FORTE.

Action systems, unbounded nondeterminism, and infinite traces

Carroll Morgan, Michael J. Butler, Carroll Morgan, 2005, Formal Aspects of Computing.

Selected papers from the Brazilian Symposium on Formal Methods (SBMF 2011)

Carroll Morgan, Adenilso Simao, 2014, Sci. Comput. Program..

3rd Refinement Workshop: Proceedings of the 3rd Refinement Workshop (Organised by BCS-FACS and Sponsored by IBM UK Laboratories, Hursley Park and the Programming Research Group, University of Oxford) 9-11 January 1990, Hursley Park

Jim Woodcock, Carroll Morgan, 1991 .

Memoryless Strategies for Stochastic Games via Domain Theory

Annabelle McIver, Carroll Morgan, 2005, Electron. Notes Theor. Comput. Sci..

Probabilistic guarded commands mechanized in HOL

Annabelle McIver, Carroll Morgan, Joe Hurd, 2005, Theor. Comput. Sci..

Abstraction, Refinement and Proof for Probabilistic Systems

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2004, Monographs in Computer Science.

a nondeterministic lattice of information

Carroll Morgan, 2015 .

How to Brew-up a Refinement Ordering

Carroll Morgan, 2009, Electron. Notes Theor. Comput. Sci..

Unifying wp and wlp

Annabelle McIver, Carroll Morgan, 1996, Inf. Process. Lett..

Programming from specifications

Carroll Morgan, Carroll Morgan, 1990, Prentice Hall International Series in computer science.

A Novel Stochastic Game Via the Quantitative mu-calculus

Annabelle McIver, Carroll Morgan, 2006, Electron. Notes Theor. Comput. Sci..

Testing Finitary Probabilistic Processes

Carroll Morgan, Matthew Hennessy, Yuxin Deng, 2009, CONCUR.

Programming Methodology

Annabelle McIver, Carroll Morgan, Carroll Morgan, 1974, Lecture Notes in Computer Science.

The probabilistic steam boiler: a case study in probabilistic data refinement

Annabelle McIver, Carroll Morgan, Elena Troubitsyna, 1998 .

Deriving Probabilistic Semantics Via the 'Weakest Completion'

Annabelle McIver, Carroll Morgan, Jifeng He, 2004, ICFEM.

Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods

Annabelle McIver, Joost-Pieter Katoen, Carroll Morgan, 2010, SAS.

Types and Invariants in the Refinement Calculus

Carroll Morgan, Carroll Morgan, T. Vickers, 1989, Sci. Comput. Program..

Data refinement by calculation

Carroll Morgan, Paul H. B. Gardiner, Carroll Morgan, 1990, Acta Informatica.

Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency

Carroll Morgan, June Andronick, Corey Lewis, 2016, ITP.

Additive and Multiplicative Notions of Leakage, and Their Capacities

Mário S. Alvim, Annabelle McIver, Geoffrey Smith, 2014, 2014 IEEE 27th Computer Security Foundations Symposium.

Specification of a simplified Network Service in Z

Carroll Morgan, 1983, The Analysis of Concurrent Systems.

Compositional Closure for Bayes Risk in Probabilistic Noninterference pdf

Annabelle McIver, Carroll Morgan, Larissa Meinicke, 2010, ICALP.

Hidden-Markov program algebra with iteration pdf

Annabelle McIver, Carroll Morgan, Larissa Meinicke, 2011, Mathematical Structures in Computer Science.

Abstraction and refinement in probabilistic systems

Annabelle McIver, Carroll Morgan, 2005, PERV.

Types and Invariants in the Refinement Calculus

Carroll Morgan, Trevor Vickers, 1990, Sci. Comput. Program..

Development via Refinement in Probabilistic B - Foundation and Case Study

Annabelle McIver, Ken Robinson, Carroll Morgan, 2005, ZB.

Axioms for Information Leakage

Mário S. Alvim, Annabelle McIver, Geoffrey Smith, 2016, 2016 IEEE 29th Computer Security Foundations Symposium (CSF).

Data Refinement of Predicate Transformers

Carroll Morgan, Paul H. B. Gardiner, 1991, Theor. Comput. Sci..

Proceedings of the $6^{th}$ International Colloquium on Theoretical Aspects of Computing (ICTAC'09)

Carroll Morgan, Martin Leucker, M. Leucker, 2009 .

Algebra for Quantitative Information Flow

Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja, 2017, RAMiCS.

Quantitative methods in security and safety critical applications (NII Shonan Meeting 2012-10)

Annabelle McIver, Jin Song Dong, Carroll Morgan, 2012, NII Shonan Meet. Rep..

Exits in the refinement calculus

Carroll Morgan, Steve King, 2005, Formal Aspects of Computing.

Security, Probability and Nearly Fair Coins in the Cryptographers' Café

Annabelle McIver, Carroll Morgan, Larissa Meinicke, 2009, FM.

An old new notation for elementary probability theory

Carroll Morgan, 2014, Sci. Comput. Program..

A new rule for almost-certain termination of probabilistic and demonic programs pdf

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2016, ArXiv.

A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism

Annabelle McIver, Carroll Morgan, Larissa Meinicke, 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2006, RODIN Book.

Categorical Information Flow

Georg Struth, Annabelle McIver, Carroll Morgan, 2019, The Art of Modelling Computational Systems.

Towards a Formal Analysis of Information Leakage for Signature Attacks in Preferential Elections

Annabelle McIver, Carroll Morgan, Roland Wen, 2014, FM.

Authentication of user names

Carroll Morgan, Roger Gimson, Carroll Morgan, 1987 .

Compositional noninterference from first principles

Carroll Morgan, 2010, Formal Aspects of Computing.

Specification of a simplified Network Service in CSP

C. A. R. Hoare, Carroll Morgan, 1983, The Analysis of Concurrent Systems.

The specification statement

Carroll Morgan, Carroll Morgan, Carroll Morgan, 1988, TOPL.

The Shadow Knows: Refinement of Ignorance in Sequential Programs

Carroll Morgan, 2006, MPC.

Results on the quantitative μ-calculus qMμ

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2007, TOCL.

(In-)Formal Methods: The Lost Art - A Users' Manual

Carroll Morgan, 2014, SETSS.

Theoretical Aspects of Computing - ICTAC 2009

Carroll Morgan, Martin Leucker, M. Leucker, 2009, Lecture Notes in Computer Science.

Games, Probability and the Quantitative µ-Calculus qMµ

Annabelle McIver, Carroll Morgan, 2002, LPAR.

Probabilistic Invariants for Probabilistic Machines

Annabelle McIver, Ken Robinson, Carroll Morgan, 2003, ZB.

Compositional security and collateral leakage pdf

Annabelle McIver, Carroll Morgan, Tahiry M. Rabehaja, 2016, ArXiv.

Using probabilistic Kleene algebra pKA for protocol verification

Annabelle McIver, Carroll Morgan, C. Gonzalia, 2008, J. Log. Algebraic Methods Program..

An axiomatization of information flow measures

Mário S. Alvim, Annabelle McIver, Carroll Morgan, 2019, Theor. Comput. Sci..

Using Probabilistic Kleene Algebra for Protocol Verification

Annabelle McIver, Carroll Morgan, E. Cohen, 2006, RelMiCS.

Laws of programming

C. A. R. Hoare, Carroll Morgan, A. W. Roscoe, 1987, CACM.

A probabilistic approach to information hiding

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2003 .

A new proof rule for almost-sure termination

Annabelle McIver, Joost-Pieter Katoen, Carroll Morgan, 2017, Proc. ACM Program. Lang..

Sums and Lovers: Case Studies in Security, Compositionality and Refinement

Annabelle McIver, Carroll Morgan, Carroll Morgan, 2009, FM.

Mathematics of Program Construction

Jim Woodcock, Carroll Morgan, Richard S. Bird, 1992, Lecture Notes in Computer Science.

Abstract Channels and Their Robust Information-Leakage Ordering

Annabelle McIver, Geoffrey Smith, Carroll Morgan, 2014, POST.

The Laplace Mechanism has optimal utility for differential privacy over continuous queries

Annabelle McIver, Carroll Morgan, Natasha Fernandes, 2021, 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

How to Develop an Intuition for Risk... and Other Invisible Phenomena (Invited Talk)

Annabelle McIver, Carroll Morgan, Natasha Fernandes, 2022, CSL.

Algorithmics

Carroll Morgan, Richard S. Bird, Jeremy Gibbons, 2021, IFIP's Exciting First 60+ Years.

Programming Research Group a Probabilistic Temporal Calculus Based on Expectations a Probabilistic Temporal Calculus Based on Expectations

Carroll Morgan, Annabelle Mciver, 1997 .

Proof rules for probabilistic loops

Carroll Morgan, Carroll Morgan, 1996 .

Procedures and invariants in the refinement calculus

Carroll Morgan, Trevor Vickers, 1994 .

Testing finitary probabilistic processes (extended abstract)

Carroll Morgan, Matthew Hennessy, Yuxin Deng, 2009 .

Probably Hoare ? Hoare probably !

Annabelle McIver, Carroll Morgan, JW Sanders, 2007 .