CVC: A Cooperating Validity Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Uniform Derivation of Decision Procedures by Superposition
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
Interpolation for data structures
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering
Memory modeling in ESL-RTL equivalence checking
Proceedings of the 44th annual Design Automation Conference
Decision procedures for extensions of the theory of arrays
Annals of Mathematics and Artificial Intelligence
${\mathcal{T}}$-Decision by Decomposition
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
An SMT Approach to Bounded Reachability Analysis of Model Programs
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Tensors of Comodels and Models for Operational Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On Bounded Reachability of Programs with Set Comprehensions
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Logic of Singly Indexed Arrays
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Lemmas on demand for the extensional theory of arrays
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Deciding array formulas with frugal axiom instantiation
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
A write-based solver for SAT modulo the theory of arrays
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Automatic Verification of Integer Array Programs
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Automated deduction for verification
ACM Computing Surveys (CSUR)
Interpolation and Symbol Elimination
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Theory decision by decomposition
Journal of Symbolic Computation
Combining Non-stably Infinite, Non-first Order Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
From Comodels to Coalgebras: State and Arrays
Electronic Notes in Theoretical Computer Science (ENTCS)
Decision Procedures for Set-Valued Fields
Electronic Notes in Theoretical Computer Science (ENTCS)
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
Electronic Notes in Theoretical Computer Science (ENTCS)
An online proof-producing decision procedure for mixed-integer linear arithmetic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A decision procedure for bit-vectors and arrays
CAV'07 Proceedings of the 19th international conference on Computer aided verification
What else is decidable about integer arrays?
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Symbolic heap abstraction with demand-driven axiomatization of memory invariants
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Splitting on demand in SAT modulo theories
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Transformational verification of parameterized protocols using array formulas
LOPSTR'05 Proceedings of the 15th international conference on Logic Based Program Synthesis and Transformation
Building a calculus of data structures
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
On array theory of bounded elements
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
What's decidable about arrays?
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
An Instantiation Scheme for Satisfiability Modulo Theories
Journal of Automated Reasoning
An axiomatization of arrays for kleene algebra with tests
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Bounded model checking of software using SMT solvers instead of SAT solvers
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
SMT-based false positive elimination in static program analysis
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Array Theory of Bounded Elements and its Applications
Journal of Automated Reasoning
| Hi-index | 0.00 |
Abstract: A decision procedure for a theory of arrays is of interest for applications in formal verification, program analysis, and automated theorem-proving. This paper presents a decision procedure for an extensional theory of arrays and proves it correct.