A. K. McIver
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i4 |      | Annabelle McIver, Tahiry M. Rabehaja, Georg Struth: Weak Concurrent Kleene Algebra with Application to Algebraic Verification. CoRR abs/1301.7153 (2013) |
| 2012 | ||
| j23 | | Suzana Andover, Annabelle McIver, Manuel Núñez: Preface: Special Issue QFM 2009. J. Log. Algebr. Program. 81(1): 1 (2012) |
| c34 | | Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan: A Process Algebra for Wireless Mesh Networks. ESOP 2012: 295-315 |
| c33 | | Annabelle McIver, Larissa Meinicke, Carroll Morgan: A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism. LICS 2012: 461-470 |
| c32 | | Peter Höfner, Rob J. van Glabbeek, Wee Lum Tan, Marius Portmann, Annabelle McIver, Ansgar Fehnker: A rigorous analysis of AODV and its variants. MSWiM 2012: 203-212 |
| c31 | | Friedrich Gretz, Joost-Pieter Katoen, Annabelle McIver: Operational Versus Weakest Precondition Semantics for the Probabilistic Guarded Command Language. QEST 2012: 168-177 |
| c30 | | Ansgar Fehnker, Rob J. van Glabbeek, Peter Höfner, Annabelle McIver, Marius Portmann, Wee Lum Tan: Automated Analysis of AODV Using UPPAAL. TACAS 2012: 173-187 |
| 2011 | ||
| j22 | | A. K. McIver, Carroll C. Morgan: Compositional refinement in agent-based security protocols. Formal Asp. Comput. 23(6): 711-737 (2011) |
| c29 | | |
| c28 | | Annabelle McIver, Tahiry M. Rabehaja, Georg Struth: On Probabilistic Kleene Algebras, Automata and Simulations. RAMICS 2011: 264-279 |
| c27 | | Matt Bower, Annabelle McIver: Continual and explicit comparison to promote proactive facilitation during second computer language learning. ITiCSE 2011: 218-222 |
| c26 | | Ukachukwu Ndukwu, Annabelle McIver: Model exploration and analysis for quantitative safety refinement in probabilistic B. Refine 2011: 101-120 |
| e2 | | Peter Höfner, Annabelle McIver, Georg Struth (Eds.): Proceedings of the First Workshop on Automated Theory Engineering, Wrocław, Poland, July 31, 2011. CEUR Workshop Proceedings 760, CEUR-WS.org 2011 |
| i3 | | Annabelle McIver, Larissa Meinicke, Carroll Morgan: Hidden-Markov Program Algebra with iteration. CoRR abs/1102.0333 (2011) |
| 2010 | ||
| c25 | | Ukachukwu Ndukwu, A. K. McIver: YAGA: Automated Analysis of Quantitative Safety Specifications in Probabilistic B. ATVA 2010: 378-386 |
| c24 | | Annabelle McIver, Larissa Meinicke, Carroll Morgan: Compositional Closure for Bayes Risk in Probabilistic Noninterference. ICALP (2) 2010: 223-235 |
| c23 | | Joost-Pieter Katoen, Annabelle McIver, Larissa Meinicke, Carroll C. Morgan: Linear-Invariant Generation for Probabilistic Programs: - Automated Support for Proof-Based Methods. SAS 2010: 390-406 |
| c22 | | Ukachukwu Ndukwu, Annabelle McIver: An expectation transformer approach to predicate abstraction and data independence for probabilistic programs. QAPL 2010: 129-143 |
| i2 | | Annabelle McIver, Larissa Meinicke, Carroll Morgan: Compositional closure for Bayes Risk in probabilistic noninterference. CoRR abs/1007.1054 (2010) |
| 2009 | ||
| c21 | | Annabelle McIver, Larissa Meinicke, Carroll Morgan: Security, Probability and Nearly Fair Coins in the Cryptographers' Café. FM 2009: 41-71 |
| c20 | | Annabelle McIver, Carroll C. Morgan: Sums and Lovers: Case Studies in Security, Compositionality and Refinement. FM 2009: 289-304 |
| c19 | | |
| p1 | | Ansgar Fehnker, Matthias Fruth, Annabelle McIver: Graphical Modelling for Simulation and Formal Analysis of Wireless Network Protocols. Methods, Models and Tools for Fault Tolerance 2009: 1-24 |
| e1 | | Suzana Andova, Annabelle McIver, Pedro R. D'Argenio, Pieter J. L. Cuijpers, Jasen Markovski, Carroll Morgan, Manuel Núñez (Eds.): Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications. EPTCS 13, 2009 |
| 2008 | ||
| j21 | | A. K. McIver, C. Gonzalia, E. Cohen, Carroll C. Morgan: Using probabilistic Kleene algebra pKA for protocol verification. J. Log. Algebr. Program. 76(1): 90-111 (2008) |
| c18 | | A. K. McIver, Carroll C. Morgan, C. Gonzalia: Proofs and Refutations for Probabilistic Refinement. FM 2008: 100-115 |
| c17 | | Athanassios Boulis, Ansgar Fehnker, Matthias Fruth, Annabelle McIver: CaVi -- Simulation and Model Checking for Wireless Sensor Networks. QEST 2008: 37-38 |
| 2007 | ||
| j20 | | Annabelle McIver, Carroll Morgan: Results on the quantitative µ-calculus qMµ. ACM Trans. Comput. Log. 8(1) (2007) |
| c16 | | Carlos Gonzalia, Annabelle McIver: Automating Refinement Checking in Probabilistic System Design. ICFEM 2007: 212-231 |
| 2006 | ||
| j19 | | Annabelle McIver, Carroll Morgan: A Novel Stochastic Game Via the Quantitative mu-calculus. Electr. Notes Theor. Comput. Sci. 153(2): 195-212 (2006) |
| c15 | | Annabelle McIver, E. Cohen, Carroll Morgan: Using Probabilistic Kleene Algebra for Protocol Verification. RelMiCS 2006: 296-310 |
| c14 | | Annabelle McIver: Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems. FM 2006: 131-146 |
| c13 | | Annabelle McIver: Quantitative µ-Calculus Analysis of Power Management in Wireless Networks. ICTAC 2006: 50-64 |
| c12 | | A. K. McIver, Ansgar Fehnker: Formal Techniques for the Analysis of Wireless Networks. ISoLA 2006: 263-270 |
| c11 | | Carroll Morgan, Annabelle McIver: Programming-Logic Analysis of Fault Tolerance: Expected Performance of Self-stabilisation. RODIN Book 2006: 288-305 |
| 2005 | ||
| j18 | | Joe Hurd, Annabelle McIver, Carroll Morgan: Probabilistic Guarded Commands Mechanized in HOL. Electr. Notes Theor. Comput. Sci. 112: 95-111 (2005) |
| j17 | | Carroll Morgan, Annabelle McIver: Memoryless Strategies for Stochastic Games via Domain Theory. Electr. Notes Theor. Comput. Sci. 130: 23-37 (2005) |
| j16 | | Annabelle McIver, Carroll Morgan: An elementary proof that Herman's Ring is Theta (N2). Inf. Process. Lett. 94(2): 79-84 (2005) |
| j15 | | Annabelle McIver, Carroll Morgan: Abstraction and refinement in probabilistic systems. SIGMETRICS Performance Evaluation Review 32(4): 41-47 (2005) |
| j14 | | Joe Hurd, Annabelle McIver, Carroll Morgan: Probabilistic guarded commands mechanized in HOL. Theor. Comput. Sci. 346(1): 96-112 (2005) |
| c10 | | Orieta Celiku, Annabelle McIver: Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs. FM 2005: 107-122 |
| c9 | | Annabelle McIver, Tjark Weber: Towards Automated Proof Support for Probabilistic Distributed Systems. LPAR 2005: 534-548 |
| c8 | | Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan: Development via Refinement in Probabilistic B - Foundation and Case Study. ZB 2005: 355-373 |
| 2004 | ||
| j13 |  | Orieta Celiku, Annabelle McIver: Cost-Based Analysis of Probabilistic Programs Mechanised in HOL. Nord. J. Comput. 11(2): 102-128 (2004) |
| c7 | | Jifeng He, Carroll Morgan, Annabelle McIver: Deriving Probabilistic Semantics Via the 'Weakest Completion'. ICFEM 2004: 131-145 |
| c6 | | Annabelle McIver, Carroll Morgan: Developing and Reasoning About Probabilistic Programs in pGCL. PSSE 2004: 123-155 |
| 2003 | ||
| j12 | | Annabelle McIver, Carroll Morgan: Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL. Theor. Comput. Sci. 293(3): 507-534 (2003) |
| c5 | | |
| c4 | | Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan: Probabilistic Invariants for Probabilistic Machines. ZB 2003: 240-259 |
| i1 | | Annabelle McIver, Carroll Morgan: Results on the quantitative mu-calculus qMu. CoRR cs.LO/0309024 (2003) |
| 2002 | ||
| j11 | | Annabelle McIver: Quantitative program logic and expected time bounds in probabilistic distributed algorithms. Theor. Comput. Sci. 282(1): 191-219 (2002) |
| c3 | | Annabelle McIver, Carroll Morgan: Games, Probability and the Quantitative µ-Calculus qMµ. LPAR 2002: 292-310 |
| 2001 | ||
| j10 | | Annabelle McIver, Carroll Morgan: Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Inf. 37(4/5): 329-354 (2001) |
| j9 | | Annabelle McIver: A Generalisation of Stationary Distributions, and Probabilistic Program Algebra. Electr. Notes Theor. Comput. Sci. 45: 269-279 (2001) |
| j8 | | Annabelle McIver, Carroll Morgan: Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL. Electr. Notes Theor. Comput. Sci. 42: 12-40 (2001) |
| j7 | | Annabelle McIver, Carroll Morgan: Partial correctness for probabilistic demonic programs. Theor. Comput. Sci. 266(1-2): 513-541 (2001) |
| c2 | | |
| 1999 | ||
| j6 | | Annabelle McIver: Reasoning about efficiency within a probabilistic µ-calculus. Electr. Notes Theor. Comput. Sci. 22: 138-155 (1999) |
| j5 | | Carroll Morgan, Annabelle McIver: An Expectation-Transformer Model for Probabilistic Temporal Logic. Logic Journal of the IGPL 7(6): 779-804 (1999) |
| c1 | | Annabelle McIver: Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms. ARTS 1999: 19-33 |
| 1997 | ||
| j4 | | Jifeng He, Karen Seidel, Annabelle McIver: Probabilistic Models for the Guarded Command Language. Sci. Comput. Program. 28(2-3): 171-192 (1997) |
| 1996 | ||
| j3 | | Carroll Morgan, Annabelle McIver, Karen Seidel, Jeff W. Sanders: Refinement-Oriented Probability for CSP. Formal Asp. Comput. 8(6): 617-647 (1996) |
| j2 | | |
| j1 | | Carroll Morgan, Annabelle McIver, Karen Seidel: Probabilistic Predicate Transformers. ACM Trans. Program. Lang. Syst. 18(3): 325-353 (1996) |
Data released under the ODC-BY 1.0 license — See also our legal information page