On the public citation graph
Lemmas on Demand for the Extensional Theory of Arrays
0 signed · 132 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11513988_34openalex-snapshot
Efficient Satisfiability Modulo Theories via Delayed Theory Combination
inferredcites →https://doi.org/10.1007/11591191_3openalex-snapshot
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
inferredcites →https://doi.org/10.1007/11916277_35openalex-snapshot
Splitting on Demand in SAT Modulo Theories
inferredcites →https://doi.org/10.1007/11916277_36openalex-snapshot
Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis
inferredcites →https://doi.org/10.1007/3-540-45657-0_18openalex-snapshot
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_40openalex-snapshot
The UCLID Decision Procedure
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_49openalex-snapshot
CVC Lite: A New Implementation of the Cooperating Validity Checker
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_34openalex-snapshot
Theorem Proving Using Lazy Proof Explication
inferredcites →https://doi.org/10.1007/978-3-540-71209-1_28openalex-snapshot
Deciding Bit-Vector Arithmetic with Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_33openalex-snapshot
C32SAT: Checking C Expressions
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_35openalex-snapshot
BAT: The Bit-Level Analysis Tool
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_52openalex-snapshot
A Decision Procedure for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_54openalex-snapshot
A Lazy and Layered SMT( $\mathcal{BV}$ ) Solver for Hard Industrial Verification Problems
inferredcites →https://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferredcites →https://doi.org/10.1007/978-3-540-74113-8openalex-snapshot
The Calculus of Computation: Decision Procedures with Applications to Verification
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_16openalex-snapshot
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_28openalex-snapshot
On the Complexity of Derivation in Propositional Calculus
inferredcites →https://doi.org/10.1007/978-94-011-1793-7_2openalex-snapshot
Towards a Mathematical Science of Computation
inferredcites →https://doi.org/10.1007/s10472-007-9078-xopenalex-snapshot
Decision procedures for extensions of the theory of arrays
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
inferredcites →https://doi.org/10.1016/s1571-0661(05)82542-3openalex-snapshot
Temporal Induction by Incremental SAT Solving
inferredcites →https://doi.org/10.1109/fmcad.2008.ecp.18openalex-snapshot
A Write-Based Solver for SAT Modulo the Theory of Arrays
inferredcites →https://doi.org/10.1109/fmcad.2008.ecp.32openalex-snapshot
Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver
inferredcites →https://doi.org/10.1109/lics.2001.932480openalex-snapshot
A decision procedure for an extensional theory of arrays
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferredcites →https://doi.org/10.1145/1233501.1233663openalex-snapshot
Automatic memory reductions for RTL model verification
inferredcites →https://doi.org/10.1145/1512464.1512468openalex-snapshot
Deciding array formulas with frugal axiom instantiation
inferredcites →https://doi.org/10.1145/2422.322411openalex-snapshot
Deciding Combinations of Theories
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/378239.378470openalex-snapshot
Circuit-based Boolean Reasoning
inferredcites →https://doi.org/10.1145/876638.876643openalex-snapshot
Counterexample-guided abstraction refinement for symbolic model checking
inferredcites →https://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferredcites →https://doi.org/10.3233/sat190067openalex-snapshot
Lemmas on Demand for the Extensional Theory of Arrays
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_9openalex-snapshot
Reasoning in the Theory of Heap: Satisfiability and Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_10openalex-snapshot
A Theory of Cartesian Arrays (with Applications in Quantum Circuit Verification)
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_2openalex-snapshot
Satisfiability Modulo Extensional Constant Arrays
inferred← citeshttps://doi.org/10.1007/978-3-032-32589-1_9openalex-snapshot
Accelerating Loops with Arrays
inferred← citeshttps://doi.org/10.1007/978-3-319-08587-6_29openalex-snapshot
Skeptik: A Proof Compression System
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_10openalex-snapshot
Automatic Evaluation of Context-Free Grammars (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_30openalex-snapshot
Automatic Evaluation of Reductions between NP-Complete Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_31openalex-snapshot
DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_41openalex-snapshot
Core-Guided MaxSAT with Soft Cardinality Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_11openalex-snapshot
Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-13191-7_9openalex-snapshot
Bounded Model Checking for Weighted Interpreted Systems and for Flat Weighted Epistemic Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-19638-1_7openalex-snapshot
Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-25524-8_49openalex-snapshot
Checking WELTLK Properties of Weighted Interpreted Systems via SMT-Based Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_23openalex-snapshot
A Correct-by-Decision Solution for Simultaneous Place and Route
inferred← citeshttps://doi.org/10.1007/978-3-319-66167-4_2openalex-snapshot
Designing Theory Solvers with Extensions
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_22openalex-snapshot
Theory Refinement for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_4openalex-snapshot
Adaptive Restart Strategies for Conflict Driven SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_16openalex-snapshot
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-01818-3_5openalex-snapshot
Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_23openalex-snapshot
Minimizing Learned Clauses
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_30openalex-snapshot
Restart Strategy Selection Using Machine Learning Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_45openalex-snapshot
Algorithms for Weighted Boolean Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_1openalex-snapshot
SAT, SMT and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_50openalex-snapshot
The Conflict-Driven Answer Set Solver clasp: Progress Report
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_34openalex-snapshot
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_37openalex-snapshot
Efficient Detection of Errors in Java Components Using Random Environment and Restarts
inferred← citeshttps://doi.org/10.1007/978-3-642-12251-4_3openalex-snapshot
Solving Constraint Satisfaction Problems with SAT Technology
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_16openalex-snapshot
Improving Unsatisfiability-Based Algorithms for Boolean Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_23openalex-snapshot
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_26openalex-snapshot
Two Techniques for Minimizing Resolution Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_7openalex-snapshot
Exact DFA Identification Using SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_13openalex-snapshot
Minimally Unsatisfiable Boolean Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_14openalex-snapshot
On Improving MUS Extraction Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-24580-0_11openalex-snapshot
A Real-World Benchmark Model for Testing Concurrent Real-Time Systems in the Automotive Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-29828-8_2openalex-snapshot
fdcc: A Combined Approach for Solving Constraints over Finite Domains and Arrays
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_23openalex-snapshot
On Efficient Computation of Variable MUSes
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_14openalex-snapshot
On Computing Minimal Equivalent Subformulas
inferred← citeshttps://doi.org/10.1007/978-3-642-35873-9_1openalex-snapshot
A Model-Constructing Satisfiability Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-44927-7_24openalex-snapshot
SAT-Based Bounded Model Checking for Weighted Interpreted Systems and Weighted Linear Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-54108-7_6openalex-snapshot
Extending the Theory of Arrays: memset, memcpy, and Beyond
inferred← citeshttps://doi.org/10.1007/s00165-017-0419-1openalex-snapshot
Incremental bounded model checking for embedded software
inferred← citeshttps://doi.org/10.1007/s10458-013-9232-2openalex-snapshot
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance
inferred← citeshttps://doi.org/10.1007/s10472-012-9322-xopenalex-snapshot
Producing and verifying extremely large propositional refutations
inferred← citeshttps://doi.org/10.1007/s10479-012-1081-xopenalex-snapshot
Curriculum-based course timetabling with SAT and MaxSAT
inferred← citeshttps://doi.org/10.1007/s10514-014-9418-8openalex-snapshot
Provably correct reactive control from natural language
inferred← citeshttps://doi.org/10.1007/s10601-012-9121-3openalex-snapshot
An overview of parallel SAT solving
inferred← citeshttps://doi.org/10.1007/s10601-012-9131-1openalex-snapshot
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
inferred← citeshttps://doi.org/10.1007/s10601-013-9146-2openalex-snapshot
Iterative and core-guided MaxSAT solving: A survey and assessment
inferred← citeshttps://doi.org/10.1007/s10703-014-0208-xopenalex-snapshot
Resolution proof transformation for compression and interpolation
inferred← citeshttps://doi.org/10.1007/s10817-009-9156-3openalex-snapshot
On Modern Clause-Learning Satisfiability Solvers
inferred← citeshttps://doi.org/10.1007/s10817-013-9293-6openalex-snapshot
Array Theory of Bounded Elements and its Applications
inferred← citeshttps://doi.org/10.1007/s10817-018-09510-yopenalex-snapshot
Conflict-Driven Satisfiability for Theory Combination: Transition System and Completeness
inferred← citeshttps://doi.org/10.1007/s11225-015-9637-9openalex-snapshot
Checking EMTLK Properties of Timed Interpreted Systems Via Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/s11704-016-6048-7openalex-snapshot
Efficient software product-line model checking using induction and a SAT solver
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.09.002openalex-snapshot
Synchronous counting and computational algorithm design
inferred← citeshttps://doi.org/10.1017/s1471068410000396openalex-snapshot
Testing and debugging techniques for answer set solver development
inferred← citeshttps://doi.org/10.1109/apsec57359.2022.00042openalex-snapshot
Optimal Refinement-based Array Constraint Solving for Symbolic Execution
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.18openalex-snapshot
A Write-Based Solver for SAT Modulo the Theory of Arrays
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351142openalex-snapshot
Generalized, efficient array decision procedures
inferred← citeshttps://doi.org/10.1109/fmcad.2013.6679407openalex-snapshot
Generalized counterexamples to liveness properties
inferred← citeshttps://doi.org/10.1109/fmcad.2013.7027033openalex-snapshot
The design and implementation of the model constructing satisfiability calculus
inferred← citeshttps://doi.org/10.1109/icmla.2009.28openalex-snapshot
Learning Context Free Grammars by Using SAT Solvers
inferred← citeshttps://doi.org/10.1109/ictai.2009.22openalex-snapshot
Learning for Dynamic Subsumption
inferred← citeshttps://doi.org/10.1145/1629911.1630057openalex-snapshot
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
inferred← citeshttps://doi.org/10.1145/1670412openalex-snapshot
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1145/2505879.2505901openalex-snapshot
Theory propagation and rational-trees
inferred← citeshttps://doi.org/10.1145/3176644openalex-snapshot
Configuring Software Product Lines by Combining Many-Objective Optimization and SAT Solvers
inferred← citeshttps://doi.org/10.15168/11572_368265openalex-snapshot
An Effective SMT Engine for Formal Verification
inferred← citeshttps://doi.org/10.1609/aimag.v33i1.2395openalex-snapshot
The International SAT Solver Competitions
inferred← citeshttps://doi.org/10.1609/icaps.v23i1.13549openalex-snapshot
Partially Grounded Planning as Quantified Boolean Formula
inferred← citeshttps://doi.org/10.1613/jair.1.11876openalex-snapshot
Strategic Abstention based on Preference Extensions: Positive Results and Computer-Generated Impossibilities
inferred← citeshttps://doi.org/10.1613/jair.3196openalex-snapshot
Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1613/jair.4959openalex-snapshot
Finding Strategyproof Social Choice Functions via SAT Solving
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:4)2012openalex-snapshot
Quantifier-Free Interpolation of a Theory of Arrays
inferred← citeshttps://doi.org/10.29007/dc9bopenalex-snapshot
Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing
inferred← citeshttps://doi.org/10.29007/q58topenalex-snapshot
A Theory of Arrays with set and copy Operations
inferred← citeshttps://doi.org/10.29007/w42sopenalex-snapshot
Towards Smarter MACE-style Model Finders
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-15openalex-snapshot
On Computing Backbones of Propositional Theories
inferred← citeshttps://doi.org/10.3233/aic-2012-0523openalex-snapshot
Towards efficient MUS extraction
inferred← citeshttps://doi.org/10.48550/arxiv.1402.4413openalex-snapshot
Towards Ultra Rapid Restarts
inferred← citeshttps://doi.org/10.48550/arxiv.1409.5872openalex-snapshot
Incremental Bounded Model Checking for Embedded Software (extended version)
inferred← citeshttps://doi.org/10.48550/arxiv.1604.06204openalex-snapshot
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.2006.01621openalex-snapshot
Bitwuzla at the SMT-COMP 2020
inferred← citeshttps://doi.org/10.48550/arxiv.2008.10061openalex-snapshot
An Incremental Abstraction Scheme for Solving Hard SMT-Instances over Bit-Vectors
inferred← citeshttps://doi.org/10.70675/55d67b72zf0ddz41f8zba38z7e517e23bf93openalex-snapshot
Decision procedures for vulnerability analysis
showing the first 92 of 93 · page through all 93
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.