On the public citation graph

Using domain algebras to prove the correctness of a compiler

https://doi.org/10.1007/bfb0023999
0 signed · 34 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-09724-4openalex-snapshot
Edinburgh LCF
inferredcites →https://doi.org/10.1007/3-540-10699-5_99openalex-snapshot
On the definition of lambda-calculus models
inferredcites →https://doi.org/10.1007/3-540-13345-3_13openalex-snapshot
Domain algebras
inferredcites →https://doi.org/10.1007/978-1-4612-6228-2openalex-snapshot
The Denotational Description of Programming Languages
inferredcites →https://doi.org/10.1007/bf01703261openalex-snapshot
Deductive systems and categories
inferredcites →https://doi.org/10.1007/bf01752392openalex-snapshot
Algebraic specification of data types: A synthetic approach
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0073965openalex-snapshot
Deductive systems and categories III. Cartesian closed categories, intuitionist propositional calculus, and combinatory logic
inferredcites →https://doi.org/10.1016/0304-3975(81)90080-3openalex-snapshot
More on advice on structuring compilers and proving them correct
inferredcites →https://doi.org/10.1090/psapm/019openalex-snapshot
Mathematical Aspects of Computer Science
inferredcites →https://doi.org/10.1137/0206028openalex-snapshot
Implementation Correctness Involving a Language with goto Statements
inferredcites →https://doi.org/10.1137/0211062openalex-snapshot
The Category-Theoretic Solution of Recursive Domain Equations
inferredcites →https://doi.org/10.1145/512927.512941openalex-snapshot
Advice on structuring compilers and proving them correct

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-16442-1_2openalex-snapshot
Correctness of code generation from a two-level meta-language
inferred← citeshttps://doi.org/10.1007/3-540-17162-2_121openalex-snapshot
Category theory and programming language semantics: An overview
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-49213-5_12openalex-snapshot
An overview of compositional translations
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_26openalex-snapshot
Correctness proofs for META IV written code generator specifications using term rewriting
inferred← citeshttps://doi.org/10.1007/3-540-57186-8_90openalex-snapshot
Proving the correctness of compiler optimisations based on strictness analysis
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-4471-3794-8_17openalex-snapshot
More Advice on Proving a Compiler Correct: Improve a Correct Compiler
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.1016/0304-3975(86)90006-xopenalex-snapshot
Two-level semantics and code generation
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.1016/s0304-3975(97)00267-3openalex-snapshot
Algebraic translations, correctness and algebraic compiler construction
inferred← citeshttps://doi.org/10.1109/eurmic.2000.874422openalex-snapshot
Software testing concept used for MAS/C-compiler
inferred← citeshttps://doi.org/10.1109/icsa-c52384.2021.00009openalex-snapshot
Modeling Data Flow Constraints for Design-Time Confidentiality Analyses
inferred← citeshttps://doi.org/10.1145/154630.154647openalex-snapshot
The correctness of an optimized code generation
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/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.7146/dpb.v20i379.6611openalex-snapshot
Simulation Techniques
inferred← citeshttps://doi.org/10.7146/dpb.v21i427.6741openalex-snapshot
The Correctness of an Optimized Code Generation
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.