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

Sittampalam, G, de Moor, O & Larsen, KF 2004, Incremental Execution of Transformation Specifications. in Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. Association for Computing Machinery, pp. 26, Annual Symposium on Principles of Programming Languages (POPL), Venice, Italy, 29/11/2010. https://doi.org/10.1145/964001.964004

APA

Sittampalam, G., de Moor, O., & Larsen, K. F. (2004). Incremental Execution of Transformation Specifications. In Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (pp. 26). Association for Computing Machinery. https://doi.org/10.1145/964001.964004

Vancouver

Sittampalam G, de Moor O, Larsen KF. Incremental Execution of Transformation Specifications. In Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. Association for Computing Machinery. 2004. p. 26 https://doi.org/10.1145/964001.964004

Author

Sittampalam, Ganesh ; de Moor, Oege ; Larsen, Ken Friis. / Incremental Execution of Transformation Specifications. Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages. Association for Computing Machinery, 2004. pp. 26

Bibtex

@inproceedings{f812ecd0cfab11dd9473000ea68e967b,
title = "Incremental Execution of Transformation Specifications",
abstract = "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.",
author = "Ganesh Sittampalam and {de Moor}, Oege and Larsen, {Ken Friis}",
year = "2004",
doi = "10.1145/964001.964004",
language = "English",
pages = "26",
booktitle = "Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages",
publisher = "Association for Computing Machinery",
note = "null ; Conference date: 29-11-2010",

}

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