Precise quantitative information flow analysis— a symbolic approach
Author:
- Vladimir KlebanovVKVladimir Klebanov
- 1 June 2014
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 538, 124-139
Abstract
No abstract availableFunding Information
- German National Science Foundation
This publication has 10 references indexed in Scilit:
- Loop summarization using state and transition invariantsFormal Methods in System Design, 2012
- Compositional noninterference from first principlesFormal Aspects of Computing, 2012
- Quantifying information flow with beliefsJournal of Computer Security, 2009
- A static analysis for quantifying information flow in a simple imperative languageJournal of Computer Security, 2007
- Counting Integer Points in Parametric Polytopes Using Barvinok's Rational FunctionsAlgorithmica, 2007
- Local Euler–Maclaurin Formula for PolytopesMoscow Mathematical Journal, 2007
- Quantitative Information Flow, Relations and Polymorphic TypesJournal of Logic and Computation, 2005
- Language-based information-flow securityIEEE Journal on Selected Areas in Communications, 2003
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is FixedMathematics of Operations Research, 1994
- Parametric integer programmingRAIRO - Operations Research, 1988