SAT-Based Analysis and Quantification of Information Flow in Programs
- 1 January 2013
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Effective preprocessing in #SATPublished by SPIE-Intl Soc Optical Eng ,2011
- Non-uniform distributions in quantitative information-flowPublished by Association for Computing Machinery (ACM) ,2011
- Existential Quantification as Incremental SATLecture Notes in Computer Science, 2011
- Approximate Quantifier Elimination for Propositional Boolean FormulaeLecture Notes in Computer Science, 2011
- Statistical Measurement of Information LeakageLecture Notes in Computer Science, 2010
- Automatic Discovery and Quantification of Information LeaksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Modular verification of code with SATPublished by Association for Computing Machinery (ACM) ,2006
- A Tool for Checking ANSI-C ProgramsLecture Notes in Computer Science, 2004
- An Extensible SAT-solverLecture Notes in Computer Science, 2004
- Decomposable negation normal formJournal of the ACM, 2001