Add to ORKGA program scheme which models straight line code admitting structured variables such as arrays, lists, queues, etc. is considered. A set of expressions is associated with a program reflecting the input-output tranformations. A basic set of axioms is given and program equivalence is defined in terms of expression equivalence. Program transformations are then defined such that two programs are equivalent if and only if one program can be transformed to the other via the transformations. An application of these results to code optimization is then discussed
Programmers typically have knowledge about properties of their programs that aren't explicitly expre...
abstract: The central goal of this thesis is to develop a practical approach to validating the corre...
To propose methods for making Equivalent Transformation (ET) rules is important for generating corre...
We consider a class of straight line programs admitting structured variables. It is easy to associat...
AbstractWe study transformations and equivalences of recursive program schemes. We give an optimizat...
Our objective is to find large classes of equivalent programs which can be simply characterized so t...
We consider the simplification of logic programs under the stablemodel semantics, with respect to t...
AbstractA program schema defines a class of programs, all of which have identical statement structur...
Abstract. Typically, a combination of manual and automated transformations is applied when algorithm...
The aim is to construct the mathematical bases for analysis of the semantic properties and equivalen...
Abstract. We study the notion of strong equivalence between two An-swer Set programs and we show how...
A program schema defines a class of programs, all of which have identical state-ment structure, but ...
A program schema defines a class of programs, all of which have identical statement structure, but w...
We define an algorithm to be the set of programs that implement or express that algorithm. The set o...
AbstractA compiler optimization is sound if the optimized program that it produces is semantically e...
Programmers typically have knowledge about properties of their programs that aren't explicitly expre...
abstract: The central goal of this thesis is to develop a practical approach to validating the corre...
To propose methods for making Equivalent Transformation (ET) rules is important for generating corre...
We consider a class of straight line programs admitting structured variables. It is easy to associat...
AbstractWe study transformations and equivalences of recursive program schemes. We give an optimizat...
Our objective is to find large classes of equivalent programs which can be simply characterized so t...
We consider the simplification of logic programs under the stablemodel semantics, with respect to t...
AbstractA program schema defines a class of programs, all of which have identical statement structur...
Abstract. Typically, a combination of manual and automated transformations is applied when algorithm...
The aim is to construct the mathematical bases for analysis of the semantic properties and equivalen...
Abstract. We study the notion of strong equivalence between two An-swer Set programs and we show how...
A program schema defines a class of programs, all of which have identical state-ment structure, but ...
A program schema defines a class of programs, all of which have identical statement structure, but w...
We define an algorithm to be the set of programs that implement or express that algorithm. The set o...
AbstractA compiler optimization is sound if the optimized program that it produces is semantically e...
Programmers typically have knowledge about properties of their programs that aren't explicitly expre...
abstract: The central goal of this thesis is to develop a practical approach to validating the corre...
To propose methods for making Equivalent Transformation (ET) rules is important for generating corre...