Annabelle McIver

Q: What Schools Are Affiliated With Annabelle McIver

Annabelle McIver is affiliated with the following schools: University of California, Berkeley, University of Oxford, Stanford University, Macquarie University, University of Cambridge

Annabelle McIver's AcademicInfluence.com Rankings

Annabelle McIver

Criminal Justice

#251

World Rank

#280

Historical Rank

Cyber Security

#29

World Rank

#31

Historical Rank

criminal-justice Degrees

Annabelle McIver

Computer Science

#10726

World Rank

#11282

Historical Rank

Cybersecurity

#33

World Rank

#35

Historical Rank

Database

#8579

World Rank

#8990

Historical Rank

computer-science Degrees

Download Badge

Criminal Justice
Computer Science

Annabelle McIver's Degrees

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

Similar Degrees You Can Earn

Why Is Annabelle McIver Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Annabelle K. McIver is a computer scientist whose research involves the use of formal methods and information flow in computer security and the verification of probabilistic systems. Educated in mathematics in the UK, she works in Australia as professor in the School of Computing at Macquarie University, and as one of the founding leaders of Macquarie's Future Communications Research Centre.

(See a Problem?)

Annabelle McIver'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

Robustness (2020) (450)
Abstraction, Refinement and Proof for Probabilistic Systems (2004) (396)
Probabilistic predicate transformers (1996) (340)
Probabilistic Models for the Guarded Command Language (1997) (185)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science) (2004) (169)
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)
A Process Algebra for Wireless Mesh Networks (2012) (77)
Automated Analysis of AODV Using UPPAAL (2012) (71)
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)
Compositional Closure for Bayes Risk in Probabilistic Noninterference (2010) (67)
Operational versus weakest pre-expectation semantics for the probabilistic guarded command language (2014) (66)
Logic for Programming, Artificial Intelligence, and Reasoning (2015) (64)
Generalised Differential Privacy for Text Document Processing (2018) (60)
Abstract Channels and Their Robust Information-Leakage Ordering (2014) (60)
Conditioning in Probabilistic Programming (2015) (58)
Results on the quantitative μ-calculus qMμ (2007) (57)
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV (2013) (57)
Partial correctness for probabilistic demonic programs (2001) (56)
Games, Probability and the Quantitative µ-Calculus qMµ (2002) (53)
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)
A probabilistic approach to information hiding (2003) (39)
Axioms for Information Leakage (2016) (39)
Developing and Reasoning About Probabilistic Programs in pGCL (2004) (35)
Demonic, angelic and unbounded probabilistic choices in sequential programs (2001) (35)
Graphical Modelling for Simulation and Formal Analysis of Wireless Network Protocols (2009) (31)
The probabilistic steam boiler: a case study in probabilistic data refinement (1998) (31)
Towards Automated Proof Support for Probabilistic Distributed Systems (2005) (30)
Formal Techniques for the Analysis of Wireless Networks (2006) (29)
A rigorous analysis of AODV and its variants (2012) (28)
The Science of Quantitative Information Flow (2020) (28)
Prinsys - On a Quest for Probabilistic Loop Invariants (2013) (26)
Hidden-Markov program algebra with iteration (2011) (23)
Results on the quantitative mu-calculus qMu (2003) (23)
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow (2015) (22)
Statistical Model Checking of Wireless Mesh Routing Protocols (2013) (21)
Probabilistic Termination in B (2003) (21)
Using probabilistic Kleene algebra pKA for protocol verification (2008) (20)
An Expectation-Transformer Model for Probabilistic Temporal Logic (1999) (19)
Probabilistic Invariants for Probabilistic Machines (2003) (19)
Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs (2005) (18)
A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism (2012) (17)
CaVi -- Simulation and Model Checking for Wireless Sensor Networks (2008) (16)
An expectation transformer approach to predicate abstraction and data independence for probabilistic programs (2010) (16)
Cost-Based Analysis of Probabilistic Programs Mechanised in HOL (2004) (15)
Cost analysis of games, using program logic (2001) (14)
Probabilistic Concurrent Kleene Algebra (2013) (14)
An elementary proof that Herman's Ring is Theta (N2) (2005) (13)
Sums and Lovers: Case Studies in Security, Compositionality and Refinement (2009) (13)
Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems (2006) (13)
The Laplace Mechanism has optimal utility for differential privacy over continuous queries (2021) (12)
Unifying wp and wlp (1996) (12)
Reasoning about efficiency within a probabilistic µ-calculus (1998) (12)
Modelling and Analysis of AODV in UPPAAL (2015) (11)
Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language (2012) (10)
The Secret Art of Computer Programming (2009) (10)
Abstractions of non-interference security: probabilistic versus possibilistic (2012) (10)
A new rule for almost-certain termination of probabilistic and demonic programs (2016) (10)
Towards an Algebra of Routing Tables (2011) (9)
An axiomatization of information flow measures (2019) (9)
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL (2003) (8)
On Probabilistic Kleene Algebras, Automata and Simulations (2011) (8)
Probabilistic Rely-guarantee Calculus (2014) (8)
Security, Probability and Nearly Fair Coins in the Cryptographers' Café (2009) (8)
Failure Mode Reasoning in Model Based Safety Analysis (2020) (7)
A Generalisation of Stationary Distributions, and Probabilistic Program Algebra (2001) (7)
The Thousand-and-One Cryptographers (2010) (7)
Development via Refinement in Probabilistic B - Foundation and Case Study (2005) (7)
Refinement (2020) (7)
An Event Structure Model for Probabilistic Concurrent Kleene Algebra (2013) (7)
Deriving Probabilistic Semantics Via the 'Weakest Completion' (2004) (7)
Compositional refinement in agent-based security protocols (2011) (7)
Proofs and Refutations for Probabilistic Refinement (2008) (7)
Continual and explicit comparison to promote proactive facilitation during second computer language learning (2011) (6)
Automating Refinement Checking in Probabilistic System Design (2007) (5)
Formal Methods – The Next 30 Years: Third World Congress, FM 2019, Porto, Portugal, October 7–11, 2019, Proceedings (2019) (5)
Quantitative program logic and expected time bounds in probabilistic distributed algorithms (2002) (5)
Formal Analysis of the Information Leakage of the DC-Nets and Crowds Anonymity Protocols (2017) (4)
Processing Text for Privacy: An Information Flow Perspective (2018) (4)
Correctness by construction for probabilistic programs (2020) (4)
Author Obfuscation Using Generalised Differential Privacy (2018) (4)
YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B (2010) (4)
Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL (2001) (4)
Probabilistic imperative programming: a rigorous approach (2007) (3)
Quantitative µ-Calculus Analysis of Power Management in Wireless Networks (2006) (3)
Privacy in elections: How small is "small"? (2017) (3)
A Novel Stochastic Game Via the Quantitative mu-calculus (2006) (3)
Probably Hoare ? Hoare probably ! (2007) (3)
Reasoning About Distributed Secrets (2017) (3)
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms (1999) (3)
Algebra for Quantitative Information Flow (2017) (3)
Weak Concurrent Kleene Algebra with Application to Algebraic Verification (2013) (2)
Proceedings First Workshop on Quantitative Formal Methods : theory and applications (QFM'09, Eindhoven, The Netherlands, November 3, 2009) (2009) (2)
Model exploration and analysis for quantitative safety refinement in probabilistic B (2011) (2)
Explaining epsilon in differential privacy through the lens of information theory (2022) (2)
Universal Optimality and Robust Utility Bounds for Metric Differential Privacy (2022) (2)
Application-oriented program semantics (1997) (2)
Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications: Preface (2009) (2)
Memoryless Strategies for Stochastic Games via Domain Theory (2005) (2)
On Privacy and Accuracy in Data Releases (Invited Paper) (2020) (2)
Towards a Formal Analysis of Information Leakage for Signature Attacks in Preferential Elections (2014) (2)
Differential privacy (2020) (2)
Reasoning with failures (2020) (2)
On Privacy and Accuracy in Data Releases (2020) (1)
Stationarity in Probabilistic Programs (1998) (1)
LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations (2015) (1)
Axiomatics (2018) (1)
Experiments in Information Flow Analysis (2019) (1)
Proving that Programs Are Differentially Private (2019) (1)
Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181) (2015) (1)
An Algebraic Approach for Reasoning About Information Flow (2018) (1)
Schedulers and Finishers: On Generating the Behaviours of an Event Structure (2016) (1)
Program algebra for quantitative information flow (2019) (1)
A formal quantitative study of privacy in the publication of official educational censuses in Brazil (2022) (1)
Finitely generated non-Hopf modules (1990) (1)
Compositional security and collateral leakage (2016) (1)
Programming Research Group Probabilistic Predicate Transformers: Part 2 Probabilistic Predicate Transformers: Part 2 (1996) (0)
Voting systems (2020) (0)
On $$ \mathit {g} $$ -vulnerability (2020) (0)
124 15181 – Challenges and Trends in Probabilistic Programming and (2015) (0)
Introduction to the Special Section on Quantitative Evaluation of Systems (QEST 2018) (2020) (0)
Program Refinement, Perfect Secrecy and Information Flow (2014) (0)
Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation (2006) (0)
Algebraic Frameworks for Probabilistic and Concurrent Systems (2012) (0)
Hopscotch - reaching the target hop by hop (2014) (0)
Categorical Information Flow (2019) (0)
Quantitative information flow in sequential computer programs (2020) (0)
Directional Privacy for Deep Learning (2022) (0)
Iteration and nontermination (2020) (0)
Channels (2020) (0)
Capacity (2018) (0)
The Crowds protocol (2020) (0)
Preface: Special Issue QFM 2009 (2012) (0)
Schedulers and finishers: On generating and filtering the behaviours of an event structure (2018) (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)
Program algebra for QIF (2020) (0)
Formal methods: practical applications and foundations (2022) (0)
Defense against side channels (2020) (0)
How to Develop an Intuition for Risk... and Other Invisible Phenomena (Invited Talk) (2022) (0)
Timing attacks on blinded and bucketed cryptography (2020) (0)
Composition of channels (2020) (0)
Under consideration for publication in Formal Aspects of Computing Model Exploration and Analysis of Quantitative Safety Refinement in Probabilistic Systems (2011) (0)
Introduction (2020) (0)
A question of identity (1994) (0)
P L ] 1 A pr 2 01 5 Conditioning in Probabilistic Programming (2015) (0)
The Dalenius perspective (2020) (0)
Multi-party computation: The Three Judges protocol (2020) (0)
Quantitative methods in security and safety critical applications (NII Shonan Meeting 2012-10) (2012) (0)
Quantitative Evaluation of Systems (2018) (0)
Almost-Certain Eventualities and Abstract Probabilities in Quantitative Temporal Logic (2004) (0)
Prinsys – a Software Tool for the Synthesis of Probabilistic Invariants ⋆ (2012) (0)
Modeling secrets (2020) (0)
Hidden-Markov modeling of QIF in sequential programs (2020) (0)
Formal methods: practical applications and foundations (2021) (0)
Editorial (2021) (0)
Programming Research Group a Probabilistic Temporal Calculus Based on Expectations a Probabilistic Temporal Calculus Based on Expectations (1997) (0)
Programming Research Group Probabilistic Predicate Transformers Probabilistic Predicate Transformers (1995) (0)
The geometry of hypers, gains and losses (2020) (0)

This paper list is powered by the following services:

Other Resources About Annabelle McIver

What Schools Are Affiliated With Annabelle McIver?

Annabelle McIver is affiliated with the following schools:

Annabelle McIver's Academic­Influence.com Rankings

Annabelle McIver's Degrees

Similar Degrees You Can Earn

Why Is Annabelle McIver Influential?

Annabelle McIver's Published Works

Published Works

Other Resources About Annabelle McIver

What Schools Are Affiliated With Annabelle McIver?

Annabelle McIver's AcademicInfluence.com Rankings