On the public citation graph

Deciding memory safety for single-pass heap-manipulating programs

https://doi.org/10.1145/3371103
0 signed · 38 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/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_2openalex-snapshot
Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-45099-3_7openalex-snapshot
Checking Cleanness in Linked Lists
inferredcites →https://doi.org/10.1007/978-3-642-03237-0_22openalex-snapshot
Invariant Checking for Programs with Procedure Calls
inferredcites →https://doi.org/10.1007/978-3-642-39799-8_54openalex-snapshot
Automating Separation Logic Using SMT
inferredcites →https://doi.org/10.1109/iccd.2017.112openalex-snapshot
Efficient Tagged Memory
inferredcites →https://doi.org/10.1109/sp.2013.13openalex-snapshot
SoK: Eternal War in Memory
inferredcites →https://doi.org/10.1109/sp.2015.9openalex-snapshot
CHERI: A Hybrid Capability-System Architecture for Scalable Software Compartmentalization
inferredcites →https://doi.org/10.1145/1065887.1065892openalex-snapshot
CCured: type-safe retrofitting of legacy software
inferredcites →https://doi.org/10.1145/1250734.1250746openalex-snapshot
Valgrind
inferredcites →https://doi.org/10.1145/1294261.1294295openalex-snapshot
Secure virtual architecture
inferredcites →https://doi.org/10.1145/178243.178446openalex-snapshot
Efficient detection of all pointer and array access errors
inferredcites →https://doi.org/10.1145/1925844.1926454openalex-snapshot
Streaming transducers for algorithmic verification of single-pass list-processing programs
inferredcites →https://doi.org/10.1145/1993498.1993563openalex-snapshot
Separation logic + superposition calculus = heap theorem prover
inferredcites →https://doi.org/10.1145/2049697.2049700openalex-snapshot
Compositional Shape Analysis by Means of Bi-Abduction
inferredcites →https://doi.org/10.1145/2663171.2663188openalex-snapshot
The rust language
inferredcites →https://doi.org/10.1145/292540.292552openalex-snapshot
Parametric shape analysis via 3-valued logic
inferredcites →https://doi.org/10.1145/3224423openalex-snapshot
Intel MPX Explained: A Cross-layer Analysis of the Intel MPX System Stack
inferredcites →https://doi.org/10.1145/3290359openalex-snapshot
Decidable verification of uninterpreted programs
inferredcites →https://doi.org/10.1145/360204.360206openalex-snapshot
Verifying safety properties of concurrent Java programs using 3-valued logic
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/378795.378846openalex-snapshot
Automatic predicate abstraction of C programs
inferredcites →https://doi.org/10.1145/378795.378851openalex-snapshot
The pointer assertion logic engine
inferredcites →https://doi.org/10.1145/503272.503286openalex-snapshot
CCured
inferredcites →https://doi.org/10.1145/781131.781157openalex-snapshot
CCured in the real world
inferredcites →https://doi.org/10.4230/lipics.snapl.2015.190openalex-snapshot
Everything You Want to Know About Pointer-Based Checking

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-45237-7_10openalex-snapshot
What’s Decidable About Program Verification Modulo Axioms?
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_14openalex-snapshot
Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-53291-8_32openalex-snapshot
Decidable Synthesis of Programs with Uninterpreted Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_29openalex-snapshot
Trace Abstraction-Based Verification for Uninterpreted Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-10363-6_10openalex-snapshot
Collaborative Verification of Uninterpreted Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_1openalex-snapshot
Verifying Tree-Manipulating Programs via CHCs
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.1016/j.scico.2023.103075openalex-snapshot
Verification of message-passing uninterpreted programs
inferred← citeshttps://doi.org/10.1145/3589250.3596143openalex-snapshot
Completeness Thresholds for Memory Safety of Array Traversing Programs
inferred← citeshttps://doi.org/10.1145/3704870openalex-snapshot
The Decision Problem for Regular First Order Theories
inferred← citeshttps://doi.org/10.1145/3839461openalex-snapshot
EUFⁿ: A Decidable Extension to the Theory of Equality with Uninterpreted Functions
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.