The mainstream arrival of predication, a means other than branching of selecting instructions for execution, has required compiler architects to reformulate fundamental analyses and transformations. Traditionally, the compiler has generated branches straightforwardly to implement control flow designed by the programmer and has then performed sophisticated “global” optimizations to move and opti...

This paper describes automatic coarse grain parallel processing on a shared memory multiprocessor system using a newly developed OpenMP backend of OSCAR multigrain parallelizing compiler for from single chip multiprocessor to a high performance multiprocessor and a heterogeneous supercomputer cluster. OSCAR multigrain parallelizing compiler exploits coarse grain task parallelism and near ne gra...

Echo Instructions have recently been introduced to allow embedded processors to provide runtime decompression of LZ77-compressed programs at a minimal hardware cost compared to other recent decompression schemes. As embedded architectures begin to adopt echo instructions, new compiler techniques will be required to perform the compression step. This paper describes a novel instruction selection...

Abstract Compiler fuzzing techniques require a means of generating programs that are free from undefined behaviour (UB) to reliably reveal miscompilation bugs. Existing program generators such as Csmith achieve UB-freedom by heavily restricting the form generated programs. The idiomatic nature resulting risks limiting test coverage they can offer, and thus compiler bugs discover. We investigate...

Program veri cation is normally performed on source code. However, it is the object code which is executed and so which ultimately must be correct. The compiler used to produce the object code must not introduce bugs. The majority of the compiler correctness literature is concerned with the veri cation of compiler speci cations rather than executable implementations. We discuss di erent ways th...

The considerable expressive power and exibility gained by combining constraint programming with logic programming is not without cost. Implementations of constraint logic programming (CLP) languages must include expensive constraint solving algorithms tailored to speciic domains, such as trees, Booleans, or real numbers. The performance of many current CLP compilers and interpreters does not en...

In this paper, we present some compiler optimization techniques for explicit parallel programs using OpenMP API. To enable optimizations across threads, we designed data ow analysis techniques in which interaction between threads is e ectively modeled. Structured description of parallelism and relaxed memory consistency in OpenMP make the analyses e ective and eÆcient. We show algorithms for re...

Compiler optimizations, usually expressed as rewrites on program graphs, are a core part of modern compilers. However, even production compilers have bugs, and these bugs are difficult to detect and resolve. In this paper we present Morpheus, a domain-specific language for formal specification of program transformations, and describe its executable semantics. The fundamental approach of Morpheu...

We evaluate the Texas Instruments TMS320C6x C compiler and assembly optimizer. Unlike previous attempts to evaluate these tools, we measure not just execution time, but also code size, wasted program memory, and several other metrics. Also, we compare the performance of the compiler on ANSI C benchmarks with that of C benchmarks that have been optimized for the TMS3206x compiler. In addition, w...

In this article, the use of software design patterns for modeling the stages of a compiler is presented. The compiler is generated for expressing disjunctions and logic propositions into optimization mathematical programs. It works linked to a mathematical modeling system, because the introduction of logic into those programs completes them instead of replacing them. It works as a post-compilat...