On the public citation graph
Efficient Satisfiability Modulo Theories via Delayed Theory Combination
0 signed · 81 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/11527695_2openalex-snapshot
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
inferredcites →https://doi.org/10.1007/3-540-36126-x_10openalex-snapshot
On Solving Presburger and Linear Arithmetic with SAT
inferredcites →https://doi.org/10.1007/3-540-44585-4_22openalex-snapshot
ICS: Integrated Canonizer and Solver?
inferredcites →https://doi.org/10.1007/3-540-44881-0openalex-snapshot
Rewriting Techniques and Applications
inferredcites →https://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferredcites →https://doi.org/10.1007/3-540-45657-0_16openalex-snapshot
Deciding Separation Formulas with SAT
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_35openalex-snapshot
A Temporal Logic of Nested Calls and Returns
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_14openalex-snapshot
DPLL(T): Fast Decision Procedures
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_24openalex-snapshot
Abstraction-Based Satisfiability Solving of Presburger Arithmetic
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_36openalex-snapshot
Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement
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-30206-3_19openalex-snapshot
Some Progress in Satisfiability Checking for Difference Logic
inferredcites →https://doi.org/10.1007/978-3-540-31862-0_27openalex-snapshot
Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_21openalex-snapshot
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
inferredcites →https://doi.org/10.1007/978-3-540-39813-4_5openalex-snapshot
Congruence Closure with Integer Offsets
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-94-009-0349-4_5openalex-snapshot
A New Correctness Proof of the Nelson-Oppen Combination Procedure
inferredcites →https://doi.org/10.1007/b107116openalex-snapshot
An automatic mapping from Statecharts to Verilog
inferredcites →https://doi.org/10.1016/j.ic.2005.05.011openalex-snapshot
Efficient theory combination via boolean search
inferredcites →https://doi.org/10.1016/s0049-237x(08)x7070-3openalex-snapshot
Solvable Cases of the Decision Problem
inferredcites →https://doi.org/10.1109/lics.2004.1319604openalex-snapshot
Deciding quantifier-free Presburger formulas using parameterized solution bounds
inferredcites →https://doi.org/10.1109/sefm.2003.1236224openalex-snapshot
Light-weight theorem proving for debugging and verifying units of code
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/775832.775945openalex-snapshot
A hybrid SAT-based decision procedure for separation logic with uninterpreted functions
inferredcites →https://doi.org/10.2307/2964059openalex-snapshot
W. Ackermann. Solvable cases of the decision problem. Studies in logic and the foundations of mathematics. North-Holland Publishing Company, Amsterdam1954, VIII + 114 pp.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11591191_3openalex-snapshot
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
inferred← citeshttps://doi.org/10.1007/11757283_6openalex-snapshot
Building Efficient Decision Procedures on Top of SAT Solvers
inferred← citeshttps://doi.org/10.1007/11814948_20openalex-snapshot
A Progressive Simplifier for Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/11817963_11openalex-snapshot
A Fast Linear-Arithmetic Solver for DPLL(T)
inferred← citeshttps://doi.org/10.1007/11853886_16openalex-snapshot
Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies
inferred← citeshttps://doi.org/10.1007/11916277_36openalex-snapshot
Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis
inferred← citeshttps://doi.org/10.1007/11916277_38openalex-snapshot
To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_3openalex-snapshot
Theory Combination: Beyond Equality Sharing
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-63516-3_5openalex-snapshot
Parallel Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_29openalex-snapshot
CSIsat: Interpolation for LA+EUF
inferred← citeshttps://doi.org/10.1007/978-3-540-71493-4_32openalex-snapshot
CEGAR Based Bounded Model Checking of Discrete Time Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74105-3openalex-snapshot
Decision Procedures: An Algorithmic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_2openalex-snapshot
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_18openalex-snapshot
Verifying Heap-Manipulating Programs in an SMT Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_7openalex-snapshot
Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_35openalex-snapshot
Generalizing DPLL to Richer Logics
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-31365-3_12openalex-snapshot
From Strong Amalgamability to Modularity of Quantifier-Free Interpolation
inferred← citeshttps://doi.org/10.1007/s10009-006-0001-2openalex-snapshot
The FSAP/NuSMV-SA Safety Analysis Platform
inferred← citeshttps://doi.org/10.1007/s10009-015-0400-3openalex-snapshot
Aircraft landing gear system: approaches with Event-B to the modeling of an industrial system
inferred← citeshttps://doi.org/10.1007/s10472-009-9152-7openalex-snapshot
Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
inferred← citeshttps://doi.org/10.1007/s10703-014-0208-xopenalex-snapshot
Resolution proof transformation for compression and interpolation
inferred← citeshttps://doi.org/10.1016/j.artint.2015.03.002openalex-snapshot
An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.001openalex-snapshot
Encoding RTL Constructs for MathSAT: a Preliminary Report
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.04.079openalex-snapshot
Model-based Theory Combination
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.011openalex-snapshot
Efficient theory combination via boolean search
inferred← citeshttps://doi.org/10.1109/async.2019.00021openalex-snapshot
Verifying Timed, Asynchronous Circuits using ACL2
inferred← citeshttps://doi.org/10.1109/fmcad.2006.13openalex-snapshot
Finite Instantiations for Integer Difference Logic
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/iccad.2010.5654297openalex-snapshot
Flexible interpolation with local proof transformations
inferred← citeshttps://doi.org/10.1109/synasc.2014.26openalex-snapshot
Implementing Reasoning Modules in Implicit Induction Theorem Provers
inferred← citeshttps://doi.org/10.1109/tcad.2008.2006159openalex-snapshot
Verification of Analog/Mixed-Signal Circuits Using Symbolic Methods
inferred← citeshttps://doi.org/10.1109/tqe.2021.3120449openalex-snapshot
Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm
inferred← citeshttps://doi.org/10.1109/wodes.2008.4605924openalex-snapshot
Beyond Boolean SAT: Satisfiability modulo theories
inferred← citeshttps://doi.org/10.1145/1375696.1375698openalex-snapshot
Simulating midlet's security claims with automata modulo theory
inferred← citeshttps://doi.org/10.1145/1459010.1459014openalex-snapshot
New results on rewrite-based satisfiability procedures
inferred← citeshttps://doi.org/10.1145/1512464.1512467openalex-snapshot
Lemmas on demand for the extensional theory of arrays
inferred← citeshttps://doi.org/10.1145/1995376.1995394openalex-snapshot
Satisfiability modulo theories
inferred← citeshttps://doi.org/10.1145/2490253openalex-snapshot
Quantifier-free interpolation in combinations of equality interpolating theories
inferred← citeshttps://doi.org/10.15514/ispras-2012-22-17openalex-snapshot
Static Verification Tools for C Programs and Linux Device Drivers: A Survey
inferred← citeshttps://doi.org/10.15514/ispras-2013-24-12openalex-snapshot
Introduction to CEGAR — Counter-Example Guided Abstraction Refinement
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.24963/ijcai.2017/171openalex-snapshot
Efficient and Complete FD-solving for extended array constraints
inferred← citeshttps://doi.org/10.3233/sat190011openalex-snapshot
Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic
inferred← citeshttps://doi.org/10.3233/sat190029openalex-snapshot
Disequality Management in Integer Difference Logic via Finite Instantiations1
inferred← citeshttps://doi.org/10.3233/sat190034openalex-snapshot
Lazy Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.3233/sat190067openalex-snapshot
Lemmas on Demand for the Extensional Theory of Arrays
inferred← citeshttps://doi.org/10.48550/arxiv.1312.0200openalex-snapshot
A Combined Approach for Constraints over Finite Domains and Arrays
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.