On the public citation graph
Synchronizing Constrained Horn Clauses
0 signed · 34 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/978-3-319-08867-9_2openalex-snapshot
SMT-Based Model Checking for Recursive Programs
inferredcites →https://doi.org/10.1007/978-3-319-41528-4_14openalex-snapshot
Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata
inferredcites →https://doi.org/10.1007/978-3-319-41540-6_24openalex-snapshot
Property Directed Equivalence via Abstract Simulation
inferredcites →https://doi.org/10.1007/978-3-319-48989-6_39openalex-snapshot
Regression Verification for Unbalanced Recursive Functions
inferredcites →https://doi.org/10.1007/978-3-642-21437-0_17openalex-snapshot
Relational Verification Using Product Programs
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_13openalex-snapshot
Generalized Property Directed Reachability
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_24openalex-snapshot
Disjunctive Interpolants for Horn-Clause Verification
inferredcites →https://doi.org/10.1007/978-3-662-46681-0_10openalex-snapshot
Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling
inferredcites →https://doi.org/10.1007/978-3-662-53413-7_8openalex-snapshot
Relational Verification Through Horn Clause Transformation
inferredcites →https://doi.org/10.1016/0304-3975(95)00148-4openalex-snapshot
Transformations of CLP modules
inferredcites →https://doi.org/10.1145/2254064.2254112openalex-snapshot
Synthesizing software verifiers from proof rules
inferredcites →https://doi.org/10.1145/2345156.2254112openalex-snapshot
Synthesizing software verifiers from proof rules
inferredcites →https://doi.org/10.1145/2491411.2491452openalex-snapshot
Differential assertion checking
inferredcites →https://doi.org/10.1145/3062341.3062382openalex-snapshot
Gradual synthesis for static parallelization of single-pass array-processing programs
inferredcites →https://doi.org/10.1145/3140587.3062382openalex-snapshot
Gradual synthesis for static parallelization of single-pass array-processing programs
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.48550/arxiv.1704.04558openalex-snapshot
Verifying Safety of Functional Programs with Rosette/Unbound
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-25540-4_9openalex-snapshot
Property Directed Self Composition
inferred← citeshttps://doi.org/10.1007/978-3-030-45237-7_12openalex-snapshot
Fold/Unfold Transformations for Fixpoint Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_16openalex-snapshot
Solving Constrained Horn Clauses over Algebraic Data Types
inferred← citeshttps://doi.org/10.1007/978-3-031-30820-8_18openalex-snapshot
Lockstep Composition for Unbalanced Loops
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_17openalex-snapshot
Predicate Pairing with Abstraction for Relational Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_11openalex-snapshot
Lazy Self-composition for Security Verification
inferred← citeshttps://doi.org/10.1007/978-3-319-96145-3_9openalex-snapshot
Exploiting Synchrony and Symmetry in Relational Verification
inferred← citeshttps://doi.org/10.1017/s1471068418000030openalex-snapshot
Tree dimension in verification of constrained Horn clauses
inferred← citeshttps://doi.org/10.1017/s1471068418000157openalex-snapshot
Solving Horn Clauses on Inductive Data Types Without Induction
inferred← citeshttps://doi.org/10.1145/3314221.3314596openalex-snapshot
Semantic program alignment for equivalence checking
inferred← citeshttps://doi.org/10.1145/3763160openalex-snapshot
Products of Recursive Programs for Hypersafety Verification
inferred← citeshttps://doi.org/10.18255/1818-1015-2019-4-550-571openalex-snapshot
Property-Directed Inference of Relational Invariants
inferred← citeshttps://doi.org/10.23919/fmcad.2019.8894274openalex-snapshot
Property Directed Inference of Relational Invariants
inferred← citeshttps://doi.org/10.4204/eptcs.296.8openalex-snapshot
Proving Properties of Sorting Programs: A Case Study in Horn Clause Verification
inferred← citeshttps://doi.org/10.4204/eptcs.299.4openalex-snapshot
Lemma Generation for Horn Clause Satisfiability: A Preliminary Study
inferred← citeshttps://doi.org/10.48550/arxiv.1709.04809openalex-snapshot
Enhancing Predicate Pairing with Abstraction for Relational Verification
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.