A decision procedure for an extensional theory of arrays

Stump, Aaron; Barrett, Clark; Dill, David L.; Levitt, Jeremy R.

doi:10.1109/lics.2001.932480

Cited by 86 publications

(92 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The proof that the decision procedures are correct is straightforward w.r.t. other correctness proofs given in the literature (compare for instance our decision procedure for arrays with extensionality of Section 6 with [SDBL01]). In our approach, combining theories is also immediate.…”

Section: Introductionmentioning

confidence: 99%

“…In [SDBL01], the first decision procedure for an extensional theory of arrays is presented. The key ingredient is a modified congruence closure algorithm which is capable of handling (so called) partial equations.…”

Section: Introductionmentioning

confidence: 99%

“…The correctness proof is rather complex and it takes the main part of the paper; it is model-theoretic and rather ad-hoc. In Section 6, we give a decision procedure for the same theory considered in [SDBL01]. Our procedure is simpler to understand since it amounts to applying (almost directly) standard equality reasoning in contrast to handling partial equalities and our proof of correctness relies on basic properties of skolemization.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Uniform Derivation of Decision Procedures by Superposition

Armando

Ranise

Rusinowitch

2001

Computer Science Logic

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Uniform Derivation of Decision Procedures by Superposition

Armando

Ranise

Rusinowitch

2001

Computer Science Logic

View full text Add to dashboard Cite

show abstract

“…In our experiments we used the theory of arrays [25]. The theory provides two operations: access(m, a) (sometimes called read or select) to access the value of an array m at location a and update(m, a, v ) (sometimes called write or store) to get a version of m that is updated at location a with value v .…”

Section: Detecting Infeasible Pathsmentioning

confidence: 99%

SMT-Based False Positive Elimination in Static Program Analysis

Junker

Huuck

Fehnker

et al. 2012

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Static program analysis for bug detection in large C/C++ projects typically uses a high-level abstraction of the original program under investigation. As a result, so-called false positives are often inevitable, i.e., warnings that are not true bugs. In this work we present a novel abstraction refinement approach to automatically investigate and eliminate such false positives. Central to our approach is to view static analysis as a model checking problem, to iteratively compute infeasible sub-paths of infeasible paths using SMT solvers, and refine our models by adding observer automata to exclude such paths. Based on this new framework we present an implementation of the approach into the static analyzer Goanna and discuss a number of real-life experiments on larger C code projects, demonstrating that we were able to remove most false positives automatically.

show abstract

“…SMT solvers for the theory of arrays are described in [7,8]. ∀r, e. rselect k (rstore k (r, e)) = e for k = 1, .…”

Section: Satisfiability Modulo Theoriesmentioning

confidence: 99%

Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers

Armando

Mantovani

Platania

2006

Model Checking Software

109

View full text Add to dashboard Cite

Abstract. C Bounded Model Checking (CBMC) is one of the leading approaches to automatic software analysis. The key idea is to (i) build a propositional formula whose models correspond to program traces (of bounded length) that violate some given property and (ii) use state-ofthe-art SAT solvers to check the resulting formulae for satisfiability. In this paper we propose a generalisation of the CBMC approach based on an encoding into richer (but still decidable) theories than propositional logic. We show that our approach may lead to considerably more compact formulae than those obtained with CBMC. We have built a prototype implementation of our technique that uses a Satisfiability Modulo Theories (SMT) solver to solve the resulting formulae. Computer experiments indicate that our approach compares favourably with and on some significant problems outperforms CBMC.

show abstract

A decision procedure for an extensional theory of arrays

Abstract: A decision procedure for a theory of arrays is of interest for applications in formal ver$cation, program analysis, and automated theorem-proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct.

Cited by 86 publications

References 8 publications

Uniform Derivation of Decision Procedures by Superposition

Uniform Derivation of Decision Procedures by Superposition

SMT-Based False Positive Elimination in Static Program Analysis

Bounded Model Checking of Software Using SMT Solvers Instead of SAT Solvers

Contact Info

Product

Resources

About