Code generation based on formal BURS theory and heuristic search

Code generation based on formal BURS theory and heuristic search (1997)

by A. Nymeyer , J.-P. Katoen

Venue:	Acta Informatica
Citations:	18 - 2 self

User correction supplied by ppodgoretsky

Datum	Value	Source
TITLE	Code generation based on formal BURS theory and heuristic search	user correction
AUTHOR NAME	A. Nymeyer	user correction
AUTHOR AFFIL	University of Twente, Department of Computer Science	user correction
AUTHOR ADDR	P.O. Box 217, 7500 AE Enschede, The Netherlands	user correction
AUTHOR NAME	J.-P. Katoen	user correction
AUTHOR AFFIL	University of Twente, Department of Computer Science	user correction
AUTHOR ADDR	P.O. Box 217, 7500 AE Enschede, The Netherlands	user correction
ABSTRACT	BURS theory provides a powerful mechanism to efficiently generate pattern matches in a given expression tree. BURS, which stands for bottom-up rewrite system, is based on term rewrite systems, to which costs are added. We formalise the underlying theory, and derive an algorithm that computes all pattern matches. This algorithm terminates if the term rewrite system is finite. We couple this algorithm with the well-known search algorithm A* that carries out pattern selection. The search algorithm is directed by a cost heuristic that estimates the minimum cost of code that has yet to be generated. The advantage of using a search algorithm is that we need to compute only those costs that may be part of an optimal rewrite sequence (and not the costs of all possible rewrite sequences as in dynamic programming). A system that implements the algorithms presented in this work has been built.	user correction
YEAR	1997	user correction
VENUE	Acta Informatica	user correction
CITATIONS	40 found	ParsCit 1.0