2000 search results - page 31 / 400 » Program Transformation and Proof Transformation |
DRMTICS
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we propose a new scheme for software obfuscation and license protection that is based on an original transformation of the program’s call tree. The idea is based on...
STACS
2001
Springer
15 years 2 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
STTT
2010
14 years 8 months ago
2010
This article proposes a case study to evaluate the suitability of graph transformation tools for program refactoring. In order to qualify for this purpose, a graph transformation s...
ASIAN
1999
Springer
15 years 2 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
IJCAI
1989
14 years 11 months ago
1989
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...