On the public citation graph

Playing with Quantified Satisfaction

https://doi.org/10.29007/vv21
0 signed · 66 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-68804-8openalex-snapshot
Finite Model Theory and Its Applications
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_2openalex-snapshot
SMT-Based Model Checking for Recursive Programs
inferredcites →https://doi.org/10.1007/978-3-319-21401-6_33openalex-snapshot
Program Synthesis Using Dual Interpretation
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_25openalex-snapshot
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-642-14203-1_27openalex-snapshot
Linear Quantifier Elimination as an Abstract Decision Procedure
inferredcites →https://doi.org/10.1007/978-3-642-14203-1_34openalex-snapshot
Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development
inferredcites →https://doi.org/10.1007/978-3-642-18275-4_7openalex-snapshot
SAT-Based Model Checking without Unrolling
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_10openalex-snapshot
Solving QBF with Counterexample Guided Refinement
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_13openalex-snapshot
Generalized Property Directed Reachability
inferredcites →https://doi.org/10.1007/s10703-014-0214-zopenalex-snapshot
Quantifier elimination by dependency sequents
inferredcites →https://doi.org/10.1017/cbo9780511973468openalex-snapshot
Lectures in Game Theory for Computer Scientists
inferredcites →https://doi.org/10.1093/comjnl/36.5.450openalex-snapshot
Applying Linear Quantifier Elimination
inferredcites →https://doi.org/10.1109/fmcad.2015.7542257openalex-snapshot
Compositional verification of procedural programs using horn clauses over integers and arrays
inferredcites →https://doi.org/10.1145/1244002.1244078openalex-snapshot
A solver for quantified Boolean and linear constraints
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.21236/ada613949openalex-snapshot
Automated Discovery of Simulation Between Programs
inferredcites →https://doi.org/10.29007/8cf7openalex-snapshot
Anatomy of Alternating Quantifier Satisfiability (Work in progress)
inferredcites →https://doi.org/10.48550/arxiv.2608.14274openalex-snapshot
Solving QBF by Clause Selection
inferredcites →https://doi.org/10.7873/date.2013.172openalex-snapshot
Bridging the Gap between Dual Propagation and CNF-based QBF Solving

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-01090-4_15openalex-snapshot
Quantifiers on Demand
inferred← citeshttps://doi.org/10.1007/978-3-030-17465-1_20openalex-snapshot
Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-25543-5_8openalex-snapshot
Invertibility Conditions for Floating-Point Formulas
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_7openalex-snapshot
Global Guidance for Local Generalization in Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_11openalex-snapshot
Eliminating Message Counters in Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_10openalex-snapshot
Eliminating Message Counters in Synchronous Threshold Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-67067-2_14openalex-snapshot
Unbounded Procedure Summaries from Bounded Environments
inferred← citeshttps://doi.org/10.1007/978-3-030-72013-1_8openalex-snapshot
Syntax-Guided Quantifier Instantiation
inferred← citeshttps://doi.org/10.1007/978-3-031-37703-7_4openalex-snapshot
Fast Approximations of Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_5openalex-snapshot
QSMA: A New Algorithm for Quantified Satisfiability Modulo Theory and Assignment
inferred← citeshttps://doi.org/10.1007/978-3-031-42441-0_5openalex-snapshot
An Optimised Complete Strategy for Testing Symbolic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_9openalex-snapshot
Weakest Precondition Inference for Non-Deterministic Linear Array Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8openalex-snapshot
Programming Languages and Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-57267-8_10openalex-snapshot
Maximal Quantified Precondition Synthesis for Linear Array Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_6openalex-snapshot
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_7openalex-snapshot
A Divide-and-Conquer Approach to Variable Elimination in Linear Real Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-75387-9_17openalex-snapshot
Synthesis from Infinite-State Generalized Reactivity(1) Specifications
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_26openalex-snapshot
Relatively Complete and Efficient Partial Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/978-3-032-32526-6_4openalex-snapshot
Lagrangian-Based Duality for Quantified SMT Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_16openalex-snapshot
A Decision Procedure for Separation Logic in SMT
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_21openalex-snapshot
Verifying Array Manipulating Programs by Tiling
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_12openalex-snapshot
Circuit-Based Search Space Pruning in QBF
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_15openalex-snapshot
Counterexample-Guided Model Synthesis
inferred← citeshttps://doi.org/10.1007/s10703-025-00470-9openalex-snapshot
Golem: a flexible and efficient solver for constrained Horn clauses
inferred← citeshttps://doi.org/10.1007/s10817-021-09606-yopenalex-snapshot
Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00212openalex-snapshot
Symbolic Fixpoint Algorithms for Logical LTL Games
inferred← citeshttps://doi.org/10.1145/3158149openalex-snapshot
Strategy synthesis for linear arithmetic games
inferred← citeshttps://doi.org/10.1145/3324884.3416586openalex-snapshot
Synthesis of infinite-state systems with random behavior
inferred← citeshttps://doi.org/10.1145/3400302.3415708openalex-snapshot
Word level property directed reachability
inferred← citeshttps://doi.org/10.1145/3453483.3454055openalex-snapshot
Beyond the elementary representations of program invariants over algebraic data types
inferred← citeshttps://doi.org/10.1145/3468264.3473126openalex-snapshot
GenSys: a scalable fixed-point engine for maximal controller synthesis over infinite state spaces
inferred← citeshttps://doi.org/10.1145/3519939.3523726openalex-snapshot
Recursion synthesis with unrealizability witnesses
inferred← citeshttps://doi.org/10.1145/3704904openalex-snapshot
A Primal-Dual Perspective on Program Verification Algorithms
inferred← citeshttps://doi.org/10.1145/3720470openalex-snapshot
LOUD: Synthesizing Strongest and Weakest Specifications
inferred← citeshttps://doi.org/10.1145/3729320openalex-snapshot
Verifying Solutions to Semantics-Guided Synthesis Problems
inferred← citeshttps://doi.org/10.2197/ipsjjip.29.685openalex-snapshot
A Functional Reactive Programming Language for Small-Scale Embedded Systems with Recursive Data Types
inferred← citeshttps://doi.org/10.23919/fmcad.2019.8894274openalex-snapshot
Property Directed Inference of Relational Invariants
inferred← citeshttps://doi.org/10.29007/kg4vopenalex-snapshot
VIRAS: Conflict-Driven Quantifier Elimination for Integer-Real Arithmetic
inferred← citeshttps://doi.org/10.29007/ltkkopenalex-snapshot
A Clausal Normal Form Translation for FOOL
inferred← citeshttps://doi.org/10.29007/xrhzopenalex-snapshot
Challenges for Fast Synthesis Procedures in SMT
inferred← citeshttps://doi.org/10.3233/sat190121openalex-snapshot
CAQE and QuAbS: Abstraction Based QBF Solvers
inferred← citeshttps://doi.org/10.4204/eptcs.260.8openalex-snapshot
SyGuS Techniques in the Core of an SMT Solver
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10357openalex-snapshot
Partial Quantifier Elimination With Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2003.09667openalex-snapshot
Partial Quantifier Elimination By Certificate Clauses
inferred← citeshttps://doi.org/10.48550/arxiv.2106.00664openalex-snapshot
Quantifiers on Demand
inferred← citeshttps://doi.org/10.48550/arxiv.2108.00225openalex-snapshot
Solving Constrained Horn Clauses over ADTs by Finite Model Finding
inferred← citeshttps://doi.org/10.5555/3077629.3077648openalex-snapshot
Property-directed k-induction
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.