Gerhard Goos. Sather-K --- The Language. Software --- Concepts and Tools, 18:91--109, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....therefore we still rely on a verified assembler linker to achieve a complete verified compiler tool chain. 3.1 Measurements We applied our approach to a back end selecting code for DEC Alpha. Our implementation language for the verified parts is Sather K, a type safe objectoriented language [Goo97]. The code generator generator BEG produces a C implementation with 18.000 lines of code, the generator itself tool is written in 35.000 lines of Modula 2 code. Table 1 compares lines of code and program sizes of our example. If we would be forced to verify the implementation In practices we do ....

Gerhard Goos. Sather-K --- The Language. Software --- Concepts and Tools, 18:91--109, 1997.

....back end generator we use and proving the optimality of this process is not in the scope of our work. 5.1 Measurements We applied our approach to the back end described in the previous section. Our implementation language for the outer parts is Sather K, a type safe objectoriented language [Goo97] The code generator generator BEG produces a C implementation with 18.000 lines of code, the generator itself tool is written in 35.000 lines of Modula 2 code. Table 1 compares lines of code and program sizes of our example. If we want to verify the implementation traditionally, we have either ....

Gerhard Goos. Sather-K --- The Language. Software --- Concepts and Tools, 18:91--109, 1997.

....of a subclass that may become true in the context of the superclass. Zaremski and Wing use a proof theoretic approach to check the conformance and the use of objects for correctness in Larch ML [36] programs [37] In object oriented languages like Simula [9] C [31] Modula 3 [4, 5] Sather( K) [30, 13], and Java [14] contra covariance (or a stronger condition) is checked only for those predicates that are computable at compile time, namely for the (static) types. This approach was formalized by Cardelli [3] or Frick et al. 10] Our question was the following: Is it possible to specify the ....

G. Goos. Sather-K -- the language. Software -- Concepts and Tools, 18:91--109, 1997.

.... classes, it is necessary to constrain the type bounds [DGLM95] There are two common methods used to constrain the type bounds: Implicit conformance bounds, as with the the where clauses of Theta [DGLM95] the type maching clauses of Emerald [JLHB88] and the property classes of Sather K [Goo97]. In this case, the type bound states the signatures of the methods that must be provided by any instantiating type. However, the type bound itself is not a type, and is Type Safety and Overloading in Sather April 24, 1998 3 outside the type system. Hence, the type parameter may be instantiated ....

Gerhard Goos. Sather-k, the language. Software - Concepts and Tools, 1997. To appear.

....MIS Code Selection 500 (Parser) Checker (Sather K) 300 (Checker) 200 KB 400 (MIS) Industrial: ANDF ) ST9 140.000 6.4 MB 3.5 MB Table 1. Lines of program code to verify for example back end Our implementation language for the checker is Sather K, an modern typesafe object oriented language, [23]. The code generator generator BEG produces a C implementation with 18.000 lines of code, the generator tool is written in 35.000 lines of Modula 2 code. Table 1 compares lines of code and program sizes for our example; the relation of 1 to 15 in lines to verify shows the usefulness of program ....

Gerhard Goos. Sather-k --- the language. Software --- Concepts and Tools, 18:91-- 109, 1997.

....verification needs, and that we do not have to switch between di#erent formalisms for describing semantics during the compilation process. 2 Correctness of Compilation We consider a pair (PL,ML) consisting of an imperative or object oriented programming language PL such as Ada, C, C , Sather K, [29], or Java and a microprocessor such as the DEC Alpha represented by its machine language ML. For simplicity we restrict ourselves to sequential programming languages. The translation of a source program # in PL to a target program # # = in ML is certainly correct if # # shows the same behavior ....

....this approach to a compiler front end for a C subset IS, 20, 33] Details can be found in [32] Tab. 1 shows the results. Tab. 2 shows similar results for the code selection phase using the back end generator BEG, 23, 22] The checker has been written in the object oriented language Sather K, [29]; a subset of Sather K comparable to Java will be the first realistic language for which we expect to present a verifying compiler. As can be seen in both cases the verification e#ort for the checker is by orders of magnitude lower than for the generator or the generated compiler phase. 6 What ....

Gerhard Goos. Sather-K --- The Language. Software --- Concepts and Tools, 18:91--109, 1997.

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