On the public citation graph

A mechanically verified code generator

0 signed · 77 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-94-011-1793-7_2openalex-snapshot
Towards a Mathematical Science of Computation
inferredcites →https://doi.org/10.1007/bf00243133openalex-snapshot
A mechanically verified language implementation
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1090/psapm/019/0242403openalex-snapshot
Correctness of a compiler for arithmetic expressions
inferredcites →https://doi.org/10.1093/comjnl/12.1.41openalex-snapshot
Proving Properties of Programs by Structural Induction
inferredcites →https://doi.org/10.1109/32.41331openalex-snapshot
Kit: a study in operating system verification
inferredcites →https://doi.org/10.1145/390016.808428openalex-snapshot
An approach to compiler correctness
inferredcites →https://doi.org/10.21236/ada052911openalex-snapshot
Interactive Compiler Proving Using Hoare Proof Rules

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11560548_23openalex-snapshot
On the Verification of Memory Management Mechanisms
inferred← citeshttps://doi.org/10.1007/3-540-45620-1_5openalex-snapshot
Formal Verification of a Java Compiler in Isabelle
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_75openalex-snapshot
A theorem prover for a computational logic
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_25openalex-snapshot
A provably correct compiler generator
inferred← citeshttps://doi.org/10.1007/3-540-55984-1_14openalex-snapshot
Provably correct compiler development and implementation
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_22openalex-snapshot
A mechanically verified application for a mechanically verified environment
inferred← citeshttps://doi.org/10.1007/3-540-57826-9_123openalex-snapshot
Mechanizing a programming logic for the concurrent programming language microSR in HOL
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_223openalex-snapshot
Mechanized inductive proof of properties of a simple code optimizer
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-4471-3227-1_42openalex-snapshot
Automated Proof of the Correctness of a Compiling Specification
inferred← citeshttps://doi.org/10.1007/978-1-4471-3558-6_13openalex-snapshot
Using LP to Study the Language PL 0 +
inferred← citeshttps://doi.org/10.1007/978-1-4615-3556-0_2openalex-snapshot
Formal Hardware Verification Methods: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-48628-4_8openalex-snapshot
Engineering a Formal, Executable x86 ISA Simulator for Software Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-39813-4_6openalex-snapshot
A Machine-Verified Code Generator
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_30openalex-snapshot
Formal Verification of Gate-Level Computer Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_7openalex-snapshot
Verifying Local Transformations on Relaxed Memory Models
inferred← citeshttps://doi.org/10.1007/978-3-642-77810-0_9openalex-snapshot
Developing Complex Software for Critical Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_23openalex-snapshot
Functional Big-Step Semantics
inferred← citeshttps://doi.org/10.1007/978-3-7091-4009-3_8openalex-snapshot
Compiler Correctness and Input/Output
inferred← citeshttps://doi.org/10.1007/978-981-15-6401-7_38-1openalex-snapshot
Microprocessor Assurance and the Role of Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-981-97-9314-3_38openalex-snapshot
Microprocessor Assurance and the Role of Theorem Proving
inferred← citeshttps://doi.org/10.1007/bf00121125openalex-snapshot
Formal hardware verification methods: A survey
inferred← citeshttps://doi.org/10.1007/bf00243131openalex-snapshot
An approach to systems verification
inferred← citeshttps://doi.org/10.1007/bf00243135openalex-snapshot
Kit and the short stack
inferred← citeshttps://doi.org/10.1007/bf01211302openalex-snapshot
Proof movie — A proof with the Boyer-Moore prover
inferred← citeshttps://doi.org/10.1007/bf01383831openalex-snapshot
Mechanically verifying safety and liveness properties of delay insensitive circuits
inferred← citeshttps://doi.org/10.1007/bf01383985openalex-snapshot
Deriving correctness properties of compiled code
inferred← citeshttps://doi.org/10.1007/bfb0020002openalex-snapshot
Mathematical methods for digital systems development
inferred← citeshttps://doi.org/10.1007/s00236-011-0142-yopenalex-snapshot
Correct hardware synthesis
inferred← citeshttps://doi.org/10.1016/0898-1221(94)00215-7openalex-snapshot
The Boyer-Moore theorem prover and its interactive enhancement
inferred← citeshttps://doi.org/10.1016/b978-0-444-89880-7.50027-9openalex-snapshot
Deriving Correctness Properties of Compiled Code
inferred← citeshttps://doi.org/10.1016/b978-0-444-89901-9.50024-0openalex-snapshot
Bibliography
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.jlap.2003.07.004openalex-snapshot
Verified bytecode verification and type-certifying compilation
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)44822-1openalex-snapshot
A Detailed Processor Model for Verification of Real-Time Applications 1
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82598-8openalex-snapshot
Extracting a formally verified, fully executable compiler from a proof assistant
inferred← citeshttps://doi.org/10.1023/a:1006262609127openalex-snapshot
A Mechanization of Unity in PC-NQTHM-92
inferred← citeshttps://doi.org/10.1023/a:1008685826293openalex-snapshot
The DUAL-EVAL Hardware Description Language and Its Use in the Formal Specification and Verification of the FM9001 Microprocessor
inferred← citeshttps://doi.org/10.1049/sej.1993.0019openalex-snapshot
Towards a verified MiniSML/SECD system
inferred← citeshttps://doi.org/10.1109/aspdac.1995.486381openalex-snapshot
The DUAL-EVAL hardware description language and its use in the formal specification and verification of the FM9001 microprocessor
inferred← citeshttps://doi.org/10.1109/cmpass.1990.175408openalex-snapshot
Maintaining abstractions with verification
inferred← citeshttps://doi.org/10.1109/cmpass.1991.161048openalex-snapshot
Report on the formal specification and partial verification of the VIPER microprocessor
inferred← citeshttps://doi.org/10.1109/cmpass.1996.507874openalex-snapshot
Automatic verification of object code against source code
inferred← citeshttps://doi.org/10.1109/hol.1991.596292openalex-snapshot
A Verified Compiler For A Structured Assembly Language
inferred← citeshttps://doi.org/10.1109/iccl.1992.185474openalex-snapshot
An automatically generated and provably correct compiler for a subset of Ada
inferred← citeshttps://doi.org/10.1109/icse.1992.753486openalex-snapshot
Trusted Computing Systems: The ProCoS* Experience
inferred← citeshttps://doi.org/10.1109/lics.1992.185552openalex-snapshot
Compiler verification in LF
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/1146809.1146811openalex-snapshot
A machine-checked model for a Java-like language, virtual machine, and compiler
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/143062.143080openalex-snapshot
Trusted computing systems
inferred← citeshttps://doi.org/10.1145/1542476.1542513openalex-snapshot
Proving optimizations correct using parameterized program equivalence
inferred← citeshttps://doi.org/10.1145/2429069.2429105openalex-snapshot
High-level separation logic for low-level code
inferred← citeshttps://doi.org/10.1145/2593069.2593237openalex-snapshot
Translation Validation for Stateflow to C
inferred← citeshttps://doi.org/10.1145/277650.277752openalex-snapshot
The design and implementation of a certifying compiler
inferred← citeshttps://doi.org/10.1145/277652.277752openalex-snapshot
The design and implementation of a certifying compiler
inferred← citeshttps://doi.org/10.1145/3110262openalex-snapshot
Verifying efficient function calls in CakeML
inferred← citeshttps://doi.org/10.1145/349299.349314openalex-snapshot
Translation validation for an optimizing compiler
inferred← citeshttps://doi.org/10.1145/780822.781156openalex-snapshot
Automatically proving the correctness of compiler optimizations
inferred← citeshttps://doi.org/10.1145/989393.989454openalex-snapshot
The design and implementation of a certifying compiler
inferred← citeshttps://doi.org/10.1609/aimag.v13i3.1012openalex-snapshot
Software engineering in the twenty-first century
inferred← citeshttps://doi.org/10.22028/d291-25991openalex-snapshot
Compiler verification in the context of pervasive system verification
inferred← citeshttps://doi.org/10.2514/5.9781600866098.0161.0186openalex-snapshot
Mathematical Forecasting
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6226openalex-snapshot
Automation of Mathematical Induction as part of the History of Logic
inferred← citeshttps://doi.org/10.6100/ir805276openalex-snapshot
Embedding hardware description languages in proof systems
inferred← citeshttps://doi.org/10.7146/dpb.v21i382.6614openalex-snapshot
A Provably Correct Compiler Generator
inferred← citeshttps://doi.org/10.7146/dpb.v21i383.6615openalex-snapshot
An Automatically Generated and Provably Correct Compiler for a Subset of Ada
inferred← citeshttps://doi.org/10.7146/dpb.v21i422.6736openalex-snapshot
Provably Correct Compiler Generation
inferred← citeshttps://doi.org/10.82444/warw.33768268openalex-snapshot
A formal theory of railway track networks in higher-order logic and its applications in interlocking design
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.