On the public citation graph

Axe ’Em: Eliminating Spurious States with Induction Axioms

https://doi.org/10.1145/3704853
0 signed · 52 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/10930755_5openalex-snapshot
Complete Integer Decision Procedures as Derived Rules in HOL
inferredcites →https://doi.org/10.1007/3-540-48660-7_26openalex-snapshot
Vampire
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_1openalex-snapshot
On a Problem of Formal Logic
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-030-17465-1_18openalex-snapshot
Effective Entailment Checking for Separation Logic with Inductive Definitions
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-79876-5_21openalex-snapshot
Integer Induction in Saturation
inferredcites →https://doi.org/10.1007/978-3-030-99524-9_24openalex-snapshot
cvc5: A Versatile and Industrial-Strength SMT Solver
inferredcites →https://doi.org/10.1007/978-3-031-10769-6_9openalex-snapshot
Reasoning About Vectors Using an SMT Theory of Sequences
inferredcites →https://doi.org/10.1007/978-3-031-24950-1_16openalex-snapshot
Solving Constrained Horn Clauses over Algebraic Data Types
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-66263-3_22openalex-snapshot
Theory Refinement for Program Verification
inferredcites →https://doi.org/10.1007/978-3-319-99725-4_4openalex-snapshot
Deductive Verification in Decidable Fragments with Ivy
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-17511-4_20openalex-snapshot
Dafny: An Automatic Program Verifier for Functional Correctness
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-38574-2_27openalex-snapshot
Automating Inductive Proofs Using Theory Exploration
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_53openalex-snapshot
Effectively-Propositional Reasoning about Reachability in Linked Data Structures
inferredcites →https://doi.org/10.1007/978-3-642-40885-4_14openalex-snapshot
Obtaining Finite Local Theory Axiomatizations via Saturation
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.1007/bf02759780openalex-snapshot
Decidability of a portion of the predicate calculus
inferredcites →https://doi.org/10.1007/bfb0030541openalex-snapshot
Isabelle
inferredcites →https://doi.org/10.1016/0022-0000(80)90027-6openalex-snapshot
Complexity results for classes of quantificational formulas
inferredcites →https://doi.org/10.1016/b978-0-7204-2233-7.50001-0openalex-snapshot
STUDIES IN LOGIC AND THE FOUNDATIONS OF MATHEMATICS
inferredcites →https://doi.org/10.1017/bsl.2024.53openalex-snapshot
A NOTE ON THE THEORY OF WELL ORDERS
inferredcites →https://doi.org/10.1109/fmcad.2015.7542257openalex-snapshot
Compositional verification of procedural programs using horn clauses over integers and arrays
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1145/1111037.1111048openalex-snapshot
Verifying properties of well-founded linked lists
inferredcites →https://doi.org/10.1145/1328438.1328461openalex-snapshot
Back to the future
inferredcites →https://doi.org/10.1145/2535838.2535854openalex-snapshot
Modular reasoning about heap paths via effectively propositional formulas
inferredcites →https://doi.org/10.1145/2594291.2594317openalex-snapshot
VeriCon
inferredcites →https://doi.org/10.1145/2603088.2603091openalex-snapshot
A decision procedure for satisfiability in separation logic with inductive predicates
inferredcites →https://doi.org/10.1145/279227.279229openalex-snapshot
The part-time parliament
inferredcites →https://doi.org/10.1145/3140568openalex-snapshot
Paxos made EPR: decidable reasoning about distributed protocols
inferredcites →https://doi.org/10.1145/3158098openalex-snapshot
Foundations for natural proofs and quantifier instantiation
inferredcites →https://doi.org/10.1145/3192366.3192414openalex-snapshot
Modularity for decidability of deductive verification with applications to distributed systems
inferredcites →https://doi.org/10.1145/3428229openalex-snapshot
Towards a unified proof framework for automated fixpoint reasoning using matching logic
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/3563354openalex-snapshot
Model-guided synthesis of inductive lemmas for FOL with least fixpoints
inferredcites →https://doi.org/10.1145/361179.361202openalex-snapshot
Self-stabilizing systems in spite of distributed control
inferredcites →https://doi.org/10.1145/3632875openalex-snapshot
An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification
inferredcites →https://doi.org/10.1145/3704853openalex-snapshot
Axe ’Em: Eliminating Spurious States with Induction Axioms
inferredcites →https://doi.org/10.2307/1995086openalex-snapshot
Decidability of Second-Order Theories and Automata on Infinite Trees
inferredcites →https://doi.org/10.2307/2271090openalex-snapshot
Definability in the monadic second-order theory of successor
inferredcites →https://doi.org/10.4204/eptcs.337.4openalex-snapshot
Automating Induction by Reflection
inferredcites →https://doi.org/10.4230/lipics.mfcs.2019.17openalex-snapshot
Finite Satisfiability of Unary Negation Fragment with Transitivity
inferredcites →https://doi.org/10.48550/arxiv.2401.16233openalex-snapshot
Incremental Proof Development in Dafny with Module-Based Induction
inferredcites →https://doi.org/10.48550/arxiv.2408.10685openalex-snapshot
Proving Cutoff Bounds for Safety Properties in First-Order Logic
inferredcites →https://doi.org/10.5281/zenodo.1003420openalex-snapshot
The Coq Proof Assistant
inferredcites →https://doi.org/10.5281/zenodo.13912208openalex-snapshot
Axe 'Em: Eliminating Spurious States with Induction Axioms (Artifact)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← backgroundhttps://doi.org/10.5281/zenodo.14092340zenodo-depositor-declared
showing the first 1 of 2 · page through all 2
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.