Sciweavers

IPL
2008
118views more  IPL 2008»
13 years 4 months ago
Slicing for modern program structures: a theory for eliminating irrelevant loops
Slicing is a program transformation technique with numerous applications, as it allows the user to focus on the parts of a program that are relevant for a given purpose. Ideally, ...
Torben Amtoft
IJFCS
2008
81views more  IJFCS 2008»
13 years 4 months ago
Reachability Analysis in Verification via Supercompilation
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
Alexei Lisitsa, Andrei P. Nemytykh
IJCAI
1989
13 years 5 months ago
Explanation Based Program Transformation
Fold-unfold is a well known program transformation technique. Its major drawback is that folding requires an Eureka step to invent new procedures. In the context of logic programm...
Maurice Bruynooghe, Luc De Raedt, Danny De Schreye
SFP
2004
13 years 6 months ago
Calculating an exceptional machine
: In previous work we showed how to verify a compiler for a small language with exceptions. In this article we show how to calculate, as opposed to an abstract machine for this lan...
Graham Hutton, Joel Wright
CC
2005
Springer
120views System Software» more  CC 2005»
13 years 10 months ago
Data Slicing: Separating the Heap into Independent Regions
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
Jeremy Condit, George C. Necula