On the public citation graph
Complexity and information in invariant inference
0 signed · 71 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.1006/jcss.1996.0032openalex-snapshot
Oracles and Queries That Are Sufficient for Exact Learning
inferredcites →https://doi.org/10.1007/11817963_14openalex-snapshot
Lazy Abstraction with Interpolants
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/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_17openalex-snapshot
Interpolating Property Directed Reachability
inferredcites →https://doi.org/10.1007/978-3-319-52234-0_28openalex-snapshot
IC3 - Flipping the E in ICE
inferredcites →https://doi.org/10.1007/978-3-319-63387-9_13openalex-snapshot
Synthesis with Abstract Examples
inferredcites →https://doi.org/10.1007/978-3-319-89960-2_14openalex-snapshot
Accelerating Syntax-Guided Invariant Synthesis
inferredcites →https://doi.org/10.1007/978-3-319-96142-2_18openalex-snapshot
The Proof Complexity of SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_21openalex-snapshot
Symbolic Implementation of the Best Transformer
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_7openalex-snapshot
Constraint-Based Linear-Relations Analysis
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_1openalex-snapshot
Interpolation and SAT-Based Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_39openalex-snapshot
Linear Invariant Generation Using Non-linear Constraint Solving
inferredcites →https://doi.org/10.1007/978-3-642-02959-2_18openalex-snapshot
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-18275-4_7openalex-snapshot
SAT-Based Model Checking without Unrolling
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_11openalex-snapshot
Interpolants as Classifiers
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_22openalex-snapshot
Intertwined Forward-Backward Reachability Analysis Using Interpolants
inferredcites →https://doi.org/10.1007/978-3-642-37036-6_31openalex-snapshot
A Data Driven Approach for Algebraic Loop Invariants
inferredcites →https://doi.org/10.1007/978-3-642-54862-8_4openalex-snapshot
IC3 Modulo Theories via Implicit Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-662-46081-8_15openalex-snapshot
Property Directed Polyhedral Abstraction
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_10openalex-snapshot
Abstract Learning Frameworks for Synthesis
inferredcites →https://doi.org/10.1007/bf00116034openalex-snapshot
Negative Results for Equivalence Queries
inferredcites →https://doi.org/10.1007/s00236-017-0294-5openalex-snapshot
A theory of formal synthesis via inductive learning
inferredcites →https://doi.org/10.1007/s10009-012-0223-4openalex-snapshot
Template-based program verification and program synthesis
inferredcites →https://doi.org/10.1007/s10703-016-0248-5openalex-snapshot
From invariant checking to invariant inference using randomized search
inferredcites →https://doi.org/10.1016/0304-3975(85)90144-6openalex-snapshot
The intractability of resolution
inferredcites →https://doi.org/10.1016/j.artint.2010.10.002openalex-snapshot
On the power of clause-learning SAT solvers as resolution engines
inferredcites →https://doi.org/10.1016/j.entcs.2015.02.003openalex-snapshot
PostHat and All That: Automating Abstract Interpretation
inferredcites →https://doi.org/10.1109/32.908957openalex-snapshot
Dynamically discovering likely program invariants to support program evolution
inferredcites →https://doi.org/10.1109/fmcad.2009.5351148openalex-snapshot
Interpolation-sequence based model checking
inferredcites →https://doi.org/10.1109/synasc.2012.69openalex-snapshot
Synthesis from Examples: Interaction Models and Algorithms
inferredcites →https://doi.org/10.1145/1168857.1168907openalex-snapshot
Combinatorial sketching for finite programs
inferredcites →https://doi.org/10.1145/1390630.1390666openalex-snapshot
Dynamic inference of likely data preconditions over predicates by tree learning
inferredcites →https://doi.org/10.1145/1542476.1542501openalex-snapshot
Program verification using templates over predicate abstraction
inferredcites →https://doi.org/10.1145/1806799.1806833openalex-snapshot
Oracle-guided component-based program synthesis
inferredcites →https://doi.org/10.1145/2509136.2509511openalex-snapshot
Inductive invariant generation via abductive inference
inferredcites →https://doi.org/10.1145/2535838.2535843openalex-snapshot
Abstract acceleration of general linear loops
inferredcites →https://doi.org/10.1145/2837614.2837664openalex-snapshot
Learning invariants using decision trees and implication counterexamples
inferredcites →https://doi.org/10.1145/2908080.2908118openalex-snapshot
Ivy: safety verification by interactive generalization
inferredcites →https://doi.org/10.1145/3022187openalex-snapshot
Property-Directed Inference of Universal Invariants or Proving Their Absence
inferredcites →https://doi.org/10.1145/302405.302467openalex-snapshot
Dynamically discovering likely program invariants to support program evolution
inferredcites →https://doi.org/10.1145/3276501openalex-snapshot
Horn-ICE learning for synthesizing invariants and contracts
inferredcites →https://doi.org/10.1145/503272.503291openalex-snapshot
Predicate abstraction for software verification
inferredcites →https://doi.org/10.2168/lmcs-3(4:1)2007openalex-snapshot
Interpolant-Based Transition Relation Approximation
inferredcites →https://doi.org/10.4230/lipics.ecoop.2026.22openalex-snapshot
Interactive Program Synthesis
inferredcites →https://doi.org/10.48550/arxiv.1706.05070openalex-snapshot
Learning Disjunctions of Predicates
inferredcites →https://doi.org/10.5121/ijesa.2012.2204openalex-snapshot
Black Box and White Box Testing Techniques - A Literature Review
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-76384-8_9openalex-snapshot
On Symmetry and Quantification: A New Approach to Verify Distributed Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_14openalex-snapshot
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes
inferred← citeshttps://doi.org/10.1007/978-3-031-19135-0_1openalex-snapshot
SAT-Based Invariant Inference and Its Relation to Concept Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-22308-2_10openalex-snapshot
Invariant Inference with Provable Complexity from the Monotone Theory
inferred← citeshttps://doi.org/10.1007/s10703-023-00430-1openalex-snapshot
Machine learning and logic: a new frontier in artificial intelligence
inferred← citeshttps://doi.org/10.1007/s11334-022-00460-8openalex-snapshot
Regularity and quantification: a new approach to verify distributed protocols
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00142openalex-snapshot
Everything is Good for Something: Counterexample-Guided Directed Fuzzing via Likely Invariant Inference
inferred← citeshttps://doi.org/10.1145/3385412.3386018openalex-snapshot
First-order quantified separators
inferred← citeshttps://doi.org/10.1145/3434296openalex-snapshot
Learning the boundary of inductive invariants
inferred← citeshttps://doi.org/10.1145/3498676openalex-snapshot
Property-directed reachability as abstract interpretation in the monotone theory
inferred← citeshttps://doi.org/10.48550/arxiv.2004.03170openalex-snapshot
Decidability and Synthesis of Abstract Inductive Invariants
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.