On the public citation graph

Interpolant-Based Transition Relation Approximation

0 signed · 100 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/10722167_15openalex-snapshot
Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/3-540-36577-x_2openalex-snapshot
Automatic Abstraction without Counterexamples
inferredcites →https://doi.org/10.1007/3-540-49059-0_14openalex-snapshot
Symbolic Model Checking without BDDs
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_15openalex-snapshot
A Symbolic Approach to Predicate Abstraction
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.003openalex-snapshot
An interpolating theorem prover
inferredcites →https://doi.org/10.1109/lics.2001.932482openalex-snapshot
Successive approximation of abstract transition relations
inferredcites →https://doi.org/10.1145/2641638.2641655openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.1145/503272.503274openalex-snapshot
The S LAM project
inferredcites →https://doi.org/10.1145/503272.503279openalex-snapshot
Lazy abstraction
inferredcites →https://doi.org/10.1145/565816.503279openalex-snapshot
Lazy abstraction
inferredcites →https://doi.org/10.1145/964001.964021openalex-snapshot
Abstractions from proofs
inferredcites →https://doi.org/10.2307/2275541openalex-snapshot
Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
inferredcites →https://doi.org/10.2307/2275583openalex-snapshot
Lower bounds for resolution and cutting plane proofs and monotone computations
inferredcites →https://doi.org/10.2307/2963594openalex-snapshot
Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11494744_2openalex-snapshot
Applications of Craig Interpolation to Model Checking
inferred← citeshttps://doi.org/10.1007/11817963_14openalex-snapshot
Lazy Abstraction with Interpolants
inferred← citeshttps://doi.org/10.1007/11817963_39openalex-snapshot
SMT Techniques for Fast Predicate Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_16openalex-snapshot
Farkas-Based Tree Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-030-99524-9_29openalex-snapshot
Transition Power Abstractions for Deep Counterexample Detection
inferred← citeshttps://doi.org/10.1007/978-3-031-99984-0_3openalex-snapshot
On Symbol Elimination and Uniform Interpolation in Theory Extensions
inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_19openalex-snapshot
Interpolation Properties and SAT-Based Model Checking
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-10575-8_23openalex-snapshot
Transfer of Model Checking to Industrial Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-15317-9_5openalex-snapshot
Compositional Analysis Using Component-Oriented Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_24openalex-snapshot
Sharper and Simpler Nonlinear Interpolants for Program Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_22openalex-snapshot
Learning Abstractions for Program Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_25openalex-snapshot
Constraint Solving for Interpolation
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_6openalex-snapshot
Interpolants and Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_3openalex-snapshot
Verification Technology Transfer
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_23openalex-snapshot
Array Abstractions from Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_30openalex-snapshot
Efficient Interpolant Generation in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_30openalex-snapshot
Verifying Reference Counting Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_23openalex-snapshot
On Extending Bounded Proofs to Inductive Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_30openalex-snapshot
Quantifier Elimination via Functional Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-02959-2_16openalex-snapshot
Ground Interpolation for Combined Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-13754-9_4openalex-snapshot
The Localization Reduction and Counterexample-Guided Abstraction Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-14203-1_16openalex-snapshot
Interpolation and Symbol Elimination in Vampire
inferred← citeshttps://doi.org/10.1007/978-3-642-14509-4_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-642-19583-9_17openalex-snapshot
An Efficient and Flexible Approach to Resolution Proof Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_4openalex-snapshot
Whale: An Interpolation-Based Algorithm for Inter-procedural Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-32759-9_17openalex-snapshot
Error Invariants
inferred← citeshttps://doi.org/10.1007/978-3-642-36742-7_22openalex-snapshot
Intertwined Forward-Backward Reachability Analysis Using Interpolants
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_23openalex-snapshot
Efficient Generation of Small Interpolants in CNF
inferred← citeshttps://doi.org/10.1007/978-3-642-45114-0_3openalex-snapshot
A Parametric Interpolation Framework for First-Order Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_45openalex-snapshot
PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification
inferred← citeshttps://doi.org/10.1007/978-981-15-3415-7_7openalex-snapshot
Probe Machine Based Computing Model for Solving Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-981-15-6401-7_35-1openalex-snapshot
Bit-Level Model Checking
inferred← citeshttps://doi.org/10.1007/978-981-97-9314-3_35openalex-snapshot
Bit-Level Model Checking
inferred← citeshttps://doi.org/10.1007/s10009-011-0185-yopenalex-snapshot
An abstraction refinement approach combining precise and approximated techniques
inferred← citeshttps://doi.org/10.1007/s10703-014-0208-xopenalex-snapshot
Resolution proof transformation for compression and interpolation
inferred← citeshttps://doi.org/10.1007/s10703-015-0224-5openalex-snapshot
Efficient generation of small interpolants in CNF
inferred← citeshttps://doi.org/10.1007/s10817-016-9364-6openalex-snapshot
Labelled Interpolation Systems for Hyper-Resolution, Clausal, and Local Proofs
inferred← citeshttps://doi.org/10.1007/s10817-024-09702-9openalex-snapshot
Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification
inferred← citeshttps://doi.org/10.1016/j.apal.2026.103808openalex-snapshot
Completeness of interpolation algorithms in classical and non-classical logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.034openalex-snapshot
SAT-based Abstraction Refinement for Real-time Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.10.027openalex-snapshot
SAT-based Verification for Timed Component Connectors
inferred← citeshttps://doi.org/10.1016/j.jsc.2010.06.005openalex-snapshot
Constraint solving for interpolation
inferred← citeshttps://doi.org/10.1016/j.scico.2011.02.003openalex-snapshot
SAT-based verification for timed component connectors
inferred← citeshttps://doi.org/10.1109/ase.2015.33openalex-snapshot
Interpolation Guided Compositional Verification (T)
inferred← citeshttps://doi.org/10.1109/csf.2017.35openalex-snapshot
Proving Flow Security of Sequential Logic via Automatically-Synthesized Relational Invariants
inferred← citeshttps://doi.org/10.1109/date.2007.364481openalex-snapshot
Image Computation and Predicate Refinement for RTL Verilog using Word Level Proofs
inferred← citeshttps://doi.org/10.1109/fmcad.2009.5351148openalex-snapshot
Interpolation-sequence based model checking
inferred← citeshttps://doi.org/10.1109/fmcad.2014.6987601openalex-snapshot
DRUPing for interpolates
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397270openalex-snapshot
Scalable exploration of functional dependency by interpolation and incremental SAT solving
inferred← citeshttps://doi.org/10.1109/iccad.2010.5654297openalex-snapshot
Flexible interpolation with local proof transformations
inferred← citeshttps://doi.org/10.1109/jproc.2015.2455034openalex-snapshot
Boolean Satisfiability Solvers and Their Applications in Model Checking
inferred← citeshttps://doi.org/10.1109/tc.2010.12openalex-snapshot
To SAT or Not to SAT: Scalable Exploration of Functional Dependency
inferred← citeshttps://doi.org/10.1109/tcad.2019.2915317openalex-snapshot
Reducing Interpolant Circuit Size Through SAT-Based Weakening
inferred← citeshttps://doi.org/10.1145/1181775.1181789openalex-snapshot
Interpolation for data structures
inferred← citeshttps://doi.org/10.1145/1181775.1181791openalex-snapshot
Bit level types for high level reasoning
inferred← citeshttps://doi.org/10.1145/1250734.1250784openalex-snapshot
Static error detection using semantic inconsistency inference
inferred← citeshttps://doi.org/10.1145/1255329.1255345openalex-snapshot
Guarded models for intrusion detection
inferred← citeshttps://doi.org/10.1145/1273442.1250784openalex-snapshot
Static error detection using semantic inconsistency inference
inferred← citeshttps://doi.org/10.1145/1529282.1529404openalex-snapshot
The synergy of precise and fast abstractions for program verification
inferred← citeshttps://doi.org/10.1145/1592434.1592438openalex-snapshot
Software model checking
inferred← citeshttps://doi.org/10.1145/1687399.1687402openalex-snapshot
Interpolant generation without constructing resolution graph
inferred← citeshttps://doi.org/10.1145/1706299.1706315openalex-snapshot
Dependent types from counterexamples
inferred← citeshttps://doi.org/10.1145/1706299.1706353openalex-snapshot
Nested interpolants
inferred← citeshttps://doi.org/10.1145/1707801.1706315openalex-snapshot
Dependent types from counterexamples
inferred← citeshttps://doi.org/10.1145/1707801.1706353openalex-snapshot
Nested interpolants
inferred← citeshttps://doi.org/10.1145/1838552.1838559openalex-snapshot
Efficient generation of craig interpolants in satisfiability modulo theories
inferred← citeshttps://doi.org/10.1145/3660797openalex-snapshot
A Transferability Study of Interpolation-Based Hardware Model Checking for Software Verification
inferred← citeshttps://doi.org/10.1145/3661814.3662112openalex-snapshot
On the Completeness of Interpolation Algorithms
inferred← citeshttps://doi.org/10.15168/11572_368265openalex-snapshot
An Effective SMT Engine for Formal Verification
inferred← citeshttps://doi.org/10.2168/lmcs-8(1:6)2012openalex-snapshot
Ground interpolation for the theory of equality
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:23)2018openalex-snapshot
On Interpolation and Symbol Elimination in Theory Extensions
inferred← citeshttps://doi.org/10.29007/1qb8openalex-snapshot
First-Order Interpolation and Interpolating Proof Systems
inferred← citeshttps://doi.org/10.29007/npn7openalex-snapshot
Automated Invariant Generation for the Verification of Real-Time Systems
inferred← citeshttps://doi.org/10.3233/978-1-61499-028-4-64openalex-snapshot
Model Checking: From BDDs to Interpolation
inferred← citeshttps://doi.org/10.3233/978-1-61499-385-8-17openalex-snapshot
SAT-based Model Checking: Interpolation, IC3, and Beyond
inferred← citeshttps://doi.org/10.3233/sat190011openalex-snapshot
Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic
inferred← citeshttps://doi.org/10.3390/math10030461openalex-snapshot
Interpolation and Uniform Interpolation in Quantifier-Free Fragments of Combined First-Order Theories
inferred← citeshttps://doi.org/10.4204/eptcs.10.3openalex-snapshot
Automated Predicate Abstraction for Real-Time Models
inferred← citeshttps://doi.org/10.4204/eptcs.169.5openalex-snapshot
Generalised Interpolation by Solving Recursion-Free Horn Clauses
inferred← citeshttps://doi.org/10.5075/epfl-thesis-4781openalex-snapshot
Software Verification by Combining Program Analyses of Adjustable Precision
inferred← citeshttps://doi.org/10.5287/ora-y0bamqrpdopenalex-snapshot
Automated quantitative software verification
inferred← citeshttps://doi.org/10.5555/1326073.1326120openalex-snapshot
Scalable exploration of functional dependency by interpolation and incremental SAT solving
inferred← citeshttps://doi.org/10.70675/38dcf47bz60b4z4a7dzb09fz43d98be9b60fopenalex-snapshot
Effective Encoding of Critical Systems for SAT-Based Model Checking.
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.