Existential Quantification as Incremental SAT

Brauer, Jörg; King, Andy; Kriener, Jael

doi:10.1007/978-3-642-22110-1_17

Cited by 26 publications

(47 citation statements)

References 35 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We demonstrated that logical projection is a useful framework for understanding and implementing QIF. In the future, we are interested in exploring more advanced projection computation techniques [3,4,26].…”

Section: Resultsmentioning

confidence: 99%

SAT-Based Analysis and Quantification of Information Flow in Programs

Klebanov

Manthey

Muise

2013

Quantitative Evaluation of Systems

View full text Add to dashboard Cite

Abstract. Quantitative information flow analysis (QIF) is a portfolio of security techniques quantifying the flow of confidential information to public ports. In this paper, we advance the state of the art in QIF for imperative programs. We present both an abstract formulation of the analysis in terms of verification condition generation, logical projection and model counting, and an efficient concrete implementation targeting ANSI C programs. The implementation combines various novel and existing SAT-based tools for bounded model checking, # SAT solving in presence of projection, and SAT preprocessing. We evaluate the technique on synthetic and semi-realistic benchmarks.

show abstract

Section: Resultsmentioning

confidence: 99%

SAT-Based Analysis and Quantification of Information Flow in Programs

Klebanov

Manthey

Muise

2013

Quantitative Evaluation of Systems

View full text Add to dashboard Cite

show abstract

“…Unused variables are eventually removed during the conversion between a CNF and a DNF formula. For the latter, we use the projection method of Brauer et al [5], which is based on SAT-solving and calculates a minimal DNF representation from a CNF formula and vice versa. Our implementation is written in Java using Minisat v2.2.…”

Section: Implementation and Experimental Resultsmentioning

confidence: 99%

“…However, their analysis does not consider summary nodes. Furthermore, due to the lack of an adequate projection algorithm [5] they deliberately destroy relational information using cartesian abstraction.…”

Section: Related Approaches To Shape Analysismentioning

confidence: 99%

FESA: Fold- and Expand-Based Shape Analysis

Siegel

Simon

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. A static shape analysis is presented that can prove the absence of NULL-and dangling pointer dereferences in standard algorithms on lists, trees and graphs. It is conceptually simpler than other analyses that use symbolically represented logic to describe the heap. Instead, it represents the heap as a single graph and a Boolean formula. The key idea is to summarize two nodes by calculating their common points-to information, which is done using the recently proposed fold and expand operations. The force of this approach is that both, fold and expand , retain relational information between points-to edges, thereby essentially inferring new shape invariants. We show that highly precise shape invariants can be inferred using off-the-shelf SAT-solvers. Cheaper approximations may augment standard points-to analysis used in compiler optimisations.

show abstract

“…In this way, renaming is straightforward and conjunction is reduced to list-concatenation (Howe and King, 2001). However, disjunction, implication and existential quantifier elimination are performed by enumerating prime implicants (Brauer et al, 2011), which reduces these operations to incremental SAT. The solver is called through a foreign language interface following Codish et al (2008).…”

Section: Methodsmentioning

confidence: 99%

RedAlert: Determinacy inference for Prolog

Kriener¹,

King²

2011

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstracted to systematically derive a backward analysis that derives conditions sufficient for a goal to succeed at most once. The method is conceptionally simpler and easier to implement than existing techniques, whilst improving the latter's handling of cut. Formal arguments substantiate correctness and experimental work, and a tool called 'RedAlert' demonstrates the method's generality and applicability.

show abstract

Existential Quantification as Incremental SAT

Cited by 26 publications

References 35 publications

SAT-Based Analysis and Quantification of Information Flow in Programs

SAT-Based Analysis and Quantification of Information Flow in Programs

FESA: Fold- and Expand-Based Shape Analysis

RedAlert: Determinacy inference for Prolog

Contact Info

Product

Resources

About