On the public citation graph

Solving constrained Horn clauses modulo algebraic data types and recursive functions

0 signed · 61 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-45251-6_29openalex-snapshot

Houdini, an Annotation Assistant for ESC/Java

inferredcites →https://doi.org/10.1007/978-3-030-11245-5_17openalex-snapshot

euforia: Complete Software Model Checking with Uninterpreted Functions

inferredcites →https://doi.org/10.1007/978-3-030-29436-6_28openalex-snapshot

Induction in Saturation-Based Proof Search

inferredcites →https://doi.org/10.1007/978-3-030-44914-8_18openalex-snapshot

RustHorn: CHC-Based Verification for Rust Programs

inferredcites →https://doi.org/10.1007/978-3-030-51074-9_6openalex-snapshot

Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates

inferredcites →https://doi.org/10.1007/978-3-319-09099-3_2openalex-snapshot

Computing with an SMT Solver

inferredcites →https://doi.org/10.1007/978-3-319-23534-9_2openalex-snapshot

Horn Clause Solvers for Program Verification

inferredcites →https://doi.org/10.1007/978-3-319-89960-2_20openalex-snapshot

ICE-Based Refinement Type Discovery for Higher-Order Functional Programs

inferredcites →https://doi.org/10.1007/978-3-540-25984-8_9openalex-snapshot

Decision Procedures for Recursive Data Structures with Integer Constraints

inferredcites →https://doi.org/10.1007/978-3-642-17511-4_20openalex-snapshot

Dafny: An Automatic Program Verifier for Functional Correctness

inferredcites →https://doi.org/10.1007/978-3-642-23702-7_23openalex-snapshot

Satisfiability Modulo Recursive Programs

inferredcites →https://doi.org/10.1007/978-3-642-27940-9_21openalex-snapshot

Automating Induction with an SMT Solver

inferredcites →https://doi.org/10.1007/978-3-642-28717-6_7openalex-snapshot

Lazy Abstraction with Interpolants for Arrays

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-37036-6_8openalex-snapshot

Why3 — Where Programs Meet Provers

inferredcites →https://doi.org/10.1007/978-3-662-46081-8_5openalex-snapshot

Induction for SMT Solvers

inferredcites →https://doi.org/10.1007/978-3-662-48899-7_16openalex-snapshot

TIP: Tools for Inductive Provers

inferredcites →https://doi.org/10.1007/978-3-662-49122-5_2openalex-snapshot

Viper: A Verification Infrastructure for Permission-Based Reasoning

inferredcites →https://doi.org/10.1007/s10703-016-0249-4openalex-snapshot

SMT-based model checking for recursive programs

inferredcites →https://doi.org/10.1007/s10703-020-00349-xopenalex-snapshot

Learning inductive invariants by sampling from frequency distributions

inferredcites →https://doi.org/10.1007/s10817-016-9368-2openalex-snapshot

Reasoning About Algebraic Data Types with Abstractions

inferredcites →https://doi.org/10.1016/j.ic.2006.03.004openalex-snapshot

Decision procedures for term algebras with integer constraints

inferredcites →https://doi.org/10.1016/s0020-0190(00)00196-4openalex-snapshot

Annotation inference for modular checkers

inferredcites →https://doi.org/10.1017/s1471068418000157openalex-snapshot

Solving Horn Clauses on Inductive Data Types Without Induction

inferredcites →https://doi.org/10.1109/synasc.2017.00033openalex-snapshot

Deciding and Interpolating Algebraic Data Types by Reduction

inferredcites →https://doi.org/10.1145/1706299.1706325openalex-snapshot

Decision procedures for algebraic data types with abstractions

inferredcites →https://doi.org/10.1145/2254064.2254112openalex-snapshot

Synthesizing software verifiers from proof rules

inferredcites →https://doi.org/10.1145/2837614.2837664openalex-snapshot

Learning invariants using decision trees and implication counterexamples

inferredcites →https://doi.org/10.1145/3158098openalex-snapshot

Foundations for natural proofs and quantifier instantiation

inferredcites →https://doi.org/10.1145/3192366.3192416openalex-snapshot

A data-driven CHC solver

inferredcites →https://doi.org/10.1145/322203.322204openalex-snapshot

Reasoning About Recursively Defined Data Structures

inferredcites →https://doi.org/10.1145/3453483.3454055openalex-snapshot

Beyond the elementary representations of program invariants over algebraic data types

inferredcites →https://doi.org/10.23919/fmcad.2017.8102247openalex-snapshot

Sampling invariants from frequency distributions

inferredcites →https://doi.org/10.23919/fmcad.2018.8603013openalex-snapshot

The ELDARICA Horn Solver

inferredcites →https://doi.org/10.3233/sat190028openalex-snapshot

An Abstract Decision Procedure for a Theory of Inductive Data Types

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-031-13185-1_2openalex-snapshot

Program Verification with Constrained Horn Clauses (Invited Paper)

inferred← citeshttps://doi.org/10.1007/978-3-031-24841-2_9openalex-snapshot

Multiple Query Satisfiability of Constrained Horn Clauses

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-24950-1_5openalex-snapshot

Satisfiability Modulo Custom Theories in Z3

inferred← citeshttps://doi.org/10.1007/978-3-031-37709-9_14openalex-snapshot

Automatic Program Instrumentation for Automatic Verification

inferred← citeshttps://doi.org/10.1007/978-3-031-45784-5_4openalex-snapshot

Constrained Horn Clauses Satisfiability via Catamorphic Abstractions

inferred← citeshttps://doi.org/10.1007/978-3-031-66673-5_5openalex-snapshot

Model Refinement: Generating Refinements for Algorithm and System Design

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_28openalex-snapshot

Proving Functional Program Equivalence via Directed Lemma Synthesis

inferred← citeshttps://doi.org/10.1007/978-3-031-82700-6_9openalex-snapshot

Affine Disjunctive Invariant Generation with Farkas’ Lemma

inferred← citeshttps://doi.org/10.1007/978-3-031-90653-4_4openalex-snapshot

Unsatisfiability Proofs for Horn Solving

inferred← citeshttps://doi.org/10.1007/978-3-032-07106-4_13openalex-snapshot

Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types

inferred← citeshttps://doi.org/10.1007/978-3-032-10794-7_21openalex-snapshot

Quick Theory Exploration for Algebraic Data Types via Program Transformations

inferred← citeshttps://doi.org/10.1007/978-3-032-26220-2_6openalex-snapshot

Can LLM Aid in Solving Constraints with Inductive Definitions?

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/s10703-026-00493-wopenalex-snapshot

A program instrumentation framework for automatic verification

inferred← citeshttps://doi.org/10.1017/s1471068422000175openalex-snapshot

Verifying Catamorphism-Based Contracts using Constrained Horn Clauses

inferred← citeshttps://doi.org/10.1017/s147106842400019xopenalex-snapshot

Catamorphic Abstractions for Constrained Horn Clause Satisfiability

inferred← citeshttps://doi.org/10.1134/s0361768825700136openalex-snapshot

Automatic Inference of Synchronous Regular Invariants

inferred← citeshttps://doi.org/10.1145/3563354openalex-snapshot

Model-guided synthesis of inductive lemmas for FOL with least fixpoints

inferred← citeshttps://doi.org/10.1145/3656415openalex-snapshot

Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis

inferred← citeshttps://doi.org/10.1145/3704853openalex-snapshot

Axe ’Em: Eliminating Spurious States with Induction Axioms

inferred← citeshttps://doi.org/10.1609/aaai.v38i18.30032openalex-snapshot

Solving Satisfiability Modulo Counting for Symbolic and Statistical AI Integration with Provable Guarantees

inferred← citeshttps://doi.org/10.31144/candis.kond.2022.pp238openalex-snapshot

Методы комплексного подхода к автоматизации дедуктивной верификации программ с финитными итерациями

inferred← citeshttps://doi.org/10.4204/eptcs.373.3openalex-snapshot

Contract Strengthening through Constrained Horn Clause Verification

inferred← citeshttps://doi.org/10.4204/eptcs.373.5openalex-snapshot

CHC-COMP 2022: 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.