On the public citation graph
The VLISP verified Scheme system
0 signed · 32 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.1007/bf00881906openalex-snapshot
IMPS: An interactive mathematical proof system
inferredcites →https://doi.org/10.1007/bf01128406openalex-snapshot
VLISP: A verified implementation of Scheme
inferredcites →https://doi.org/10.1007/bf01128408openalex-snapshot
The VLISP verified PreScheme compiler
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1109/ieeestd.1991.101032openalex-snapshot
IEEE Standard for the Scheme Programming Language
inferredcites →https://doi.org/10.1145/141471.141528openalex-snapshot
Proving the correctness of storage representations
inferredcites →https://doi.org/10.1145/582153.582179openalex-snapshot
Semantics-directed machine architecture
inferredcites →https://doi.org/10.1145/800055.802052openalex-snapshot
The scheme 311 compiler an exercise in denotational semantics
inferredcites →https://doi.org/10.2307/2274487openalex-snapshot
A partial functions version of Church's simple theory of types
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48092-7_11openalex-snapshot
Translation Validation: From SIGNAL to C
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_87openalex-snapshot
Three applications of formal methods at MITRE
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_49openalex-snapshot
Compiler correctness for concurrent languages
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_30openalex-snapshot
Using PVS to prove a Z refinement: A case study
inferred← citeshttps://doi.org/10.1007/978-1-4419-9359-5_8openalex-snapshot
Parameterized Program Equivalence Checking
inferred← citeshttps://doi.org/10.1007/978-1-4615-2339-0_1openalex-snapshot
VLISP: A Verified Implementation of Scheme
inferred← citeshttps://doi.org/10.1007/978-1-4615-2339-0_3openalex-snapshot
The VLISP Verified PreScheme Compiler
inferred← citeshttps://doi.org/10.1007/bf01128406openalex-snapshot
VLISP: A verified implementation of Scheme
inferred← citeshttps://doi.org/10.1007/bf01128408openalex-snapshot
The VLISP verified PreScheme compiler
inferred← citeshttps://doi.org/10.1007/bfb0058024openalex-snapshot
Compilation and equivalence of imperative objects
inferred← citeshttps://doi.org/10.1007/s10817-009-9155-4openalex-snapshot
A Formally Verified Compiler Back-end
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.022openalex-snapshot
Cobalt: A Language for Writing Provably-Sound Compiler Optimizations
inferred← citeshttps://doi.org/10.1017/s0956796899003482openalex-snapshot
Compilation and equivalence of imperative objects
inferred← citeshttps://doi.org/10.1145/1040305.1040335openalex-snapshot
Automated soundness proofs for dataflow analyses and transformations via local rules
inferred← citeshttps://doi.org/10.1145/1047659.1040335openalex-snapshot
Automated soundness proofs for dataflow analyses and transformations via local rules
inferred← citeshttps://doi.org/10.1145/224164.224193openalex-snapshot
Compiler correctness for parallel languages
inferred← citeshttps://doi.org/10.1145/263699.263755openalex-snapshot
Denotational semantics using an operationally-based term model
inferred← citeshttps://doi.org/10.1145/3779031.3779098openalex-snapshot
Brack: A Verified Compiler for Scheme via CakeML
inferred← citeshttps://doi.org/10.3745/kipsta.2011.18a.3.109openalex-snapshot
Compiler triggered C level error check
inferred← citeshttps://doi.org/10.7146/brics.v5i55.19500openalex-snapshot
Compilation and Equivalence of Imperative Objects (Revised Report)
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.