On the public citation graph

A Theory of Singly-Linked Lists and its Extensible Decision Procedure

0 signed · 60 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/10722010_8openalex-snapshot
Proving Pointer Programs in Hoare Logic
inferredcites →https://doi.org/10.1007/11513988_4openalex-snapshot
SMT-COMP: Satisfiability Modulo Theories Competition
inferredcites →https://doi.org/10.1007/11513988_47openalex-snapshot
Data Structure Specifications via Local Equality Axioms
inferredcites →https://doi.org/10.1007/11532231_8openalex-snapshot
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures
inferredcites →https://doi.org/10.1007/11559306_3openalex-snapshot
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic
inferredcites →https://doi.org/10.1007/11609773_14openalex-snapshot
A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs
inferredcites →https://doi.org/10.1007/11690634_7openalex-snapshot
A Logic of Reachable Patterns in Linked Data-Structures
inferredcites →https://doi.org/10.1007/11853886_16openalex-snapshot
Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies
inferredcites →https://doi.org/10.1007/3-540-36384-x_25openalex-snapshot
Shape Analysis through Predicate Abstraction and Model Checking
inferredcites →https://doi.org/10.1007/3-540-49099-x_2openalex-snapshot
A Decidable Logic for Describing Linked Data Structures
inferredcites →https://doi.org/10.1007/3-540-63166-6_9openalex-snapshot
An efficient decision procedure for the theory of fixed-sized bit-vectors
inferredcites →https://doi.org/10.1007/978-1-4471-4558-5openalex-snapshot
Logic and Structure
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_40openalex-snapshot
The UCLID Decision Procedure
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_49openalex-snapshot
CVC Lite: A New Implementation of the Cooperating Validity Checker
inferredcites →https://doi.org/10.1007/978-3-540-30227-8_53openalex-snapshot
Combining Decision Procedures for Sorted Theories
inferredcites →https://doi.org/10.1007/978-3-540-30538-5_9openalex-snapshot
A Decidable Fragment of Separation Logic
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_12openalex-snapshot
Shape Analysis by Predicate Abstraction
inferredcites →https://doi.org/10.1007/978-3-540-31980-1_21openalex-snapshot
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic
inferredcites →https://doi.org/10.1007/978-3-540-32275-7_4openalex-snapshot
Combining Lists with Non-stably Infinite Theories
inferredcites →https://doi.org/10.1007/s10817-004-6241-5openalex-snapshot
Model-Theoretic Methods in Combined Constraint Satisfiability
inferredcites →https://doi.org/10.1016/j.ic.2004.10.007openalex-snapshot
Proving pointer programs in higher-order logic
inferredcites →https://doi.org/10.1016/s0890-5401(03)00020-8openalex-snapshot
A rewriting approach to satisfiability procedures
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
inferredcites →https://doi.org/10.1109/lics.2002.1029817openalex-snapshot
Separation logic: a logic for shared mutable data structures
inferredcites →https://doi.org/10.1109/sefm.2003.1236224openalex-snapshot
Light-weight theorem proving for debugging and verifying units of code
inferredcites →https://doi.org/10.1145/1111037.1111048openalex-snapshot
Verifying properties of well-founded linked lists
inferredcites →https://doi.org/10.1145/258915.258936openalex-snapshot
Automatic verification of pointer programs using monadic second-order logic
inferredcites →https://doi.org/10.1145/258916.258936openalex-snapshot
Automatic verification of pointer programs using monadic second-order logic
inferredcites →https://doi.org/10.1145/322203.322204openalex-snapshot
Reasoning About Recursively Defined Data Structures
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/567067.567073openalex-snapshot
Verifying reachability invariants of linked structures

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-98668-0_2openalex-snapshot
Automated Verification of Monotonic Data Structure Traversals in C
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_23openalex-snapshot
Formal Verification of Skiplists with Arbitrary Many Levels
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_26openalex-snapshot
The Effects of Adding Reachability Predicates in Propositional Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-69738-1_8openalex-snapshot
An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_18openalex-snapshot
Verifying Heap-Manipulating Programs in an SMT Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_25openalex-snapshot
Semi-persistent Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_24openalex-snapshot
On the Almighty Wand
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_13openalex-snapshot
Linear Functional Fixed-points
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_7openalex-snapshot
Decision Procedures for the Temporal Verification of Concurrent Lists
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_25openalex-snapshot
A Theory of Skiplists with Applications to the Verification of Concurrent Datatypes
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_8openalex-snapshot
Efficient Decision Procedures for Heaps Using STRAND
inferred← citeshttps://doi.org/10.1016/j.ic.2011.12.003openalex-snapshot
On the almighty wand
inferred← citeshttps://doi.org/10.1093/logcom/exab016openalex-snapshot
Internal proof calculi for modal logics with separating conjunction
inferred← citeshttps://doi.org/10.1145/1328438.1328461openalex-snapshot
Back to the future
inferred← citeshttps://doi.org/10.1145/1328897.1328461openalex-snapshot
Back to the future
inferred← citeshttps://doi.org/10.1145/1925844.1926455openalex-snapshot
Decidable logics combining heap structures and data
inferred← citeshttps://doi.org/10.1145/1926385.1926455openalex-snapshot
Decidable logics combining heap structures and data
inferred← citeshttps://doi.org/10.1145/2103621.2103673openalex-snapshot
Recursive proofs for inductive tree data-structures
inferred← citeshttps://doi.org/10.1145/2103656.2103673openalex-snapshot
Recursive proofs for inductive tree data-structures
inferred← citeshttps://doi.org/10.1145/2491956.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferred← citeshttps://doi.org/10.1145/2499370.2462169openalex-snapshot
Natural proofs for structure, data, and separation
inferred← citeshttps://doi.org/10.1145/2737924.2737984openalex-snapshot
Automatic induction proofs of data-structures in imperative programs
inferred← citeshttps://doi.org/10.1145/2813885.2737984openalex-snapshot
Automatic induction proofs of data-structures in imperative programs
inferred← citeshttps://doi.org/10.1145/3428229openalex-snapshot
Towards a unified proof framework for automated fixpoint reasoning using matching logic
inferred← citeshttps://doi.org/10.1145/3448269openalex-snapshot
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic
inferred← citeshttps://doi.org/10.14288/1.0052017openalex-snapshot
Modular verification of shared-memory concurrent system software
inferred← citeshttps://doi.org/10.48550/arxiv.1301.4372openalex-snapshot
A Decidable Theory of Skiplists of Unbounded Size and Arbitrary Height
inferred← citeshttps://doi.org/10.48550/arxiv.1407.6124openalex-snapshot
Automating Proofs of Data-Structure Properties in Imperative Programs
inferred← citeshttps://doi.org/10.70675/528cca31zda00z495bz9f43zfaa093704541openalex-snapshot
Separation logic : expressiveness, complexity, temporal extension
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.