Select Publications
Books
2020, The Science of Quantitative Information Flow, Springer International Publishing, http://dx.doi.org/10.1007/978-3-319-96131-6
,2009, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
,2005, Abstraction, refinement and proof for probabilistic systems, Springer Verlag, New York, http://portal.acm.org/citation.cfm?id=1036296
,, 2003, Programming Methodology, Morgan CC; McIver A, (ed.), Springer Publishing Company, New York, http://www.springer.com/computer/swe/book/978-0-387-95349-6
Book Chapters
2021, 'Algorithmics', in Advancing Research in Information and Communication Technology, pp. 59 - 98, http://dx.doi.org/10.1007/978-3-030-81701-5_3
,2020, 'A demonic lattice of information', in Information Security and Cryptography, pp. 325 - 350, http://dx.doi.org/10.1007/978-3-319-96131-6_17
,2020, 'Axiomatics', in Information Security and Cryptography, pp. 183 - 204, http://dx.doi.org/10.1007/978-3-319-96131-6_11
,2020, 'Capacity', in Information Security and Cryptography, pp. 107 - 130, http://dx.doi.org/10.1007/978-3-319-96131-6_7
,2020, 'Channels', in Information Security and Cryptography, pp. 49 - 70, http://dx.doi.org/10.1007/978-3-319-96131-6_4
,2020, 'Composition of channels', in Information Security and Cryptography, pp. 131 - 145, http://dx.doi.org/10.1007/978-3-319-96131-6_8
,2020, 'Defense against side channels', in Information Security and Cryptography, pp. 389 - 397, http://dx.doi.org/10.1007/978-3-319-96131-6_20
,2020, 'Differential privacy', in Information Security and Cryptography, pp. 433 - 444, http://dx.doi.org/10.1007/978-3-319-96131-6_23
,2020, 'Hidden-Markov modeling of QIF in sequential programs', in Information Security and Cryptography, pp. 255 - 282, http://dx.doi.org/10.1007/978-3-319-96131-6_14
,2020, 'Introduction', in , pp. 3 - 13, http://dx.doi.org/10.1007/978-3-319-96131-6_1
,2020, 'Iteration and nontermination', in Information Security and Cryptography, pp. 307 - 323, http://dx.doi.org/10.1007/978-3-319-96131-6_16
,2020, 'Modeling secrets', in Information Security and Cryptography, pp. 17 - 23, http://dx.doi.org/10.1007/978-3-319-96131-6_2
,2020, 'Multi-party computation: The Three Judges protocol', in Information Security and Cryptography, pp. 399 - 411, http://dx.doi.org/10.1007/978-3-319-96131-6_21
,2020, 'On $$ \mathit {g} $$ -vulnerability', in Information Security and Cryptography, pp. 25 - 46, http://dx.doi.org/10.1007/978-3-319-96131-6_3
,2020, 'Posterior vulnerability and leakage', in Information Security and Cryptography, pp. 71 - 100, http://dx.doi.org/10.1007/978-3-319-96131-6_5
,2020, 'Program algebra for QIF', in Information Security and Cryptography, pp. 283 - 305, http://dx.doi.org/10.1007/978-3-319-96131-6_15
,2020, 'Quantitative information flow in sequential computer programs', in Information Security and Cryptography, pp. 225 - 253, http://dx.doi.org/10.1007/978-3-319-96131-6_13
,2020, 'Quantitative Information Flow with Monads in Haskell', in Foundations of Probabilistic Programming, pp. 391 - 448, http://dx.doi.org/10.1017/9781108770750.013
,2020, 'Refinement', in Information Security and Cryptography, pp. 147 - 170, http://dx.doi.org/10.1007/978-3-319-96131-6_9
,2020, 'Robustness', in Information Security and Cryptography, pp. 101 - 105, http://dx.doi.org/10.1007/978-3-319-96131-6_6
,2020, 'The Crowds protocol', in Information Security and Cryptography, pp. 353 - 367, http://dx.doi.org/10.1007/978-3-319-96131-6_18
,2020, 'The Dalenius perspective', in Information Security and Cryptography, pp. 171 - 181, http://dx.doi.org/10.1007/978-3-319-96131-6_10
,2020, 'The geometry of hypers, gains and losses', in Information Security and Cryptography, pp. 205 - 221, http://dx.doi.org/10.1007/978-3-319-96131-6_12
,2020, 'Timing attacks on blinded and bucketed cryptography', in Information Security and Cryptography, pp. 369 - 388, http://dx.doi.org/10.1007/978-3-319-96131-6_19
,2020, 'Voting systems', in Information Security and Cryptography, pp. 413 - 431, http://dx.doi.org/10.1007/978-3-319-96131-6_22
,2019, 'Categorical Information Flow', in The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy, pp. 329 - 343, http://dx.doi.org/10.1007/978-3-030-31175-9_19
,2017, 'A demonic lattice of information', in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, Cham, pp. 203 - 222, http://dx.doi.org/10.1007/978-3-319-51046-0_11
,2010, 'The thousand-and-one cryptographers', in Wood K; Roscoe AW; Jones CB (ed.), Reflections on the work of C.A.R. Hoare, Springer, New York, pp. 255 - 282
,2006, 'Developing and Reasoning about probabilistic programs in pGCL', in Cavalcanti ; Sampaio ; Woodcock (ed.), Refinement Techniques in Software Engineering, Springer Publishing Company, Germany, pp. 123 - 155
,2006, 'Programming-Logic Analysis of Fault Tolerance', in Butler ; Jones ; Romanovsky ; Troubitsyna (ed.), Rigorous Development of Complex Fault-Tolerant Systems, Springer Publishing Company, Germany, pp. 288 - 305
,2005, 'Development via Refinement in Probabilistic B — Foundation and Case Study', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 355 - 373, http://dx.doi.org/10.1007/11415787_21
,2005, 'Of probabilistic wp and CSP - and compositionality', in Abdallah ; Jones ; Roscoe ; Sanders (ed.), Proceedings of the First International Conference on Advances in Natural Computation (ICNC 2005), Part III, Lecture Notes in Computer Science 3612/2005, Springer, Berlin, Germany, pp. 220 - 241
,2003, 'A probabilistic approach to information hiding', in Morgan C; McIver A (ed.), Programming Methodology, Springer Publishing Company, New York, pp. 441 - 460, http://portal.acm.org/citation.cfm?id=766972
,1993, 'The refinement calculus, and literate development', in Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 161 - 182, http://dx.doi.org/10.1007/3-540-57499-9_20
,1992, 'Laws of Programming', in Programming and Mathematical Method, Springer Berlin Heidelberg, pp. 95 - 122, http://dx.doi.org/10.1007/978-3-642-77572-7_7
,1990, 'Of wp and CSP', in Beauty Is Our Business, Springer New York, pp. 319 - 326, http://dx.doi.org/10.1007/978-1-4612-4476-9_37
,Journal articles
2024, 'On Formal Methods Thinking in Computer Science Education', Formal Aspects of Computing, http://dx.doi.org/10.1145/3670419
,2022, 'Flexible and scalable privacy assessment for very large datasets, with an application to official governmental microdata', Proceedings on Privacy Enhancing Technologies, 2022, pp. 378 - 399, http://dx.doi.org/10.56553/popets-2022-0114
,2021, 'The Laplace Mechanism has optimal utility for differential privacy over continuous queries', Proceedings - Symposium on Logic in Computer Science, 2021-June, http://dx.doi.org/10.1109/LICS52264.2021.9470718
,2020, 'Preface', Acta Informatica, 57, pp. 305 - 311, http://dx.doi.org/10.1007/s00236-020-00382-7
,2019, 'Program algebra for quantitative information flow', Journal of Logical and Algebraic Methods in Programming, 106, pp. 55 - 77, http://dx.doi.org/10.1016/j.jlamp.2019.04.002
,2019, 'An axiomatization of information flow measures', Theoretical Computer Science, 777, pp. 32 - 54, http://dx.doi.org/10.1016/j.tcs.2018.10.016
,2019, 'Abstract hidden markov models: A monadic account of quantitative information flow', Logical Methods in Computer Science, 15, pp. 36:1-36:50, http://dx.doi.org/10.23638/LMCS-15(1:36)2019
,2018, 'A new proof rule for almost-sure termination', Proceedings of the ACM on Programming Languages, 2, http://dx.doi.org/10.1145/3158121
,2017, 'Privacy in elections: How small is “small”?', Journal of Information Security and Applications, 36, pp. 112 - 126, http://dx.doi.org/10.1016/j.jisa.2017.08.003
,2014, 'Selected papers from the Brazilian Symposium on Formal Methods (SBMF 2011)', Science of Computer Programming, 92, pp. 85, http://dx.doi.org/10.1016/j.scico.2014.02.004
,