On the public citation graph
Ultimate TreeAutomizer (CHC-COMP Tool Description)
0 signed · 33 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/11532231_26openalex-snapshot
A Combination Method for Generating Interpolants
inferredcites →https://doi.org/10.1007/3-540-45657-0_40openalex-snapshot
CVC: A Cooperating Validity Checker
inferredcites →https://doi.org/10.1007/3-540-49481-2_26openalex-snapshot
Safe Datalog Queries with Linear Constraints
inferredcites →https://doi.org/10.1007/3-540-49519-3_18openalex-snapshot
A Performance Study of BDD-Based Model Checking
inferredcites →https://doi.org/10.1007/3-540-52753-2_52openalex-snapshot
A direct proof for the completeness of SLD-resolution
inferredcites →https://doi.org/10.1007/978-3-319-19249-9openalex-snapshot
FM 2015: Formal Methods : 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings
inferredcites →https://doi.org/10.1007/978-3-540-69611-7_16openalex-snapshot
ARMC: The Logical Choice for Software Model Checking with Abstraction Refinement
inferredcites →https://doi.org/10.1007/978-3-540-73368-3_46openalex-snapshot
Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models
inferredcites →https://doi.org/10.1007/978-3-642-31365-3_38openalex-snapshot
Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
inferredcites →https://doi.org/10.1016/j.jsc.2010.06.005openalex-snapshot
Constraint solving for interpolation
inferredcites →https://doi.org/10.1109/ms.2006.117openalex-snapshot
Unit tests reloaded: parameterized unit testing with symbolic execution
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/2254064.2254112openalex-snapshot
Synthesizing software verifiers from proof rules
inferredcites →https://doi.org/10.1145/3009837.3009893openalex-snapshot
Thread modularity at many levels: a pearl in compositional verification
inferredcites →https://doi.org/10.1145/3106237.3106307openalex-snapshot
Craig vs. Newton in software model checking
inferredcites →https://doi.org/10.1145/69575.69577openalex-snapshot
Tentative steps toward a development method for interfering programs
inferredcites →https://doi.org/10.5555/2157654.2157675openalex-snapshot
Efficient implementation of property directed reachability
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-67067-2_14openalex-snapshot
Unbounded Procedure Summaries from Bounded Environments
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-44245-2_13openalex-snapshot
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-66149-5_8openalex-snapshot
Solving Constrained Horn Clauses as C Programs with CHC2C
inferred← citeshttps://doi.org/10.1007/978-3-031-67695-6_2openalex-snapshot
Competition of Solvers for Constrained Horn Clauses (CHC-COMP 2023)
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_4openalex-snapshot
Integrating Loop Acceleration Into Bounded Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-032-08707-2_19openalex-snapshot
PolyQEnt: A Polynomial Quantified Entailment Solver
inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_16openalex-snapshot
Mode-based Reduction from Validity Checking of Fixpoint Logic Formulas to Test-Friendly Reachability Problem
inferred← citeshttps://doi.org/10.1007/s10703-020-00349-xopenalex-snapshot
Learning inductive invariants by sampling from frequency distributions
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.4204/eptcs.373.5openalex-snapshot
CHC-COMP 2022: Competition Report
inferred← citeshttps://doi.org/10.4204/eptcs.402.10openalex-snapshot
CHC-COMP 2023: Competition Report
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.