On the public citation graph

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

https://doi.org/10.1145/3563354
0 signed · 67 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_33openalex-snapshot
Syntactic Program Transformations for Automatic Abstraction
inferredcites →https://doi.org/10.1007/3-540-68804-8openalex-snapshot
Finite Model Theory and Its Applications
inferredcites →https://doi.org/10.1007/978-1-4615-4449-4openalex-snapshot
Computer-Aided Reasoning
inferredcites →https://doi.org/10.1007/978-3-030-17502-3_8openalex-snapshot
SL-COMP: Competition of Solvers for Separation Logic
inferredcites →https://doi.org/10.1007/978-3-030-23250-4_9openalex-snapshot
Lemma Discovery for Induction
inferredcites →https://doi.org/10.1007/978-3-030-25543-5_5openalex-snapshot
cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis
inferredcites →https://doi.org/10.1007/978-3-030-30048-7_35openalex-snapshot
Lemma Synthesis for Automating Induction over Algebraic Data Types
inferredcites →https://doi.org/10.1007/978-3-030-44914-8_19openalex-snapshot
A First-Order Logic with Frames
inferredcites →https://doi.org/10.1007/978-3-030-51054-1_30openalex-snapshot
The Imandra Automated Reasoning System (System Description)
inferredcites →https://doi.org/10.1007/978-3-030-53518-6_8openalex-snapshot
Induction with Generalization in Superposition Reasoning
inferredcites →https://doi.org/10.1007/978-3-030-67067-2_15openalex-snapshot
Syntax-Guided Synthesis for Lemma Generation in Hardware Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_5openalex-snapshot
ICE: A Robust Framework for Learning Invariants
inferredcites →https://doi.org/10.1007/978-3-319-48989-6_40openalex-snapshot
Automated Mutual Explicit Induction Proof in Separation Logic
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_26openalex-snapshot
A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic
inferredcites →https://doi.org/10.1007/978-3-319-66167-4_10openalex-snapshot
Superposition with Structural Induction
inferredcites →https://doi.org/10.1007/978-3-319-89960-2_13openalex-snapshot
Invariant Synthesis for Incomplete Verification Engines
inferredcites →https://doi.org/10.1007/978-3-540-31982-5_25openalex-snapshot
From Separation Logic to First-Order Logic
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_34openalex-snapshot
Enhancing Program Verification with Lemmas
inferredcites →https://doi.org/10.1007/978-3-540-74113-8openalex-snapshot
The Calculus of Computation: Decision Procedures with Applications to Verification
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_25openalex-snapshot
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
inferredcites →https://doi.org/10.1007/978-3-642-20398-5_4openalex-snapshot
VeriFast: A Powerful, Sound, Predictable, Fast Verifier for C and Java
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_14openalex-snapshot
CVC4
inferredcites →https://doi.org/10.1007/978-3-642-22438-6_12openalex-snapshot
Automated Cyclic Entailment Proofs in Separation Logic
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_28openalex-snapshot
E-Matching with Free Variables
inferredcites →https://doi.org/10.1007/978-3-642-28756-5_28openalex-snapshot
Zeno: An Automated Prover for Properties of Recursive Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-38574-2_27openalex-snapshot
Automating Inductive Proofs Using Theory Exploration
inferredcites →https://doi.org/10.1007/978-3-662-07003-1openalex-snapshot
Elements of Finite Model Theory
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-54577-5_5openalex-snapshot
Bounded Quantifier Instantiation for Checking Inductive Invariants
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1016/c2009-0-22107-6openalex-snapshot
A Mathematical Introduction to Logic
inferredcites →https://doi.org/10.1109/32.588534openalex-snapshot
An industrial strength theorem prover for a logic based on Common Lisp
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/1250734.1250754openalex-snapshot
Sketching stencils
inferredcites →https://doi.org/10.1145/1706299.1706325openalex-snapshot
Decision procedures for algebraic data types with abstractions
inferredcites →https://doi.org/10.1145/2103656.2103673openalex-snapshot
Recursive proofs for inductive tree data-structures
inferredcites →https://doi.org/10.1145/2491956.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferredcites →https://doi.org/10.1145/2594291.2594325openalex-snapshot
Natural proofs for data structure manipulation in C using separation logic
inferredcites →https://doi.org/10.1145/2737924.2737984openalex-snapshot
Automatic induction proofs of data-structures in imperative programs
inferredcites →https://doi.org/10.1145/3009837.3009887openalex-snapshot
Coming to terms with quantified reasoning
inferredcites →https://doi.org/10.1145/3158097openalex-snapshot
Automated lemma synthesis in symbolic-heap separation logic
inferredcites →https://doi.org/10.1145/3158098openalex-snapshot
Foundations for natural proofs and quantifier instantiation
inferredcites →https://doi.org/10.1145/3208071openalex-snapshot
Search-based program synthesis
inferredcites →https://doi.org/10.1145/3385412.3386018openalex-snapshot
First-order quantified separators
inferredcites →https://doi.org/10.1145/3498671openalex-snapshot
Learning formulas in finite variable logics
inferredcites →https://doi.org/10.1145/3498722openalex-snapshot
Solving constrained Horn clauses modulo algebraic data types and recursive functions
inferredcites →https://doi.org/10.1145/3554331openalex-snapshot
Artifact for OOPSLA 2022 Article Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/503272.503274openalex-snapshot
The S LAM project
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications
inferredcites →https://doi.org/10.29007/jmd3openalex-snapshot
Conflicts, Models and Heuristics for Quantifier Instantiation in SMT
inferredcites →https://doi.org/10.3233/978-1-61499-495-4-1openalex-snapshot
Syntax-Guided Synthesis
inferredcites →https://doi.org/10.48550/arxiv.1904.03241openalex-snapshot
HOList: An Environment for Machine Learning of Higher-Order Theorem Proving

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-65630-9_5openalex-snapshot
Efficient Implementation of an Abstract Domain of Quantified First-Order Formulas
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-78709-6_7openalex-snapshot
Proving Cutoff Bounds for Safety Properties in First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_1openalex-snapshot
Verifying Tree-Manipulating Programs via CHCs
inferred← citeshttps://doi.org/10.1145/3583057openalex-snapshot
A First-order Logic with Frames
inferred← citeshttps://doi.org/10.1145/3622835openalex-snapshot
Complete First-Order Reasoning for Properties of Functional Programs
inferred← citeshttps://doi.org/10.1145/3632875openalex-snapshot
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
inferred← citeshttps://doi.org/10.1145/3656450openalex-snapshot
Predictable Verification using Intrinsic Definitions
inferred← citeshttps://doi.org/10.1145/3674653openalex-snapshot
CCLemma: E-Graph Guided Lemma Discovery for Inductive Equational Proofs
inferred← citeshttps://doi.org/10.1145/3704853openalex-snapshot
Axe ’Em: Eliminating Spurious States with Induction Axioms
inferred← citeshttps://doi.org/10.1145/3720447openalex-snapshot
FO-Complete Program Verification for Heap Logics
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.