Travelled to:
1 × Canada
1 × Croatia
1 × Cyprus
1 × Germany
1 × Italy
1 × Japan
1 × Singapore
1 × The Netherlands
1 × United Kingdom
2 × Estonia
2 × France
Collaborated with:
C.Morgan L.Meinicke C.C.Morgan T.M.Rabehaja M.Bower U.Ndukwu J.Katoen ∅ O.Celiku R.Wen G.Struth A.Fehnker R.J.v.Glabbeek P.Höfner M.Portmann W.L.Tan J.Hurd B.L.Kaminski
Talks about:
probabilist (7) analysi (4) composit (3) quantit (3) program (3) inform (3) abstract (2) probabl (2) algebra (2) secur (2)
Person: Annabelle McIver
DBLP: McIver:Annabelle
Contributed to:
Wrote 17 papers:
- LICS-2015-McIverMR #data flow #markov #modelling #monad
- Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow (AM, CM, TMR), pp. 597–608.
- FM-2014-WenMM #analysis #formal method #information management #towards
- Towards a Formal Analysis of Information Leakage for Signature Attacks in Preferential Elections (RW, AM, CM), pp. 595–610.
- QAPL-2013-McIverRS #algebra #concurrent #probability
- Probabilistic Concurrent Kleene Algebra (AM, TMR, GS), pp. 97–115.
- ESOP-2012-FehnkerGHMPT #algebra #network #process
- A Process Algebra for Wireless Mesh Networks (AF, RJvG, PH, AM, MP, WLT), pp. 295–315.
- LICS-2012-McIverMM #information management #nondeterminism #probability
- A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism (AM, LM, CM), pp. 461–470.
- TACAS-2012-FehnkerGHMPT #analysis #automation #using
- Automated Analysis of AODV Using UPPAAL (AF, RJvG, PH, AM, MP, WLT), pp. 173–187.
- ITiCSE-2011-BowerM #comparison #learning
- Continual and explicit comparison to promote proactive facilitation during second computer language learning (MB, AM), pp. 218–222.
- ICALP-v2-2010-McIverMM #composition #probability
- Compositional Closure for Bayes Risk in Probabilistic Noninterference (AM, LM, CM), pp. 223–235.
- QAPL-2010-NdukwuMc #abstraction #approach #independence #probability #source code
- An expectation transformer approach to predicate abstraction and data independence for probabilistic programs (UN, AM), pp. 129–143.
- SAS-2010-KatoenMMM #automation #generative #invariant #probability #source code
- Linear-Invariant Generation for Probabilistic Programs: — Automated Support for Proof-Based Methods (JPK, AM, LM, CCM), pp. 390–406.
- FM-2009-McIverM #case study #composition #refinement #security
- Sums and Lovers: Case Studies in Security, Compositionality and Refinement (AM, CCM), pp. 289–304.
- FM-2009-McIverMM #probability #security
- Security, Probability and Nearly Fair Coins in the Cryptographers’ Café (AM, LM, CM), pp. 41–71.
- FM-2006-McIver #analysis #model checking #probability #refinement
- Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems (AM), pp. 131–146.
- FM-2005-CelikuM #composition #cost analysis #probability #source code #specification
- Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs (OC, AM), pp. 107–122.
- QAPL-2005-McIverM06 #calculus #game studies #novel #probability #μ-calculus
- A Novel Stochastic Game Via the Quantitative μ-calculus (AM, CM), pp. 195–212.
- QAPL-2004-HurdMM05 #probability
- Probabilistic Guarded Commands Mechanized in HOL (JH, AM, CM), pp. 95–111.
- POPL-2018-McIverMKK #proving #termination
- A new proof rule for almost-sure termination (AM, CM, BLK, JPK), p. 28.