Precise quantitative information flow analysis -- a symbolic approach
From MaRDI portal
Publication:2453114
DOI10.1016/j.tcs.2014.04.022zbMath1359.68195OpenAlexW2126908237MaRDI QIDQ2453114
Publication date: 6 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.022
securityquantitative analysisinformation flowpolyhedral modelprogram specificationssymbolic model counting
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Upper bound computation of information leakages for unbounded recursion ⋮ An automated quantitative information flow analysis for concurrent programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compositional noninterference from first principles
- Counting integer points in parametric polytopes using Barvinok's rational functions
- First-order dynamic logic
- Loop summarization using state and transition invariants
- The Euler-Maclaurin and Taylor Formulas: Twin, Elementary Derivations
- Quantitative Information Flow, Relations and Polymorphic Types
- Parametric integer programming
- Statistical Measurement of Information Leakage
- Handbook of Signal Processing Systems
- Predicate Abstraction in a Program Logic Calculus
- On the Foundations of Quantitative Information Flow
- Tableaux for Projection Computation and Knowledge Compilation
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- Static Analysis
This page was built for publication: Precise quantitative information flow analysis -- a symbolic approach