On the public citation graph

VLISP: A verified implementation of Scheme

0 signed · 75 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/3-540-55602-8_181openalex-snapshot

Automated correctness proofs of machine code programs for a commercial microprocessor

inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_8openalex-snapshot

Towards Fully Abstract Semantics for Local Variables: Preliminary Report

inferredcites →https://doi.org/10.1007/978-1-4612-5983-1openalex-snapshot

The Science of Programming

inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot

Fundamental Properties of Infinite Trees

inferredcites →https://doi.org/10.1007/bf01018614openalex-snapshot

A tractable Scheme implementation

inferredcites →https://doi.org/10.1007/bf01128407openalex-snapshot

The VLISP verified Scheme system

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/0304-3975(77)90044-5openalex-snapshot

LCF considered as a programming language

inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot

Fundamental properties of infinite trees

inferredcites →https://doi.org/10.1109/ieeestd.1991.101032openalex-snapshot

IEEE Standard for the Scheme Programming Language

inferredcites →https://doi.org/10.1145/13310.13333openalex-snapshot

ORBIT: an optimizing compiler for scheme

inferredcites →https://doi.org/10.1145/141471.141528openalex-snapshot

Proving the correctness of storage representations

inferredcites →https://doi.org/10.1145/382130.382133openalex-snapshot

Revised 4 report on the algorithmic language scheme

inferredcites →https://doi.org/10.1145/582153.582179openalex-snapshot

Semantics-directed machine architecture

inferredcites →https://doi.org/10.1145/73560.73577openalex-snapshot

Towards fully abstract semantics for local variables

inferredcites →https://doi.org/10.1145/75277.75302openalex-snapshot

Realistic compilation by program transformation (detailed summary)

inferredcites →https://doi.org/10.1145/800017.800536openalex-snapshot

The semantics of local storage, or what makes the free-list free?(Preliminary Report)

inferredcites →https://doi.org/10.1145/800055.802052openalex-snapshot

The scheme 311 compiler an exercise in denotational semantics

inferredcites →https://doi.org/10.2307/2005154openalex-snapshot

Report on the Algorithmic Language

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11823230_20openalex-snapshot

Certificate Translation for Optimizing Compilers

inferred← citeshttps://doi.org/10.1007/3-540-44798-9_1openalex-snapshot

View from the Fringe of the Fringe

inferred← citeshttps://doi.org/10.1007/3-540-45245-1_15openalex-snapshot

Automatic Validation of Code-Improving Transformations

inferred← citeshttps://doi.org/10.1007/3-540-46425-5_19openalex-snapshot

On the Translation of Procedures to Finite Machines

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-48092-7_12openalex-snapshot

Compilation and Synthesis for Real-Time Embedded Controllers

inferred← citeshttps://doi.org/10.1007/3-540-48118-4_9openalex-snapshot

On excusable and inexcusable failures towards an adequate notion of translation correctness

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-60675-0_49openalex-snapshot

Compiler construction using scheme

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_2openalex-snapshot

The VLISP Verified Scheme System

inferred← citeshttps://doi.org/10.1007/978-1-4615-2339-0_3openalex-snapshot

The VLISP Verified PreScheme Compiler

inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_20openalex-snapshot

Cryptographic Protocol Analysis and Compilation Using CPSA and Roletran

inferred← citeshttps://doi.org/10.1007/978-3-030-91631-2_22openalex-snapshot

Prototyping Formal Methods Tools: A Protocol Analysis Case Study

inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_15openalex-snapshot

Partial Translation Verification for Untrusted Code-Generators

inferred← citeshttps://doi.org/10.1007/978-3-642-00722-4_2openalex-snapshot

Extensible Proof-Producing Compilation

inferred← citeshttps://doi.org/10.1007/978-3-642-03359-9_25openalex-snapshot

Verified LISP Implementations on ARM, x86 and PowerPC

inferred← citeshttps://doi.org/10.1007/978-3-642-15057-9_10openalex-snapshot

Reusable Verification of a Copying Collector

inferred← citeshttps://doi.org/10.1007/978-3-642-22863-6_20openalex-snapshot

A Verified Runtime for a Verified Theorem Prover

inferred← citeshttps://doi.org/10.1007/978-3-642-60831-5_7openalex-snapshot

Deduction as a Cross-Sectional Technology The DFG Focus Programme on Deduction

inferred← citeshttps://doi.org/10.1007/bf01128407openalex-snapshot

The VLISP verified Scheme system

inferred← citeshttps://doi.org/10.1007/bf01128408openalex-snapshot

The VLISP verified PreScheme compiler

inferred← citeshttps://doi.org/10.1007/s10990-013-9091-1openalex-snapshot

The Racket virtual machine and randomized testing

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.02.043openalex-snapshot

Machine-Checkable Correctness Proofs for Intra-procedural Dataflow Analyses

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.1016/j.scico.2004.03.008openalex-snapshot

Automatic validation of code-improving transformations on low-level program representations

inferred← citeshttps://doi.org/10.1023/a:1006151910336openalex-snapshot

The Tail-Recursive SECD Machine

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/1250734.1250742openalex-snapshot

A certified type-preserving compiler from lambda calculus to assembly language

inferred← citeshttps://doi.org/10.1145/1273442.1250742openalex-snapshot

A certified type-preserving compiler from lambda calculus to assembly language

inferred← citeshttps://doi.org/10.1145/1273920.1273922openalex-snapshot

Formalizing and verifying semantic type soundness of a simple compiler

inferred← citeshttps://doi.org/10.1145/1377492.1377499openalex-snapshot

Local reasoning about a copying garbage collector

inferred← citeshttps://doi.org/10.1145/1538917.1538919openalex-snapshot

Certificate translation for optimizing compilers

inferred← citeshttps://doi.org/10.1145/1542476.1542513openalex-snapshot

Proving optimizations correct using parameterized program equivalence

inferred← citeshttps://doi.org/10.1145/1543135.1542513openalex-snapshot

Proving optimizations correct using parameterized program equivalence

inferred← citeshttps://doi.org/10.1145/1596550.1596567openalex-snapshot

Biorthogonality, step-indexing and compiler correctness

inferred← citeshttps://doi.org/10.1145/1631687.1596567openalex-snapshot

Biorthogonality, step-indexing and compiler correctness

inferred← citeshttps://doi.org/10.1145/2535838.2535841openalex-snapshot

CakeML

inferred← citeshttps://doi.org/10.1145/2578855.2535841openalex-snapshot

CakeML

inferred← citeshttps://doi.org/10.1145/268084.268181openalex-snapshot

Compiling

inferred← citeshttps://doi.org/10.1145/268085.268181openalex-snapshot

Compiling

inferred← citeshttps://doi.org/10.1145/277650.277719openalex-snapshot

Proper tail recursion and space efficiency

inferred← citeshttps://doi.org/10.1145/277650.277752openalex-snapshot

The design and implementation of a certifying compiler

inferred← citeshttps://doi.org/10.1145/277652.277719openalex-snapshot

Proper tail recursion and space efficiency

inferred← citeshttps://doi.org/10.1145/277652.277752openalex-snapshot

The design and implementation of a certifying compiler

inferred← citeshttps://doi.org/10.1145/3437992.3439915openalex-snapshot

A minimalistic verified bootstrapped compiler (proof pearl)

inferred← citeshttps://doi.org/10.1145/3437992.3439929openalex-snapshot

Towards formally verified compilation of tag-based policy enforcement

inferred← citeshttps://doi.org/10.1145/382109.382668openalex-snapshot

Scheme

inferred← citeshttps://doi.org/10.1145/503112.503115openalex-snapshot

Formalizing the safety of Java, the Java virtual machine, and Java card

inferred← citeshttps://doi.org/10.1145/780822.781156openalex-snapshot

Automatically proving the correctness of compiler optimizations

inferred← citeshttps://doi.org/10.1145/781131.781156openalex-snapshot

Automatically proving the correctness of compiler optimizations

inferred← citeshttps://doi.org/10.1145/952532.952666openalex-snapshot

Validation of code-improving transformations for embeded systems

inferred← citeshttps://doi.org/10.1145/989393.989454openalex-snapshot

The design and implementation of a certifying compiler

inferred← citeshttps://doi.org/10.3745/kipsta.2011.18a.3.109openalex-snapshot

Compiler triggered C level error check

inferred← citeshttps://doi.org/10.48456/tr-765openalex-snapshot

Formal verification of machine-code programs

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.