Annabelle McIver

According to our database1, Annabelle McIver
  • authored at least 102 papers between 1996 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Conditioning in Probabilistic Programming.
ACM Trans. Program. Lang. Syst., 2018

A new proof rule for almost-sure termination.
PACMPL, 2018

An Algebraic Approach for Reasoning About Information Flow.
CoRR, 2018

2017
Privacy in elections: How small is "small"?
J. Inf. Sec. Appl., 2017

A New Proof Rule for Almost-Sure Termination.
CoRR, 2017

Abstract Hidden Markov Models: a monadic account of quantitative information flow.
CoRR, 2017

Formal Analysis of the Information Leakage of the DC-Nets and Crowds Anonymity Protocols.
Proceedings of the Formal Methods: Foundations and Applications - 20th Brazilian Symposium, 2017

Reasoning About Distributed Secrets.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017

Algebra for Quantitative Information Flow.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2017

2016
Probabilistic rely-guarantee calculus.
Theor. Comput. Sci., 2016

A new rule for almost-certain termination of probabilistic and demonic programs.
CoRR, 2016

Compositional security and collateral leakage.
CoRR, 2016

Schedulers and Finishers: On Generating the Behaviours of an Event Structure.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2016, 2016

Axioms for Information Leakage.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
Hidden-Markov program algebra with iteration.
Mathematical Structures in Computer Science, 2015

Conditioning in Probabilistic Programming.
Electr. Notes Theor. Comput. Sci., 2015

Challenges and Trends in Probabilistic Programming (Dagstuhl Seminar 15181).
Dagstuhl Reports, 2015

A Rigorous Analysis of AODV and its Variants.
CoRR, 2015

Conditioning in Probabilistic Programming.
CoRR, 2015

Automated Analysis of AODV using UPPAAL.
CoRR, 2015

A Process Algebra for Wireless Mesh Networks.
CoRR, 2015

Modelling and Analysis of AODV in UPPAAL.
CoRR, 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
Operational versus weakest pre-expectation semantics for the probabilistic guarded command language.
Perform. Eval., 2014

Hopscotch - reaching the target hop by hop.
J. Log. Algebr. Meth. Program., 2014

Abstractions of non-interference security: probabilistic versus possibilistic.
Formal Asp. Comput., 2014

Probabilistic Rely-guarantee Calculus.
CoRR, 2014

Program Refinement, Perfect Secrecy and Information Flow.
Proceedings of the Engineering Trustworthy Software Systems - First International School, 2014

Abstract Channels and Their Robust Information-Leakage 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
Weak Concurrent Kleene Algebra with Application to Algebraic Verification
CoRR, 2013

An Event Structure Model for Probabilistic Concurrent Kleene Algebra.
CoRR, 2013

Probabilistic Concurrent Kleene Algebra.
Proceedings of the Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, 2013

A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV.
CoRR, 2013

Prinsys - On a Quest for Probabilistic Loop Invariants.
Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Statistical Model Checking of Wireless Mesh Routing Protocols.
Proceedings of the NASA Formal Methods, 2013

An Event Structure Model for Probabilistic Concurrent Kleene Algebra.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

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

Preface: Special Issue QFM 2009.
J. Log. Algebr. Program., 2012

Automated Analysis of AODV Using UPPAAL.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language.
Proceedings of the Ninth International Conference on Quantitative Evaluation of Systems, 2012

A rigorous analysis of AODV and its variants.
Proceedings of the 15th ACM International Conference on Modeling, 2012

A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

A Process Algebra for Wireless Mesh Networks.
Proceedings of the Programming Languages and Systems, 2012

2011
Compositional refinement in agent-based security protocols.
Formal Asp. Comput., 2011

Model exploration and analysis for quantitative safety refinement in probabilistic B
Proceedings of the Proceedings 15th International Refinement Workshop, 2011

Hidden-Markov Program Algebra with iteration
CoRR, 2011

Continual and explicit comparison to promote proactive facilitation during second computer language learning.
Proceedings of the 16th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2011

On Probabilistic Kleene Algebras, Automata and Simulations.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

Towards an Algebra of Routing Tables.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

2010
Compositional closure for Bayes Risk in probabilistic noninterference
CoRR, 2010

An expectation transformer approach to predicate abstraction and data independence for probabilistic programs
Proceedings of the Proceedings Eighth Workshop on Quantitative Aspects of Programming Languages, 2010

Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based 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

YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B.
Proceedings of the Automated Technology for Verification and Analysis, 2010

The Thousand-and-One Cryptographers.
Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009
Graphical Modelling for Simulation and Formal Analysis of Wireless Network Protocols.
Proceedings of the Methods, 2009

The Secret Art of Computer Programming.
Proceedings of the Theoretical Aspects of Computing, 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

2008
Using probabilistic Kleene algebra pKA for protocol verification.
J. Log. Algebr. Program., 2008

CaVi -- Simulation and Model Checking for Wireless Sensor Networks.
Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 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

Automating Refinement Checking in Probabilistic System Design.
Proceedings of the Formal Methods and Software Engineering, 2007

2006
A Novel Stochastic Game Via the Quantitative mu-calculus.
Electr. Notes Theor. Comput. Sci., 2006

Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation.
Proceedings of the Rigorous Development of Complex Fault-Tolerant Systems [FP6 IST-511599 RODIN project], 2006

Formal Techniques for the Analysis of Wireless Networks.
Proceedings of the Leveraging Applications of Formal Methods, 2006

Quantitative µ-Calculus Analysis of Power Management in Wireless Networks.
Proceedings of the Theoretical Aspects of Computing, 2006

Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems.
Proceedings of the FM 2006: Formal Methods, 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: 978-0-387-27006-7, 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 (N2).
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

Development via Refinement in Probabilistic B - Foundation and Case Study.
Proceedings of the ZB 2005: Formal Specification and Development in Z and B, 2005

Towards Automated Proof Support for Probabilistic Distributed Systems.
Proceedings of the Logic for Programming, 2005

Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs.
Proceedings of the FM 2005: Formal Methods, 2005

2004
Cost-Based Analysis of Probabilistic Programs Mechanised in HOL.
Nord. J. Comput., 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

2003
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL.
Theor. Comput. Sci., 2003

Results on the quantitative mu-calculus 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
Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
Theor. Comput. Sci., 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

Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL.
Electr. Notes Theor. Comput. Sci., 2001

A Generalisation of Stationary Distributions, and Probabilistic Program Algebra.
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 Asia-Pacific Software Engineering Conference (APSEC 2001), 2001

1999
An Expectation-Transformer Model for Probabilistic Temporal Logic.
Logic Journal of the IGPL, 1999

Reasoning about efficiency within a probabilistic µ-calculus.
Electr. Notes Theor. Comput. Sci., 1999

Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms.
Proceedings of the Formal Methods for Real-Time and Probabilistic Systems, 1999

1997
Probabilistic Models for the Guarded Command Language.
Sci. Comput. Program., 1997

1996
Probabilistic Predicate Transformers.
ACM Trans. Program. Lang. Syst., 1996

Unifying wp and wlp.
Inf. Process. Lett., 1996

Refinement-Oriented Probability for CSP.
Formal Asp. Comput., 1996


  Loading...