Normal form approach to compiler design (Q1323320): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Guarded commands, nondeterminacy and formal derivation of programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning algebraically about recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest prespecification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prespecification in data refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laws of programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theoretical basis for stepwise refinement and the programming calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal form approach to compiler design / rank
 
Normal rank

Latest revision as of 14:46, 22 May 2024

scientific article
Language Label Description Also known as
English
Normal form approach to compiler design
scientific article

    Statements

    Normal form approach to compiler design (English)
    0 references
    0 references
    0 references
    0 references
    2 June 1994
    0 references
    This paper demonstrates how reduction to normal form can help in the design of a correct compiler for Dijkstra's guarded command language. The compilation strategy is to transform a source program, by a series of algebraic manipulations, into a normal form which describes the behaviour of a stored-program computer. Each transformation elminates high-level language constructs in favour of lower-level constructs. The correctness of the compiler follows from the correctness of each of the algebraic transformations.
    0 references
    compiler design
    0 references
    reduction to normal form
    0 references
    Dijkstra's guarded command language
    0 references
    correctness
    0 references
    algebraic transformations
    0 references

    Identifiers