On the public citation graph

Applications of Craig Interpolation to Model Checking

https://doi.org/10.1007/11494744_2
0 signed · 37 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/11513988_6openalex-snapshot
Interpolant-Based Transition Relation Approximation
inferredcites →https://doi.org/10.1007/3-540-36577-x_2openalex-snapshot
Automatic Abstraction without Counterexamples
inferredcites →https://doi.org/10.1007/3-540-40922-x_8openalex-snapshot
Checking Safety Properties Using Induction and a SAT-Solver
inferredcites →https://doi.org/10.1007/3-540-45319-9_19openalex-snapshot
Boolean and Cartesian Abstraction for Model Checking C Programs
inferredcites →https://doi.org/10.1007/3-540-45657-0_19openalex-snapshot
Applying SAT Methods in Unbounded Symbolic Model Checking
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/3-540-63166-6_42openalex-snapshot
The invariant checker: Automated deductive verification of reactive systems
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_22openalex-snapshot
Constructing Quantified Invariants via Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_2openalex-snapshot
An Interpolating Theorem Prover
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.003openalex-snapshot
An interpolating theorem prover
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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.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/2963593openalex-snapshot
Linear reasoning. A new form of the Herbrand-Gentzen theorem
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/11804192_11openalex-snapshot
Abstraction and Refinement in Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-662-48288-9_13openalex-snapshot
A Simple Abstraction of Arrays and Maps by Program Translation
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_18openalex-snapshot
Cell Morphing: From Array Programs to Array-Free Horn Clauses
inferred← citeshttps://doi.org/10.1007/s10703-014-0208-xopenalex-snapshot
Resolution proof transformation for compression and interpolation
inferred← citeshttps://doi.org/10.1007/s13748-021-00240-8openalex-snapshot
First-order logic as a constraint satisfaction problem
inferred← citeshttps://doi.org/10.1016/j.apal.2018.04.001openalex-snapshot
Modularity results for interpolation, amalgamation and superamalgamation
inferred← citeshttps://doi.org/10.1049/iet-cdt.2010.0154openalex-snapshot
Efficient model checking of PSL safety properties
inferred← citeshttps://doi.org/10.1109/acsd.2010.27openalex-snapshot
Efficient Model Checking of PSL Safety Properties
inferred← citeshttps://doi.org/10.1109/iccad.2010.5654297openalex-snapshot
Flexible interpolation with local proof transformations
inferred← citeshttps://doi.org/10.1109/lics.2015.43openalex-snapshot
Interpolation with Decidable Fixpoint Logics
inferred← citeshttps://doi.org/10.1145/2490253openalex-snapshot
Quantifier-free interpolation in combinations of equality interpolating theories
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.3233/978-1-61499-385-8-17openalex-snapshot
SAT-based Model Checking: Interpolation, IC3, and Beyond
inferred← citeshttps://doi.org/10.4204/eptcs.245.3openalex-snapshot
Exploiting Hierarchy in the Abstraction-Based Verification of Statecharts Using SMT Solvers
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.171openalex-snapshot
Rewriting-based Quantifier-free Interpolation for a Theory of Arrays
inferred← citeshttps://doi.org/10.70675/15e9b415z4c63z4383zb324z9e0cf5e3b487openalex-snapshot
Contributions aux approches logiques de l'argumentation en intelligence artificielle
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.