Morgan, Carroll

1. A New Proof Rule for Almost-Sure Termination
   2017/11/09 by Annabelle McIver, McIver, Annabelle, Carroll Morgan +5 · 9 citations
   Computer Science · #Bayesian Modeling and Causal Inference #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Programming Languages (cs.PL)
2. The Laplace Mechanism has optimal utility for differential privacy over continuous queries
   2021/05/15 by Fernandes, Natasha, McIver, Annabelle, Morgan, Carroll · 2 citations
   #Cryptography and Security (cs.CR) #FOS: Computer and information sciences
3. Compositional closure for Bayes Risk in probabilistic noninterference
   2010/07/07 by Annabelle McIver, Larissa Meinicke, McIver, Annabelle +3 · 1 citation
   Computer Science · #Security and Verification in Computing #Advanced Malware Detection Techniques #Information and Cyber Security
4. A new rule for almost-certain termination of probabilistic- and demonic\n programs
   2016/12/04 by Annabelle McIver, Carroll Morgan, McIver, Annabelle +1 · 2 citations
   Computer Science · #Logic, Reasoning, and Knowledge #Bayesian Modeling and Causal Inference #Logic, programming, and type systems