On the public citation graph

Steel: proof-oriented programming in a dependently typed concurrent separation logic

https://doi.org/10.1145/3473590
0 signed · 46 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/11804192_6openalex-snapshot
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
inferredcites →https://doi.org/10.1007/978-3-030-17184-1_2openalex-snapshot
Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_36openalex-snapshot
Scalable Shape Analysis for Systems Code
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-03829-7_7openalex-snapshot
Verification of Concurrent Programs with Chalice
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-662-49122-5_2openalex-snapshot
Viper: A Verification Infrastructure for Permission-Based Reasoning
inferredcites →https://doi.org/10.1017/s0956796808006953openalex-snapshot
Hoare type theory, polymorphism and separation
inferredcites →https://doi.org/10.1017/s0956796818000151openalex-snapshot
Iris from the ground up: A modular foundation for higher-order concurrent separation logic
inferredcites →https://doi.org/10.1145/1993498.1993526openalex-snapshot
Mostly-automated verification of low-level programs in computational separation logic
inferredcites →https://doi.org/10.1145/2034773.2034828openalex-snapshot
Characteristic formulae for the verification of imperative programs
inferredcites →https://doi.org/10.1145/2429069.2429131openalex-snapshot
The ramifications of sharing in data structures
inferredcites →https://doi.org/10.1145/2480359.2429131openalex-snapshot
The ramifications of sharing in data structures
inferredcites →https://doi.org/10.1145/248052.248106openalex-snapshot
Simple, fast, and practical non-blocking and blocking concurrent queue algorithms
inferredcites →https://doi.org/10.1145/2491956.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2499370.2491978openalex-snapshot
Verifying higher-order programs with the dijkstra monad
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/2914770.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/3110278openalex-snapshot
A metaprogramming framework for formal verification
inferredcites →https://doi.org/10.1145/3360587openalex-snapshot
Specifying concurrent programs in separation logic: morphisms and simulations
inferredcites →https://doi.org/10.1145/3371074openalex-snapshot
Actris: session-type based reasoning in separation logic
inferredcites →https://doi.org/10.1145/3409003openalex-snapshot
SteelCore: an extensible concurrent separation logic for effectful dependently typed programs
inferredcites →https://doi.org/10.1145/3437992.3439930openalex-snapshot
Contextual refinement of the Michael-Scott queue (proof pearl)
inferredcites →https://doi.org/10.1145/3453483.3454036openalex-snapshot
RefinedC: automating the foundational verification of C code with refined ownership types
inferredcites →https://doi.org/10.1145/357073.357079openalex-snapshot
Simplification by Cooperating Decision Procedures
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/36330.36332openalex-snapshot
Matching, unification and complexity
inferredcites →https://doi.org/10.2168/lmcs-8(3:1)2012openalex-snapshot
The Relationship Between Separation Logic and Implicit Dynamic Frames

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-50521-8_11openalex-snapshot
Borrowable Fractional Ownership Types for Verification
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_18openalex-snapshot
Verification Algorithms for Automated Separation Logic Verifiers
inferred← citeshttps://doi.org/10.1007/978-3-031-98668-0_4openalex-snapshot
Raven: An SMT-Based Concurrency Verifier
inferred← citeshttps://doi.org/10.1007/s10817-025-09721-0openalex-snapshot
A Mechanically Verified Garbage Collector for OCaml
inferred← citeshttps://doi.org/10.1145/3497775.3503677openalex-snapshot
Specification and verification of a transient stack
inferred← citeshttps://doi.org/10.1145/3519939.3523432openalex-snapshot
Diaframe: automated verification of fine-grained concurrent programs in Iris
inferred← citeshttps://doi.org/10.1145/3547631openalex-snapshot
Later credits: resourceful reasoning for the later modality
inferred← citeshttps://doi.org/10.1145/3586037openalex-snapshot
Verus: Verifying Rust Programs using Linear Ghost Types
inferred← citeshttps://doi.org/10.1145/3586054openalex-snapshot
Verification-Preserving Inlining in Automatic Separation Logic Verifiers
inferred← citeshttps://doi.org/10.1145/3607844openalex-snapshot
Modularity, Code Specialization, and Zero-Cost Abstractions for Program Verification
inferred← citeshttps://doi.org/10.1145/3632916openalex-snapshot
Securing Verified IO Programs Against Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3656433openalex-snapshot
A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata
inferred← citeshttps://doi.org/10.1145/3689773openalex-snapshot
StarMalloc: Verifying a Modern, Hardened Memory Allocator
inferred← citeshttps://doi.org/10.1145/3704856openalex-snapshot
Formal Foundations for Translational Separation Logic Verifiers
inferred← citeshttps://doi.org/10.1145/3747522openalex-snapshot
SecRef*: Securely Sharing Mutable References between Verified and Unverified Code in F*
inferred← citeshttps://doi.org/10.1145/3779031.3779095openalex-snapshot
Building Blocks for Step-Indexed Program Logics
inferred← citeshttps://doi.org/10.1145/3808325openalex-snapshot
VerusBelt: A Semantic Foundation for Verus’s Proof-Oriented Extensions to the Rust Type System
inferred← citeshttps://doi.org/10.70675/95fceee8z06bbz48ccz8b06z87fb9e672ea8openalex-snapshot
Proof-oriented domain-specific language design for high-assurance software
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.