| |
Browse All Reviews > Computing Methodologies (I) > Artificial Intelligence (I.2) > Automatic Programming (I.2.2) > Program Transformation (I.2.2...)
|
|
 |
|
|
| |
|
|
| |
1-9 of 9
Reviews about "Program Transformation (I.2.2...)":
|
Date Reviewed |
| |
Imperative-program transformation by instrumented-interpreter specialization
Debois S. Higher-Order and Symbolic Computation 21(1-2): 37-58, 2008. Type: Article
The interpretive approach is an appealing program transformation technique. Loosely speaking, it amounts to designing a nonstandard interpreter that exhibits a particular good behavior with regard to some criterion, and then specializi...
|
Jan 22 2009 |
| |
Efficient search-space pruning for integrated fusion and tiling transformations
Gao X., Krishnamoorthy S., Sahoo S., Lam C., Baumgartner G., Ramanujam J., Sadayappan P. Concurrency and Computation: Practice & Experience 19(18): 2425-2443, 2007. Type: Article
Compile-time optimizations involve a large number of transformations. Selecting the appropriate transformations to minimize the execution time is a challenging task. This paper deals with an extremely specialized problem, and suggests ...
|
Apr 25 2008 |
| |
Abstract slicing: a new approach to program slicing based on abstract interpretation and model checking
Seok Hong H., Lee I., Sokolsky O. Source code analysis and manipulation (Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM’05),25-34, 2005. Type: Proceedings
Program slicing [1] is a technique for extracting those sentences of a program that affect or are affected by a given slicing criterion. Since this technique was introduced in 1984, many other approaches (such as constraint slicing and...
|
Jan 10 2006 |
| |
Transforming constraint logic programs
Bensaou N., Guessarian I. Theoretical Computer Science 206(1/2): 81-125, 1998. Type: Article
Program transformation systems have been widely studied within thefield of logic programs. This paper extends such systems to constraintlogic programs. First, the authors define a semantics for constraintlogic programs that extends the...
|
Jul 1 1999 |
| |
A method for specializing logic programs
Bossi A., Cocco N., Dulli S. ACM Transactions on Programming Languages and Systems 12(2): 253-302, 1990. Type: Article
The authors address the problem of deriving new logic programs from old ones via a specialization method that is related to program transformation techniques. The paper describes the basic rules for the specialization process and provi...
|
Jan 1 1992 |
| |
Automatic transformation of series expressions into loops
Waters R. ACM Transactions on Programming Languages and Systems 13(1): 52-98, 1991. Type: Article
A series is a possibly unbounded sequence of values. Compositions of functions that operate on series are generally briefer and more easily understood than alternative expressions of the same computation, for example, the sum of the sq...
|
Jan 1 1992 |
| |
Automating the transformational development of software
Fickas S. IEEE Transactions on Software Engineering SE-11(11): 1268-1277, 1985. Type: Article
The author of this paper is a strong supporter of the view that systems should be developed as formal specifications, that system modifications should also be first introduced in specifications, and that programs should be generated fr...
|
Feb 1 1987 |
| |
On convergence toward a database of program transformations
Barstow D. ACM Transactions on Programming Languages and Systems 7(1): 1-9, 1985. Type: Article
The author introduces the notion of convergence in a rule base as an alternative to completeness. He begins with a brief review of some examples of rule collections for programming. The examples are taken from various app...
|
Jul 1 1985 |
| |
Eliminating Redundant Recursive Calls.
Cohen N. ACM Transactions on Programming Languages and Systems 5(3): 265-299, 1983. Type: Article
The methods of tabulating results of recursive calls to avoid their recomputations are surveyed in [1]. The reviewed paper considers a rather special, theoretically simple, yet practically significant (as demonstrated by numerous exam...
|
Feb 1 1985 |
| |
|
|
| |
|
|
