Optimizing Program Size Using Multi-result Supercompilation

08/07/2020
by   Dimitur Nikolaev Krustev, et al.
0

Supercompilation is a powerful program transformation technique with numerous interesting applications. Existing methods of supercompilation, however, are often very unpredictable with respect to the size of the resulting programs. We consider an approach for controlling result size, based on a combination of multi-result supercompilation and a specific generalization strategy, which avoids code duplication. The current early experiments with this method show promising results - we can keep the size of the result small, while still performing powerful optimizations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2020

Controlling the Size of Supercompiled Programs using Multi-result Supercompilation

Supercompilation is a powerful program transformation technique with num...
research
08/20/2019

Polyvariant Program Specialisation with Property-based Abstraction

In this paper we show that property-based abstraction, an established te...
research
06/19/2011

Rewriting Ontological Queries into Small Nonrecursive Datalog Programs

We consider the setting of ontological database access, where an Abox is...
research
02/26/2021

Synthesizing Safe and Efficient Kernel Extensions for Packet Processing

Extended Berkeley Packet Filter (BPF) has emerged as a powerful method t...
research
07/29/2019

Proposition d'un modèle pour l'optimisation automatique de boucles dans le compilateur Tiramisu : cas d'optimisation de déroulage

Computer architectures become more and more complex. It requires more ef...
research
07/10/2023

Can You Improve My Code? Optimizing Programs with Local Search

This paper introduces a local search method for improving an existing pr...
research
02/19/2020

On Function Description

The main result is that: function descriptions are not made equal, and t...

Please sign up or login with your details

Forgot password? Click here to reset