125 search results - page 1 / 25 » Transforming Normal Programs by Replacement |
META
1992
13 years 11 months ago
1992
The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation ...
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
SPIN
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. This paper describes three program transformations that extend the scope of model checkers for Java programs to include distributed programs, i.e., multi-process programs...
SCAM
2006
IEEE
14 years 1 months ago
2006
IEEE
Programmers often want to transform the source or binary representations of their programs (e.g., to optimize, add dynamic safety checks, or add profile gathering code). Unfortun...
ASIAN
1999
Springer
13 years 11 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...