The paper presents an approach to the translation validation of an optimizing compiler which translates synchronous C programs into machine code programs. Being synchronous means that both source and target programs are loop free. This enables representation of each of these programs by a single state transformer, and verification of the translation correctness is based on comparison of the sou...

New information technologies provide a lot of prospects for performance improvement. One of them is ”Dynamic Source Code Generation and Compilation”. This article shows how this way provides high performance for engineering problems.

Conventional image classification techniques aim to predict class labels by training a classifier with the provided training labels, but the internal relationship between classes has been ignored. In this project, we explore the feasibility of transferring knowledge between classes to help boost up the classification accuracy. Two transfer learning approaches have been studied, namely, instance...

The static single-assignment (SSA) form of a program provides data flow information in a form which makes some compiler optimizations easy to perform. In this paper we present a new, simple method for converting to SSA form, which produces correct solutions for nonreducible control-flow graphs, and produces minimal solutions for reducible ones. Our timing results show that, despite its simplici...

Induction is one of the major forms of reasoning; it is therefore essential to include it in a commonsense reasoning framework. This paper examines a class of induction-based planning problems. These problems can be solved, but not in the classical sense, where one and only one output—a correct solution—is to be provided. Here a sequence of outputs, or hypothetical solutions, is output, with fi...

Optimizing interconnection networks is a prime object in switching schemes. In this work the authors present a novel approach for obtaining a required channel arrangement in a multi-stage interconnection network, using a new concept – a fundamental arrangement. The fundamental arrangement is an initial N-1 stage switch arrangement that allows obtaining any required output channel arrangement gi...

An optimizing compiler consists of a front end parsing a textual programming language into an intermediate representation (IR), a middle end performing optimizations on the IR, and a back end lowering the IR to a target representation (TR) built of operations supported by the target hardware. In modern compiler construction graph-based IRs are employed. Optimization and lowering tasks can then ...

We have designed and implemented a type inference algorithm for the full Self language. Thc algorithm can guarantee the safety and disambiguity of message sends, and provide useful information for browsers and optimizing compilers. Self features objects with dynamic inheritance. This construct has until now been considered incompatible with type inference because it allows the inheritance graph...

We show how to construct a one-pass optimizing transformation by fusing a non-optimizing transformation with an optimization pass. We state the transformation in build form and the optimization pass in cata form, i.e., as a catamorphism; and we use cata/build fusion to combine them. We illustrate the method by fusing Plotkin’s call-by-value and call-by-name CPS transformations with a reduction-...