Carroll Morgan
According to our database^{1}, Carroll Morgan
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at dl.acm.org
On csauthors.net:
Bibliography
2017
A Demonic Lattice of Information.
Proceedings of the Concurrency, Security, and Puzzles, 2017
2016
A new rule for almostcertain termination of probabilistic and demonic programs.
CoRR, 2016
Compositional security and collateral leakage.
CoRR, 2016
Proof of OS Scheduling Behavior in the Presence of InterruptInduced Concurrency.
Proceedings of the Interactive Theorem Proving  7th International Conference, 2016
Axioms for Information Leakage.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016
2015
HiddenMarkov program algebra with iteration.
Mathematical Structures in Computer Science, 2015
Controlled OwickiGries Concurrency: Reasoning about the Preemptible eChronos Embedded Operating System.
Proceedings of the Proceedings Workshop on Models for Formal Analysis of Real Systems, 2015
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015
2014
Realreward testing for probabilistic processes.
Theor. Comput. Sci., 2014
Selected papers from the Brazilian Symposium on Formal Methods (SBMF 2011).
Sci. Comput. Program., 2014
An old new notation for elementary probability theory.
Sci. Comput. Program., 2014
Abstractions of noninterference security: probabilistic versus possibilistic.
Formal Asp. Comput., 2014
(In)Formal Methods: The Lost Art  A Users' Manual.
Proceedings of the Engineering Trustworthy Software Systems  First International School, 2014
Abstract Channels and Their Robust InformationLeakage Ordering.
Proceedings of the Principles of Security and Trust  Third International Conference, 2014
Towards a Formal Analysis of Information Leakage for Signature Attacks in Preferential Elections.
Proceedings of the FM 2014: Formal Methods, 2014
Additive and Multiplicative Notions of Leakage, and Their Capacities.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014
2013
Lattices of Information for Security: Deterministic, Demonic, Probabilistic.
Proceedings of the Formal Methods and Software Engineering, 2013
2012
Compositional noninterference from first principles.
Formal Asp. Comput., 2012
Elementary Probability Theory in the Eindhoven Style.
Proceedings of the Mathematics of Program Construction  11th International Conference, 2012
A KantorovichMonadic Powerdomain for Information Hiding, with Probability and Nondeterminism.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012
2011
Compositional refinement in agentbased security protocols.
Formal Asp. Comput., 2011
RealReward Testing for Probabilistic Processes (Extended Abstract)
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011
HiddenMarkov Program Algebra with iteration
CoRR, 2011
2010
Compositional closure for Bayes Risk in probabilistic noninterference
CoRR, 2010
LinearInvariant Generation for Probabilistic Programs:  Automated Support for ProofBased Methods.
Proceedings of the Static Analysis  17th International Symposium, 2010
Compositional Closure for Bayes Risk in Probabilistic Noninterference.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010
The ThousandandOne Cryptographers.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010
2009
The Shadow Knows: Refinement and security in sequential programs.
Sci. Comput. Program., 2009
How to Brewup a Refinement Ordering.
Electr. Notes Theor. Comput. Sci., 2009
Security, Probability and Nearly Fair Coins in the Cryptographers' Café.
Proceedings of the FM 2009: Formal Methods, 2009
Sums and Lovers: Case Studies in Security, Compositionality and Refinement.
Proceedings of the FM 2009: Formal Methods, 2009
Testing Finitary Probabilistic Processes.
Proceedings of the CONCUR 2009  Concurrency Theory, 20th International Conference, 2009
2008
Characterising Testing Preorders for Finite Probabilistic Processes.
Logical Methods in Computer Science, 2008
Using probabilistic Kleene algebra pKA for protocol verification.
J. Log. Algebr. Program., 2008
Characterising Testing Preorders for Finite Probabilistic Processes
CoRR, 2008
Proofs and Refutations for Probabilistic Refinement.
Proceedings of the FM 2008: Formal Methods, 2008
2007
Results on the quantitative µcalculus qMµ.
ACM Trans. Comput. Log., 2007
Remarks on Testing Probabilistic Processes.
Electr. Notes Theor. Comput. Sci., 2007
Characterising Testing Preorders for Finite Probabilistic Processes.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007
Scalar Outcomes Suffice for Finitary Probabilistic Testing.
Proceedings of the Programming Languages and Systems, 2007
2006
A Novel Stochastic Game Via the Quantitative mucalculus.
Electr. Notes Theor. Comput. Sci., 2006
ProgrammingLogic Analysis of Fault Tolerance: Expected Performance of Selfstabilisation.
Proceedings of the Rigorous Development of Complex FaultTolerant Systems [FP6 IST511599 RODIN project], 2006
The Shadow Knows: Refinement of Ignorance in Sequential Programs.
Proceedings of the Mathematics of Program Construction, 8th International Conference, 2006
Using Probabilistic Kleene Algebra for Protocol Verification.
Proceedings of the Relations and Kleene Algebra in Computer Science, 2006
2005
Abstraction, Refinement and Proof for Probabilistic Systems
Monographs in Computer Science, Springer, ISBN: 9780387270067, 2005
Probabilistic guarded commands mechanized in HOL.
Theor. Comput. Sci., 2005
Abstraction and refinement in probabilistic systems.
SIGMETRICS Performance Evaluation Review, 2005
An elementary proof that Herman's Ring is Theta (N^{2}).
Inf. Process. Lett., 2005
Memoryless Strategies for Stochastic Games via Domain Theory.
Electr. Notes Theor. Comput. Sci., 2005
Probabilistic Guarded Commands Mechanized in HOL.
Electr. Notes Theor. Comput. Sci., 2005
The Challenge of Probabilistic Event B  Extended Abstract.
Proceedings of the ZB 2005: Formal Specification and Development in Z and B, 2005
Development via Refinement in Probabilistic B  Foundation and Case Study.
Proceedings of the ZB 2005: Formal Specification and Development in Z and B, 2005
2004
Developing and Reasoning About Probabilistic Programs in pGCL.
Proceedings of the Refinement Techniques in Software Engineering, 2004
Deriving Probabilistic Semantics Via the 'Weakest Completion'.
Proceedings of the Formal Methods and Software Engineering, 2004
Of Probabilistic Wp and SPand Compositionality.
Proceedings of the Communicating Sequential Processes: The First 25 Years, 2004
2003
Almostcertain eventualities and abstract probabilities in the quantitative temporal logic qTL.
Theor. Comput. Sci., 2003
Results on the quantitative mucalculus qMu
CoRR, 2003
Probabilistic Termination in B.
Proceedings of the ZB 2003: Formal Specification and Development in Z and B, 2003
Probabilistic Invariants for Probabilistic Machines.
Proceedings of the ZB 2003: Formal Specification and Development in Z and B, 2003
2002
Games, Probability and the Quantitative µCalculus qMµ.
Proceedings of the Logic for Programming, 2002
2001
Partial correctness for probabilistic demonic programs.
Theor. Comput. Sci., 2001
AlmostCertain Eventualities and Abstract Probabilities in the Temporal Logic PTL.
Electr. Notes Theor. Comput. Sci., 2001
Demonic, angelic and unbounded probabilistic choices in sequential programs.
Acta Inf., 2001
Cost Analysis of Games, Using Program Logic.
Proceedings of the 8th AsiaPacific Software Engineering Conference (APSEC 2001), 2001
2000
An Iterator Construct for the Refinement Calculus.
Proceedings of the 4th Irish Workshop on Formal Methods, 2000
1999
An ExpectationTransformer Model for Probabilistic Temporal Logic.
Logic Journal of the IGPL, 1999
1998
The Generalised Substitution Language Extended to Probabilistic Programs.
Proceedings of the B'98: Recent Advances in the Development and Use of the B Method, 1998
1996
Probabilistic Predicate Transformers.
ACM Trans. Program. Lang. Syst., 1996
Unifying wp and wlp.
Inf. Process. Lett., 1996
RefinementOriented Probability for CSP.
Formal Asp. Comput., 1996
1995
Exits in the Refinement Calculus.
Formal Asp. Comput., 1995
Action Systemes, Unbounded Nondeterminism, and Infinite Traces.
Formal Asp. Comput., 1995
1994
Foreword: Special Issue on Mathematics of Program Construction.
Sci. Comput. Program., 1994
Programming from specifications, 2nd Edition.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 9780131232747, 1994
1993
A Single Complete Rule for Data Refinement.
Formal Asp. Comput., 1993
The Refinement Calculus, and Literate Development.
Proceedings of the Formal Program Development  IFIP TC2/WG 2.1 StateoftheArt Report, 1993
1991
Data Refinement of Predicate Transformers.
Theor. Comput. Sci., 1991
1990
Types and Invariants in the Refinement Calculus.
Sci. Comput. Program., 1990
Data Refinement by Calculation.
Acta Inf., 1990
Refinement of StateBased Concurrent Systems.
Proceedings of the VDM '90, 1990
Programming from specifications.
Prentice Hall International Series in computer science, Prentice Hall, ISBN: 9780137262335, 1990
1989
Types and Invariants in the Refinement Calculus.
Proceedings of the Mathematics of Program Construction, 1989
1988
The Specification Statement.
ACM Trans. Program. Lang. Syst., 1988
Procedures, parameters, and abstraction: Separate concerns.
Sci. Comput. Program., 1988
Auxiliary Variables in Data Refinement.
Inf. Process. Lett., 1988
Data Refinement by Miracles.
Inf. Process. Lett., 1988
1987
Laws of Programming.
Commun. ACM, 1987
1985
Global and Logical Time in Distributed Algorithms.
Inf. Process. Lett., 1985
1984
Specification of the UNIX Filing System.
IEEE Trans. Software Eng., 1984
1983
Specification of a simplified Network Service in CSP.
Proceedings of the Analysis of Concurrent Systems, 1983
Specification of a simplified Network Service in Z.
Proceedings of the Analysis of Concurrent Systems, 1983