Scalable Approximation of Quantitative Information Flow in Programs
From MaRDI portal
Publication:3296323
DOI10.1007/978-3-319-73721-8_4zbMath1446.68027OpenAlexW2780206242MaRDI QIDQ3296323
Michael A. Enescu, Kuldeep S. Meel, Annelie Heuser, Jean Quilbeuf, Axel Legay, Fabrizio Biondi
Publication date: 7 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01629131/file/main.pdf
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Upper bound computation of information leakages for unbounded recursion ⋮ OuterCount: a first-level solution-counter for quantified Boolean formulas ⋮ Projected model counting: beyond independent support ⋮ Not all FPRASs are equal: demystifying FPRASs for DNF-counting
This page was built for publication: Scalable Approximation of Quantitative Information Flow in Programs
