Results 1 - 10
of
410
Coping with aliasing in the GNU Eiffel Compiler implementation
, 2000
"... This paper reports our experience about aliasing in the implementation of SmallEiffel, the GNU Eiffel Compiler. The SmallEiffel compiler source code makes intensive use of aliasing in order to achieve very good performance. We explain how aliasing can be handled in a safer way, and how helpful the d ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
This paper reports our experience about aliasing in the implementation of SmallEiffel, the GNU Eiffel Compiler. The SmallEiffel compiler source code makes intensive use of aliasing in order to achieve very good performance. We explain how aliasing can be handled in a safer way, and how helpful
Optimizations of Eiffel programs: SmallEiffel, The GNU Eiffel Compiler
"... The design of the Eiel language makes it possible to perform global optimizations on Eiel programs. In this paper, we describe some of the techniques we used in SmallEiel, The GNU Eiel Compiler, to generate highly ecient executables for Eiel programs. Most of these techniques | related to global ana ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
The design of the Eiel language makes it possible to perform global optimizations on Eiel programs. In this paper, we describe some of the techniques we used in SmallEiel, The GNU Eiel Compiler, to generate highly ecient executables for Eiel programs. Most of these techniques | related to global
CIL: Intermediate language and tools for analysis and transformation of C programs
- In International Conference on Compiler Construction
, 2002
"... Abstract. This paper describes the CIntermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C programs. Compared to C, CIL has fewer constructs. It breaks down certain complicated constructs of C into simpler ones, ..."
Abstract
-
Cited by 533 (11 self)
- Add to MetaCart
, and thus it works at a lower level than abstract-syntax trees. But CIL is also more high-level than typical intermediate languages (e.g., three-address code) designed for compilation. As a result, what we have is a representation that makes it easy to analyze and manipulate C programs, and emit them in a
Eiffel
"... Type Binding is the process of assigning a type to a variable. A distinction is made between static and dynamic binding depending on whether the binding occurs at compile-time or at run-time respectively. Type Strength refers to the effectiveness with which a type system prevents type errors. A stro ..."
Abstract
- Add to MetaCart
Type Binding is the process of assigning a type to a variable. A distinction is made between static and dynamic binding depending on whether the binding occurs at compile-time or at run-time respectively. Type Strength refers to the effectiveness with which a type system prevents type errors. A
A Run-time System for SCOOP
- JOURNAL OF OBJECT TECHNOLOGY
, 2002
"... ... In this paper we describe our initial implementation of SCOOP using the GNU Eiffel compiler. We focus on the run-time system, showing how SCOOP's synchronization mechanisms depend on the solution of a dynamic mutual exclusion problem; we give a solution using a thread and lock manager. We p ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
... In this paper we describe our initial implementation of SCOOP using the GNU Eiffel compiler. We focus on the run-time system, showing how SCOOP's synchronization mechanisms depend on the solution of a dynamic mutual exclusion problem; we give a solution using a thread and lock manager. We
Translation Validation for an Optimizing Compiler
, 2000
"... We describe a translation validation infrastructure for the GNU C compiler. During the compilation the infrastructure compares the intermediate form of the program before and after each compiler pass and verifies the preservation of semantics. We discuss a general framework that the optimizer can us ..."
Abstract
-
Cited by 212 (7 self)
- Add to MetaCart
We describe a translation validation infrastructure for the GNU C compiler. During the compilation the infrastructure compares the intermediate form of the program before and after each compiler pass and verifies the preservation of semantics. We discuss a general framework that the optimizer can
ESP: Path-Sensitive Program Verification in Polynomial Time
, 2002
"... In this paper, we present a new algorithm for partial program verification that runs in polynomial time and space. We are interested in checking that a program satisfies a given temporal safety property. Our insight is that by accurately modeling only those branches in a program for which the proper ..."
Abstract
-
Cited by 299 (4 self)
- Add to MetaCart
” algorithm as part of a partial verification tool called ESP. We present the results of applying ESP to the problem of verifying the file I/O behavior of a version of the GNU C compiler (gcc, 140,000 LOC). We are able to prove that all of the 646 calls to fprintf in the source code of gcc are guaranteed
Compiling the EiffelStudio Workbench
"... Source code of EiffelStudio provides the Eiffel programmers with valuable examples of applying the Eiffel methodology. The exercise is designed to guide you through the process of setting up the environment as well as compiling and executing the EiffelStudio workbench, to 1) review the Eiffel compil ..."
Abstract
- Add to MetaCart
Source code of EiffelStudio provides the Eiffel programmers with valuable examples of applying the Eiffel methodology. The exercise is designed to guide you through the process of setting up the environment as well as compiling and executing the EiffelStudio workbench, to 1) review the Eiffel
GCC – GNU Compilers Collection,
"... The subject of our work is an original interactive telecommunication protocols design, simulation, and prototyping tool set. The following subjects were investigated during the research phase of the project:- Efficient modeling of dynamic, unpredictable data structures,- Reliable yet tunable code ge ..."
Abstract
- Add to MetaCart
The subject of our work is an original interactive telecommunication protocols design, simulation, and prototyping tool set. The following subjects were investigated during the research phase of the project:- Efficient modeling of dynamic, unpredictable data structures,- Reliable yet tunable code generation routines. The idea of this presentation is to show modern efficient methods of design of efficient complex software solutions. API – Application programming interface,
Formalizing Proof-Transforming Compilation of Eiffel programs
, 2008
"... In modern development schemes the processing of programs often involves an intermediate step of translation to some intermediate bytecode, complicating the verification task. Expanding on the ideas of Proof-Carrying Code (PCC), we have built a proof-transforming compiler which translates a contrac ..."
Abstract
-
Cited by 11 (5 self)
- Add to MetaCart
by the original contracts. The task of the proof-transforming compiler is made particularly challenging by the impedance mismatch between the source language, Eiffel, and the target code,.NET CIL, which does not directly support such important Eiffel mechanisms as multiple inheritance and contract
Results 1 - 10
of
410