Travelled to:
1 × Croatia
1 × France
1 × Germany
1 × Japan
1 × Poland
1 × Portugal
1 × Singapore
1 × The Netherlands
Collaborated with:
A.McIver L.Meinicke Y.Deng R.J.v.Glabbeek J.Woodcock M.Hennessy C.Zhang T.M.Rabehaja R.Wen J.Hurd B.L.Kaminski J.Katoen
Talks about:
probabilist (5) inform (3) test (3) quantit (2) process (2) probabl (2) monad (2) powerdomain (1) noninterfer (1) nondetermin (1)
Person: Carroll Morgan
DBLP: Morgan:Carroll
Contributed to:
Wrote 12 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.
- LICS-2012-McIverMM #information management #nondeterminism #probability
- A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and Nondeterminism (AM, LM, CM), pp. 461–470.
- QAPL-2011-DengGHM #probability #process #testing
- Real-Reward Testing for Probabilistic Processes (YD, RJvG, MH, CM), pp. 61–73.
- ICALP-v2-2010-McIverMM #composition #probability
- Compositional Closure for Bayes Risk in Probabilistic Noninterference (AM, LM, CM), pp. 223–235.
- FM-2009-McIverMM #probability #security
- Security, Probability and Nearly Fair Coins in the Cryptographers’ Café (AM, LM, CM), pp. 41–71.
- ESOP-2007-DengGMZ #probability #testing
- Scalar Outcomes Suffice for Finitary Probabilistic Testing (YD, RJvG, CM, CZ), pp. 363–378.
- LICS-2007-DengGHMZ #finite #probability #process #testing
- Characterising Testing Preorders for Finite Probabilistic Processes (YD, RJvG, MH, CM, CZ), pp. 313–325.
- 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.
- VDME-1990-WoodcockM #concurrent #refinement
- Refinement of State-Based Concurrent Systems (JW, CM), pp. 340–351.
- POPL-2018-McIverMKK #proving #termination
- A new proof rule for almost-sure termination (AM, CM, BLK, JPK), p. 28.