Incremental execution of transformation specifications Export

@article{citeulike:5233266, 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.}, address = {New York, NY, USA}, author = {Sittampalam, Ganesh and de Moor, Oege and Larsen, Ken F.}, citeulike-article-id = {5233266}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=982962.964004}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/982962.964004}, doi = {10.1145/982962.964004}, issn = {0362-1340}, journal = {SIGPLAN Not.}, keywords = {logic-programming, partial-evaluation, program-transformation}, number = {1}, pages = {26--38}, posted-at = {2009-07-23 00:17:07}, priority = {2}, publisher = {ACM}, title = {Incremental execution of transformation specifications}, url = {http://dx.doi.org/10.1145/982962.964004}, volume = {39}, year = {2004} }

TY - JOUR ID - citeulike:5233266 L3 - citeulike-article-id:5233266 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. IS - 1 JF - SIGPLAN Not. SN - 0362-1340 AD - New York, NY, USA EP - 38 TI - Incremental execution of transformation specifications PB - ACM VL - 39 SP - 26 KW - logic-programming KW - partial-evaluation KW - program-transformation AU - Sittampalam, Ganesh AU - de Moor, Oege AU - Larsen, Ken PY - 2004/// UR - http://dx.doi.org/10.1145/982962.964004 ER -