J. Palsberg, "A Provably Correct Compiler Generator", in B. Krieg-Bruckner, editor, Proceedings of the 4th European Symposium on Programming (ESOP'92), vol. 582 of Lecture Notes in Computer Science, pp. 418--434, New York, NY, 1992, Springer Verlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....It could be used as input to a compiler generator. A relatively outdated survey on semanticsdriven compiler construction is given in [Gaud81] whereas experimental systems for this purpose include SIS [Moss76, Bodw82] MESS [Lee87, Pleb88] PSP [Paul82] CERES [Jone80] Actress [Brow92] Cantor [Pals92], DML [Pett92] A more recent approach, based on the use of monads, is described in [Lian95a, Lian96] 1.3.2 Methodology The present specification for the semantics of C can be best understood as part of an abstract inter ABSTRACT INTERPRETER preter for C programs. Such an interpreter is ....

J. Palsberg, "A Provably Correct Compiler Generator", in B. Krieg-Bruckner, editor, Proceedings of the 4th European Symposium on Programming (ESOP'92), vol. 582 of Lecture Notes in Computer Science, pp. 418--434, New York, NY, 1992, Springer Verlag.

....methodology for specifying language semantics that would scale up to realistic programming languages and avoid many of the problems of denotational semantics. In fact, there are action semantics speci cations for Pascal [MW93] and the Standard ML bare language [Wat88] Palsberg [Pal92b,Pal92a,Pal92c] has proved the correctness of a compiler generator which he designed and implemented that accepts action semantics descriptions of imperative languages and generates code for an abstract RISC machine. As Mosses states in [Mos96] this may be a rst step in developing tools which allow one to ....

J. Palsberg. A provably correct compiler generator. In ESOP'92, Proc. European Symposium on Programming Languages, volume 582 of Lecture Notes in Computer Science, pages 418-434. Springer-Verlag, 1992.

....to perform type inference on specific programs, to justify meaning preserving code transformations, and to stage an ASD of a programming language into a static semantics stage and a dynamic semantics stage. 6. 2 Provably Correct Compiler Generation As reported in his PhD thesis [58] and papers [57, 59] at ESOP and ICCL in 1992, Palsberg has designed, implemented, and proved the correctness of a compiler generator that accepts action semantic descriptions of imperative programming languages. He has used it to generate compilers for both a toy language and a non trivial subset of Ada. The ....

J. Palsberg. A provably correct compiler generator. In ESOP'92, Proc. European Symposium on Programming, Rennes, volume 582 of Lecture Notes in Computer

....abstract syntax tree and then interpret this tree to nally generate the action s outcome. Other examples of similar compiler generators are the Abaco system [10] extensions of Actress by Doh and Schmidt [12] to support techniques for typing and binding time analysis, and the Cantor system [41,42] which was used to generate a compiler of a subset of Ada from its action semantic description. The main emphasis in the last case was on the generation of provably correct compilers. While such compiler generators based on semantic descriptions are useful once the complete semantic speci cation ....

J. Palsberg. A provably correct compiler generator. In Proc. European Symposium on Programming (ESOP'92), volume 592 of Lecture Notes in Computer Science, pages 418-434. Springer Verlag, 1992.

....formal, general framework for giving semantic descriptions of programming languages. It has successfully been applied to imperative [14, 15] functional 26 [22] and object oriented languages [17] not to mention the usual toy languages that computer scientists often provide as testing material [4, 5, 9, 19]. Action Semantics is derived from denotational semantics. It has been developed partly because of the lack of pragmatic features in denotational semantics. In denotational semantics, extending the semantics description of a language with new features that where not originally thought of may ....

....6 940 6 140 Table 5.2: Interpretation times (ms) Syntax Directed TypeProgram Imprv Imprv Directed bubble.hpl 297.0 307.4 298.1 bubble.ad 414.1 429.8 415.3 sieve.ad 103.3 107.0 103.1 euclid.ad 23.7 24.8 23.7 Table 5. 3: Space usage during interpretation (Mbytes) compiler generator Cantor [18, 19]. The actions are bubble.hpl, a bubble sort program written in HypoPL; bubble.ad, the same bubble sort program written in Mini Ada, a subset of Ada; sieve.ad, Eratosthenes sieve, which finds prime numbers, written in Mini Ada; and euclid.ad, Euclid s method, also written in Mini Ada. The sizes of ....

Jens Palsberg. A provably correct compiler generator. In ESOP'92, Proc. European Symposium on Programming, Rennes, volume 582 of Lecture Notes in Computer Science, pages 418--434. Springer-Verlag, 1992.

....is extremely modular, providing the high degree of extensibility, modifiability, and reusability required by language designers. It is also strongly suggestive of an operational understanding of the described language, and it has been found to be very well suited for generating compilers [21, 20] and interpreters [27] Programmers should find action semantic descriptions almost as easy to read as the usual reference manuals, without much preparation. On the other hand, although the foundations of action semantics are firm enough, the theory for reasoning about actions (and hence about ....

J. Palsberg. A provably correct compiler generator. In ESOP'92, Proc. European Symposium on Programming, Rennes, volume 582 of Lecture Notes in Computer Science, pages 418--434. Springer-Verlag, 1992.

....provided much of the inspiration for our work, which essentially attempts to formulate actions in a denotational semanticsframework. Monad transformers roughly correspond to facets in action semantics, although issues such as concurrency are beyond the power of our approach. Action semantics [4] [26] [25] and a related approach by Lee [17] have been successfully used to generate efficient compilers. Moggi [21] first used monads and monad transformers to structure denotational semantics. Wadler [33] 32] popularized Moggi s ideas in the functional programming community by using monads to ....

Jens Palsberg. A provably correct compiler generator. In B. Krieg-Br uckner, editor, ESOP '92: 4th European Symposium on Programming, Rennes, France, Proceedings, pages 418--434, New York, February 1992. Springer-Verlag. Lecture Notes in Computer Science 582.

....procedures (with value and reference parameters) multidimensional arrays, simple input output and the usual control constructs. The language specification contains approximately 5400 well commented lines. 3.3. 3 CANTOR A Verified Compiler Generator Palsberg s compiler generator Cantor[57, 58, 59] is a verified compiler generator that has been used to generate compilers for a realistic imperative programming language (a subset of Ada) for real target machines (SPARC and HP Precision) However, during the development of Cantor the principle that correctness is more important than efficiency ....

Jens Palsberg. A provably correct compiler generator. In Proceedings of ESOP '92, European Symposium on Programming, 1992.

....The results are very encouraging as our automatically generated compilers emit code that performs within a factor 2 of code produced by handwritten compilers. This is a major performance enhancement in relation to earlier approaches to compiler generation based on Action Semantics [20, 19, 3], as well as compared to other semantics based compiler generators. 2 Action Notation Action Semantics is a formalism for the description of the dynamic semantics of programming languages, developed by Mosses and Watt [17] Based on an order sorted algebraic framework, an action semantic ....

....an action may commit and subsequently fail (i.e. err) within an A 1 or A 2 construct. If this is the case, the or can t trap the failure, a run time error should be indicated and the program stopped (in the absence of commitment, an alternative action may be performed) In the CANTOR system [20, 19], a significant amount of run time is used to check for such committed failures. Our analysis is able to statically determine the possibility of committed failures in most cases, thus much fewer run time checks need to be inserted. The lattice used by the commitment analysis looks like this: ....

[Article contains additional citation context not shown here]

J. Palsberg. A Provably Correct Compiler Generator. In B. Krieg-Bruckner, editor, Proceedings of the 4th European Symposium on Programming (ESOP 92), volume 582 of LNCS, pages 418--434, Rennes, February 1992. Springer-Verlag.

.... that provide standard techniques being more abstract than hand coded symbol tables, but comparable in efficiency (like that of Reiss [Rei83] or Kastens and Waite [KW91] It is as well interesting as basis for executable specifications of programming language semantics (cf. e.g. Des84] Gan85] [Pal92]) Paper Overview The paper is organized as follows: In chapter 2, we explain how a specification according to our method looks like, and sketch its semantics. Chapter 3 contains the core of the paper. It describes the data type we use to represent programs and presents the implementation ....

J. Palsberg. A provably correct compiler generator. In Proc. of ESOP'92 Symposium on Compiler Construction, 1992.

.... ; fb: true, x: cell[integer]gfl 19 ) fg; fg) 6 Related Work Sort inference for action notation is a central theme of the mainly theoretical work of Schmidt s group at Kansas State University [7, 8] and forms part of the more practical compiler generation work of Palsberg at Aarhus University [12]. Palsberg s compiler generation system Cantor [12] takes a pragmatic approach to sort inference (which is not a central part of his work) His sort checker assumes that, for each action and sub action A, the sorts of the transients and bindings passed into A are initially known, and uses these to ....

.... Related Work Sort inference for action notation is a central theme of the mainly theoretical work of Schmidt s group at Kansas State University [7, 8] and forms part of the more practical compiler generation work of Palsberg at Aarhus University [12] Palsberg s compiler generation system Cantor [12] takes a pragmatic approach to sort inference (which is not a central part of his work) His sort checker assumes that, for each action and sub action A, the sorts of the transients and bindings passed into A are initially known, and uses these to infer the sorts of the transients and bindings ....

J. Palsberg. A provably correct compiler generator. In ESOP '92, Lecture Notes in Computer Science, pages 418--434. Springer-Verlag, 1992.

....used to describe the syntax and semantics of the programming language, and the approach taken to generate the compiler. Since a semantics directed compiler generator actually processes the formal specification of the programming language, the correctness of the generated compiler can be proven [Mei92,Pal92b]. In Sections 3.3 to 3.6, we consider some of the semantics directed compiler generation systems that have been developed, and the approaches that have been used. We classify the systems according to the semantics methodology used, and consider systems based on denotational semantics, high level ....

.... and then , complete and bind respectively. 3.5 Action Semantics Apart from the ACTRESS system, which we discuss in detail in Chapter 4, there have been a number of other systems that use action semantics as the basis for a compiler generation system. 3.5. 1 Palsberg s Cantor Palsberg[Pal92b] has implemented a system called CANTOR, that generates a compiler that produces RISC assembly code for either the SPARC processor or the PA RISC processor. The CANTOR system is written in PERL[WS91] and the generated compiler is expressed in SCHEME. CANTOR accepts the same input file, written in ....

[Article contains additional citation context not shown here]

J. Palsberg. A provably correct compiler generator. In 4th European Symposium on Programming (ESOP'92), volume 582 of Lecture Notes in Computer Science, pages 418--434. Springer-Verlag, 1992.

....in section 4 we compare the performance of the generated Mini Ada compiler with the standard C compilers on the SPARC and the HP Precision Architecture. This paper summarizes the author s forthcoming PhD thesis [29] except the correctness proof. For an overview of our approach to correctness, see [30]. 2 Previous Work We will examine each of the previous approaches to compiler generation by focusing on: ffl The accessibility and maintainability of the involved specifications; ffl The quality of the generated compilers; and ffl Whether correctness has been proved. These criteria decide ....

Jens Palsberg. A provably correct compiler generator. In Proc. ESOP'92, European Symposium on Programming, pages 418--434. Springer-Verlag (LNCS 582), Rennes, France, February 1992.

....developed by Mosses [16, 17, 18] and Watt [19, 26] It differs from denotational semantics in using semantic entities called actions, rather than higher order functions. Compiler generation based on action semantics has been studied by Brown, Moura, and Watt [6] and also by the second author [22, 20, 21]. Journal of Functional Programming, 6(2) 269 298, 1996. Also in Proc. FPCA 93, pages 308 317. The core of each of their two action semantics directed compiler generators is a handwritten action compiler, producing either C or machine code. These compilers are rather complicated and, due to ....

....bindings, and the current state of the store. Evaluation cannot affect the current information. Data is a special case of dependent data, and it always yields itself when evaluated. The language of actions is called action notation. We use a subset of action notation which was also studied in [22, 20] and defined in [21] This subset covers roughly half of the full action notation and is sufficiently general to allow the easy description of Lee s HypoPL [22] and a non trivial subset of Ada [20] For an example of an action semantic description using this subset, see Appendix C. Scaling up our ....

[Article contains additional citation context not shown here]

Jens Palsberg. A provably correct compiler generator. In Proc. ESOP'92, European Symposium on Programming, pages 418--434. Springer-Verlag (LNCS 582), Rennes, France, February 1992.

No context found.

Jens Palsberg. A provably correct compiler generator. In B. Krieg-Bruckner, editor, ESOP '92: Proceedings of the 4th European Symposium on Programming, volume 582 of Lecture Notes in Computer Science, pages 418-- 434, Rennes, France, February 1992. SpringerVerlag.

No context found.

J. Palsberg, "A provably correct compiler generator," in ESOP'92, Proc. European Symposium on Programming, Rennes, vol. 582 of Lecture Notes in Computer Science, pp. 418-434, Springer-Verlag, 1992. [DART-104].

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC