Incremental Execution of Transformation Specifications

Ganesh Sittampalam, Oege de Moor, Ken Friis Larsen

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Number of pages38
PublisherAssociation for Computing Machinery
Publication date2004
Pages26
DOIs
Publication statusPublished - 2004
Externally publishedYes
EventAnnual Symposium on Principles of Programming Languages (POPL) - Venice, Italy
Duration: 29 Nov 2010 → …

Conference

ConferenceAnnual Symposium on Principles of Programming Languages (POPL)
Country/TerritoryItaly
CityVenice
Period29/11/2010 → …

Fingerprint

Dive into the research topics of 'Incremental Execution of Transformation Specifications'. Together they form a unique fingerprint.

Cite this