On the public citation graph

Normal form approach to compiler design

https://doi.org/10.1007/bf01191809

0 signed · 91 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-16442-1_14openalex-snapshot

Data refinement refined resume

inferredcites →https://doi.org/10.1007/3-540-52559-9_60openalex-snapshot

Refinement calculus, part I: Sequential nondeterministic programs

inferredcites →https://doi.org/10.1007/3-540-52559-9_61openalex-snapshot

Refinement calculus, part II: Parallel and reactive programs

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

The Science of Programming

inferredcites →https://doi.org/10.1016/0020-0190(87)90106-2openalex-snapshot

The weakest prespecification

inferredcites →https://doi.org/10.1016/0020-0190(87)90224-9openalex-snapshot

Prespecification in data refinement

inferredcites →https://doi.org/10.1016/0020-0190(88)90147-0openalex-snapshot

Data refinement by miracles

inferredcites →https://doi.org/10.1016/0167-6423(87)90011-6openalex-snapshot

A theoretical basis for stepwise refinement and the programming calculus

inferredcites →https://doi.org/10.1016/0167-6423(91)90014-oopenalex-snapshot

Programming from specifications

inferredcites →https://doi.org/10.1016/0167-6423(92)90019-8openalex-snapshot

Reasoning algebraically about recursion

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

Laws of programming

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

An axiomatic basis for computer programming

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

Guarded commands, nondeterminacy and formal derivation of programs

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

An axiomatic basis for computer programming

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

A generalization of Dijkstra's calculus

inferredcites →https://doi.org/10.25405/ncl.34123362openalex-snapshot

Software Development: A Rigorous Approach

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10703260_4openalex-snapshot

Towards Rigorous Compiler Implementation Verification

inferred← citeshttps://doi.org/10.1007/11925040_6openalex-snapshot

On the Correctness of Transformations in Compiler Back-Ends

inferred← citeshttps://doi.org/10.1007/3-540-36103-0_36openalex-snapshot

Refinement Algebra for Formal Bytecode Generation

inferred← citeshttps://doi.org/10.1007/3-540-44518-8_11openalex-snapshot

Verifying Compilers and ASMs or ASMs for Uniform Description of Multistep Transformations

inferred← citeshttps://doi.org/10.1007/3-540-44525-0_19openalex-snapshot

Performing Algorithmic Refinement before Data Refinement in B

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

Towards Provably-Correct Hardware Compilation Tools Based on Pass Separation Techniques

inferred← citeshttps://doi.org/10.1007/3-540-45614-7_27openalex-snapshot

Forward Simulation for Data Refinement of Classes

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

Verification of Compilers

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-57840-4_39openalex-snapshot

On the essence of Oberon

inferred← citeshttps://doi.org/10.1007/3-540-58468-4_171openalex-snapshot

Provably Correct Systems

inferred← citeshttps://doi.org/10.1007/978-0-387-34848-3_37openalex-snapshot

Using Strongest Postconditions to Improve Software Quality

inferred← citeshttps://doi.org/10.1007/978-1-4757-6463-5_3openalex-snapshot

The ProCoS Approach to Correct Systems

inferred← citeshttps://doi.org/10.1007/978-1-84882-258-0_13openalex-snapshot

The Algebra of CSP

inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot

Insight, Inspiration and Collaboration

inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_1openalex-snapshot

Jifeng He at Oxford and Beyond: An Appreciation

inferred← citeshttps://doi.org/10.1007/978-3-031-63790-2_21openalex-snapshot

Small Step Incremental Verification of Compilers

inferred← citeshttps://doi.org/10.1007/978-3-032-24494-9_7openalex-snapshot

A First Step Towards Agile Verification of Compilations

inferred← citeshttps://doi.org/10.1007/978-3-319-52228-9_9openalex-snapshot

UTP Semantics for rTiMo

inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_18openalex-snapshot

A Strategy for Compiling Classes, Inheritance, and Dynamic Binding

inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_46openalex-snapshot

Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image Manipulation

inferred← citeshttps://doi.org/10.1007/978-3-642-16561-0_46openalex-snapshot

On the Role of Non-functional Properties in Compiler Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-33826-7_9openalex-snapshot

A Denotational Model for Instantaneous Signal Calculus

inferred← citeshttps://doi.org/10.1007/978-3-642-61455-2_11openalex-snapshot

Mathematical Models for Computing Science

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

Specification, Verification and Prototyping of an Optimized Compiler

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

Towards a provably correct hardware implementation of occam

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

A tool for data refinement

inferred← citeshttps://doi.org/10.1007/s00165-005-0075-8openalex-snapshot

Provably-correct hardware compilation tools based on pass separation techniques

inferred← citeshttps://doi.org/10.1007/s00165-009-0124-9openalex-snapshot

An algebraic approach to the design of compilers for object-oriented languages

inferred← citeshttps://doi.org/10.1007/s00165-014-0309-8openalex-snapshot

Denotational semantics and its algebraic derivation for an event-driven system-level language

inferred← citeshttps://doi.org/10.1007/s00165-018-0467-1openalex-snapshot

A UTP approach for rTiMo

inferred← citeshttps://doi.org/10.1007/s00165-020-00513-4openalex-snapshot

Theoretical and Practical Approaches to the Denotational Semantics for MDESL based on UTP

inferred← citeshttps://doi.org/10.1007/s00165-021-00530-xopenalex-snapshot

A process calculus BigrTiMo of mobile systemsand its formal semantics

inferred← citeshttps://doi.org/10.1007/s00236-005-0165-3openalex-snapshot

Compiling quantum programs

inferred← citeshttps://doi.org/10.1007/s00236-011-0142-yopenalex-snapshot

Correct hardware synthesis

inferred← citeshttps://doi.org/10.1007/s10773-020-04698-5openalex-snapshot

A Framework for Quantum-Classical Cryptographic Translation

inferred← citeshttps://doi.org/10.1007/s11036-018-1142-8openalex-snapshot

Formal Verification of mCWQ Using Extended Hoare Logic

inferred← citeshttps://doi.org/10.1007/s11334-008-0069-9openalex-snapshot

From algebraic semantics to denotational semantics for Verilog

inferred← citeshttps://doi.org/10.1007/s11390-021-1616-1openalex-snapshot

Trace Semantics and Algebraic Laws for Total Store Order Memory Model

inferred← citeshttps://doi.org/10.1016/b978-0-08-042367-8.50054-9openalex-snapshot

PROGRAM TRANSFORMATIONS FOR DISTRIBUTED CONTROL SYSTEMS

inferred← citeshttps://doi.org/10.1016/b978-0-444-89901-9.50024-0openalex-snapshot

Bibliography

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

What Level of Mathematical Reasoning can Computer Science Demand of a Software Implementer?

inferred← citeshttps://doi.org/10.1016/j.scico.2023.103015openalex-snapshot

Generating C: Heterogeneous metaprogramming system description

inferred← citeshttps://doi.org/10.1016/j.sysarc.2022.102438openalex-snapshot

UTP semantics for the MCA ARMv8 architecture

inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00015-9openalex-snapshot

The automated transformation of abstract specifications of numerical algorithms into efficient array processor implementations

inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00019-6openalex-snapshot

Probabilistic models for the guarded command language

inferred← citeshttps://doi.org/10.1016/s0167-6423(98)00016-1openalex-snapshot

Calculational derivation of pointer algorithms from tree operations

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00047-0openalex-snapshot

A formal model of real-time program compilation

inferred← citeshttps://doi.org/10.1016/s1474-6670(17)47662-2openalex-snapshot

Program Transformations for Distributed Control Systems

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80399-2openalex-snapshot

Towards Acceptability of Optimizations

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80517-6openalex-snapshot

An Algebraic Approach for Compiling Real-Time Programs

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

The ProCoS Approach to Correct Systems

inferred← citeshttps://doi.org/10.1049/ip-sen:20010213openalex-snapshot

Hardware compilation for software engineers: An ATM example

inferred← citeshttps://doi.org/10.1108/eb035253openalex-snapshot

The Queen's University of Belfast

inferred← citeshttps://doi.org/10.1109/2.762804openalex-snapshot

Do you trust your compiler?

inferred← citeshttps://doi.org/10.1109/compsac54236.2022.00240openalex-snapshot

Algebraic Semantics for C++11 Memory Model

inferred← citeshttps://doi.org/10.1109/emwrt.1993.639088openalex-snapshot

Developing Correct Systems

inferred← citeshttps://doi.org/10.1109/hase.1997.648033openalex-snapshot

Do you trust your compiler? Applying formal methods to constructing high-assurance compilers

inferred← citeshttps://doi.org/10.1109/hsc.1994.336704openalex-snapshot

Towards provably correct hardware/software partitioning using OCCAM

inferred← citeshttps://doi.org/10.1109/iceccs.2006.1690363openalex-snapshot

From algebraic semantics to denotational semantics for Verilog

inferred← citeshttps://doi.org/10.1109/pdse.1998.668151openalex-snapshot

An algebraic framework for optimizing parallel programs

inferred← citeshttps://doi.org/10.1109/rteict42901.2018.9012266openalex-snapshot

The Multi Language Audio Compiler with Video Help

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

Theoretical and Practical Aspects of Linking Operational and Algebraic Semantics for MDESL

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

List of Tony Hoare’s Publications

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

Verification of Nondeterministic Quantum Programs

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

Laws of Quantum Programming

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

Compiler verification

inferred← citeshttps://doi.org/10.14236/ewic/rw1996.2openalex-snapshot

Calculational Derivation of Algorithms on Tree-based Pointer Structures

inferred← citeshttps://doi.org/10.22028/d291-25991openalex-snapshot

Compiler verification in the context of pervasive system verification

inferred← citeshttps://doi.org/10.5555/947185.947219openalex-snapshot

Towards provably correct hardware/software partitioning using OCCAM

inferred← citeshttps://doi.org/10.5753/sbes.1996.24440openalex-snapshot

De occam para o transputer: compilação via reescrita de termos

inferred← citeshttps://doi.org/10.71548/18425openalex-snapshot

A Unifying Theory of Multi-Exit Programs

inferred← citeshttps://doi.org/10.82444/warw.33642034openalex-snapshot

Verification and abstraction of flow-graph programs with pointers and computed jumps

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.