Incremental Execution of Transformation Specifications
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Standard
Incremental Execution of Transformation Specifications. / Sittampalam, Ganesh; de Moor, Oege; Larsen, Ken Friis.
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. Association for Computing Machinery, 2004. p. 26.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - Incremental Execution of Transformation Specifications
AU - Sittampalam, Ganesh
AU - de Moor, Oege
AU - Larsen, Ken Friis
PY - 2004
Y1 - 2004
N2 - We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-trivial program analysis to check their applicability, and it is prohibitively expensive to re-run such analyses after each transformation. It is desirable, therefore, that the analysis information is incrementally updated.We achieve this by drawing on two pieces of previous work: first, Bernhard Steffen's proposal to use model checking for certain analysis problems, and second, John Conway's theory of language factors. The first allows the neat specification of transformations, while the second opens the way for an incremental implementation. The two ideas are linked by using regular patterns instead of Steffen's modal logic: these patterns can be viewed as queries on the set of program paths.
AB - We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-trivial program analysis to check their applicability, and it is prohibitively expensive to re-run such analyses after each transformation. It is desirable, therefore, that the analysis information is incrementally updated.We achieve this by drawing on two pieces of previous work: first, Bernhard Steffen's proposal to use model checking for certain analysis problems, and second, John Conway's theory of language factors. The first allows the neat specification of transformations, while the second opens the way for an incremental implementation. The two ideas are linked by using regular patterns instead of Steffen's modal logic: these patterns can be viewed as queries on the set of program paths.
U2 - 10.1145/964001.964004
DO - 10.1145/964001.964004
M3 - Article in proceedings
SP - 26
BT - Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PB - Association for Computing Machinery
Y2 - 29 November 2010
ER -
ID: 9293260