Scalable approximation of quantitative information flow in programs

DOI10.1007/978-3-319-73721-8_4MaRDI QIDQ3296323zbMATH OpenOpenAlexFDO

Authors Fabrizio Biondi, Michael A. Enescu, Annelie Heuser, Axel Legay, Kuldeep S. Meel, Jean Quilbeuf

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Precise quantitative information flow analysis -- a symbolic approach
• What's the over/under? Probabilistic bounds on information leakage
• Computing Information Flow Using Symbolic Model-Checking
• Automation of quantitative information-flow analysis
• The complexity of quantitative information flow in recursive programs

Cited in

(8)

• Not all FPRASs are equal: demystifying FPRASs for DNF-counting
• Counting QBF solutions at level two
• On approximability of propositional model counting
• Refinement-based enumeration of QBF solutions
• Upper bound computation of information leakages for unbounded recursion
• OuterCount: a first-level solution-counter for quantified Boolean formulas
• Information Exchange Between Over- and Underapproximating Software Analyses
• Projected model counting: beyond independent support

This page was built for publication: Scalable approximation of quantitative information flow in programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296323)