Carroll Jeannine Morgan

Carroll Jeannine Morgan's AcademicInfluence.com Rankings

Computer Science

#9193

World Rank

#9659

Historical Rank

Database

#6175

World Rank

#6403

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Carroll Jeannine Morgan's Degrees

PhD Computer Science Stanford University
Masters Computer Science Stanford University
Bachelors Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Why Is Carroll Jeannine Morgan Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Carroll Jeannine Morgan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Programming from specifications (1990) (1341)
Robustness (2020) (450)
Programming from specifications (2nd ed.) (1994) (436)
Laws of programming (1987) (430)
Abstraction, Refinement and Proof for Probabilistic Systems (2004) (396)
Probabilistic predicate transformers (1996) (340)
The specification statement (1988) (315)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science) (2004) (169)
Specification of the UNIX Filing System (1984) (140)
Refinement of State-Based Concurrent Systems (1990) (118)
Characterising Testing Preorders for Finite Probabilistic Processes (2007) (111)
Data Refinement of Predicate Transformers (1991) (101)
The Refinement Calculus (1994) (93)
Of wp and CSP (1990) (93)
Probabilistic guarded commands mechanized in HOL (2005) (92)
Programming Methodology (1974) (82)
Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods (2010) (81)
pGCL: formal reasoning for random algorithms (1998) (73)
Additive and Multiplicative Notions of Leakage, and Their Capacities (2014) (71)
Refinement-oriented probability for CSP (1996) (70)
A new proof rule for almost-sure termination (2017) (68)
Data refinement by calculation (1990) (67)
Compositional Closure for Bayes Risk in Probabilistic Noninterference (2010) (67)
Proof rules for probabilistic loops (1996) (66)
Specification statements and refinements (1987) (66)
Procedures, parameters, and abstraction: Separate concerns (1988) (61)
Abstract Channels and Their Robust Information-Leakage Ordering (2014) (60)
Data Refinement by Miracles (1988) (59)
Testing Finitary Probabilistic Processes (2009) (58)
Results on the quantitative μ-calculus qMμ (2007) (57)
Partial correctness for probabilistic demonic programs (2001) (56)
The Shadow Knows: Refinement of Ignorance in Sequential Programs (2006) (53)
Games, Probability and the Quantitative µ-Calculus qMµ (2002) (53)
The Shadow Knows: Refinement and security in sequential programs (2009) (52)
A single complete rule for data refinement (1993) (48)
Remarks on Testing Probabilistic Processes (2007) (45)
A Probabilistic Temporal Calculus Based on Expectations (1997) (44)
Using Probabilistic Kleene Algebra for Protocol Verification (2006) (43)
Abstraction and refinement in probabilistic systems (2005) (42)
Types and Invariants in the Refinement Calculus (1989) (42)
Axioms for Information Leakage (2016) (39)
Global and Logical Time in Distributed Algorithms (1985) (39)
A probabilistic approach to information hiding (2003) (39)
Theoretical Aspects of Computing - ICTAC 2009 (2009) (39)
Programming from specifications, 2nd Edition (1994) (36)
Demonic, angelic and unbounded probabilistic choices in sequential programs (2001) (35)
Developing and Reasoning About Probabilistic Programs in pGCL (2004) (35)
Scalar Outcomes Suffice for Finitary Probabilistic Testing (2007) (33)
Auxiliary Variables in Data Refinement (1988) (32)
The probabilistic steam boiler: a case study in probabilistic data refinement (1998) (31)
The Science of Quantitative Information Flow (2020) (28)
The Challenge of Probabilistic Event B - Extended Abstract (2005) (26)
Hidden-Markov program algebra with iteration (2011) (23)
Results on the quantitative mu-calculus qMu (2003) (23)
The Generalised Substitution Language Extended to Probabilistic Programs (1998) (22)
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow (2015) (22)
Testing finitary probabilistic processes (extended abstract) (2009) (21)
Probabilistic Termination in B (2003) (21)
Using probabilistic Kleene algebra pKA for protocol verification (2008) (20)
Telephone network (1987) (19)
An Expectation-Transformer Model for Probabilistic Temporal Logic (1999) (19)
Probabilistic Invariants for Probabilistic Machines (2003) (19)
The cuppest capjunctive capping, and Galois (1994) (18)
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism (2012) (17)
Algorithmics (2021) (17)
Controlled Owicki-Gries Concurrency: Reasoning about the Preemptible eChronos Embedded Operating System (2015) (15)
Compositional noninterference from first principles (2010) (15)
Cost analysis of games, using program logic (2001) (14)
Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency (2016) (13)
Sums and Lovers: Case Studies in Security, Compositionality and Refinement (2009) (13)
Action systems, unbounded nondeterminism, and infinite traces (2005) (13)
An elementary proof that Herman's Ring is Theta (N2) (2005) (13)
The Laplace Mechanism has optimal utility for differential privacy over continuous queries (2021) (12)
Unifying wp and wlp (1996) (12)
Laws of the Logical Calculi (1989) (10)
A new rule for almost-certain termination of probabilistic and demonic programs (2016) (10)
Abstractions of non-interference security: probabilistic versus possibilistic (2012) (10)
An axiomatization of information flow measures (2019) (9)
Of Probabilistic Wp and SP-and Compositionality (2004) (8)
Security, Probability and Nearly Fair Coins in the Cryptographers' Café (2009) (8)
(In-)Formal Methods: The Lost Art - A Users' Manual (2014) (8)
Real-reward testing for probabilistic processes (2014) (8)
The Refinement Calculus, and Literate Development (1993) (8)
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (2003) (8)
Proofs and Refutations for Probabilistic Refinement (2008) (7)
Exits in the refinement calculus (2005) (7)
The Thousand-and-One Cryptographers (2010) (7)
Development via Refinement in Probabilistic B - Foundation and Case Study (2005) (7)
Deriving Probabilistic Semantics Via the 'Weakest Completion' (2004) (7)
Compositional refinement in agent-based security protocols (2011) (7)
How to Brew-up a Refinement Ordering (2009) (7)
Refinement (2020) (7)
Elementary Probability Theory in the Eindhoven Style (2012) (6)
Real-Reward Testing for Probabilistic Processes (Extended Abstract) (2011) (4)
Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL (2001) (4)
Correctness by construction for probabilistic programs (2020) (4)
Time service (1987) (4)
Reasoning About Distributed Secrets (2017) (3)
Procedures and invariants in the refinement calculus (1994) (3)
Probably Hoare ? Hoare probably ! (2007) (3)
A Novel Stochastic Game Via the Quantitative mu-calculus (2006) (3)
Privacy in elections: How small is "small"? (2017) (3)
Algebra for Quantitative Information Flow (2017) (3)
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 (1991) (3)
Memoryless Strategies for Stochastic Games via Domain Theory (2005) (2)
An Iterator Construct for the Refinement Calculus (2000) (2)
a nondeterministic lattice of information (2015) (2)
Towards a Formal Analysis of Information Leakage for Signature Attacks in Preferential Elections (2014) (2)
Application-oriented program semantics (1997) (2)
Differential privacy (2020) (2)
Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing (2009) (1)
Proving that Programs Are Differentially Private (2019) (1)
Mathematics of Program Construction: Second International Conference, Oxford, U.K., June 29 - July 3, 1992. Proceedings (1993) (1)
Axiomatics (2018) (1)
A Demonic Lattice of Information (2017) (1)
Specification of a simplified Network Service in CSP (1983) (1)
Program algebra for quantitative information flow (2019) (1)
Specification of a simplified Network Service in Z (1983) (1)
Compositional security and collateral leakage (2016) (1)
Proceedings of the $6^{th}$ International Colloquium on Theoretical Aspects of Computing (ICTAC'09) (2009) (1)
Theoretical aspects of computing -- ICTAC 2009 : 6th International Colloquium, Kuala Lumpur, Malaysia, August 16-20, 2009 : proceedings (2009) (1)
Quantitative information flow in sequential computer programs (2020) (0)
Timing attacks on blinded and bucketed cryptography (2020) (0)
The role of mathematical specifications (1987) (0)
Posterior vulnerability and leakage (2020) (0)
Flexible and scalable privacy assessment for very large datasets, with an application to official governmental microdata (2022) (0)
Channels (2020) (0)
Compositional noninterference from first principles (2010) (0)
Programming Research Group Hierarchical Reasoning in Probabilistic Csp Hierarchical Reasoning in Probabilistic Csp (1996) (0)
A prime decomposition result for parallel systems (1976) (0)
The Dalenius perspective (2020) (0)
Under consideration for publication in Formal Aspects of Computing Compositional noninterference from first principles (2010) (0)
How to Develop an Intuition for Risk... and Other Invisible Phenomena (Invited Talk) (2022) (0)
On $$ \mathit {g} $$ -vulnerability (2020) (0)
On some single-step and stepwise multiple comparison procedures based on ranked data (2001) (0)
Introduction (2020) (0)
Multi-party computation: The Three Judges protocol (2020) (0)
36 Ofwp and CSP (0)
Iteration and nontermination (2020) (0)
Lattices of Information for Security: Deterministic, Demonic, Probabilistic (2013) (0)
Hidden-Markov modeling of QIF in sequential programs (2020) (0)
Mathematics of Program Construction (1992) (0)
Modeling secrets (2020) (0)
Preface (2011) (0)
Voting systems (2020) (0)
Quantitative methods in security and safety critical applications (NII Shonan Meeting 2012-10) (2012) (0)
Almost-Certain Eventualities and Abstract Probabilities in Quantitative Temporal Logic (2004) (0)
Mathematics of Program Construction: Proceedings of the 2nd International Conference, Oxford, U. K., June-July 1992 (1993) (0)
Programming Research Group Probabilistic Predicate Transformers: Part 2 Probabilistic Predicate Transformers: Part 2 (1996) (0)
Foreword: Special Issue on Mathematics of Program Construction (1994) (0)
Programming Research Group a Probabilistic Temporal Calculus Based on Expectations a Probabilistic Temporal Calculus Based on Expectations (1997) (0)
Selected papers from the Brazilian Symposium on Formal Methods (SBMF 2011) (2014) (0)
Proceedings of the Second International Conference on Mathematics of Program Construction (1992) (0)
An old new notation for elementary probability theory (2014) (0)
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. (1991) (0)
Refinement and Security in Sequential Programs Ï¿¿ (0)
Categorical Information Flow (2019) (0)
Reservation service (1987) (0)
Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications (2011) (0)
Capacity (2018) (0)
The Crowds protocol (2020) (0)
Preface (2020) (0)
Authentication of user names (1987) (0)
Program algebra for QIF (2020) (0)
The geometry of hypers, gains and losses (2020) (0)
Composition of channels (2020) (0)
Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation (2006) (0)
Defense against side channels (2020) (0)
Programming: The derivation of algorithms: Anne Kaldewaij, (Prentice-Hall, Hemel Hempstead, United Kingdom, 1990), ISBN 0-13-204108-1 (paperback).☆ (1992) (0)