See this document in CiteSeerX!

Incremental Program Analysis via Language Factors (2002)  (Make Corrections)  (2 citations)
Oege de Moor, Stephen Drape, David Lacey, Ganesh Sittampalam



  Home/Search   Context   Related

 
View or download:
comlab.ox.ac.uk/oucl/work/oege...tok.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  web.comlab.ox.ac.uk/oucl/w...pubs (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We aim to specify program transformations in a declarative style, and then to generate efficient program transformers from such specifications. Many transformations require nontrivial 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. (Update)

Context of citations to this paper:   More

.... it is desirable to compute those compositionally in terms of p, that is by induction on the structure of L(p) In a companion paper [7] we have described a compositional algorithm for achieving just that (presented in the context of program analysis with side conditions...

Cited by:   More
Regular Algebra Applied to Language Problems - Backhouse (2004)   (Correct)
Static Analysis of Aspects - Sereni, de Moor (2002)   (Correct)

Similar documents (at the sentence level):
20.5%:   Incremental Execution of Transformation Specifications - Ganesh Sittampalam Ganesh (2004)   (Correct)

Active bibliography (related documents):   More   All
0.7:   Computation of Interprocedural Control Dependencies - Harrold, Rothermel, Sinha (1998)   (Correct)
0.6:   Universal Regular Path Queries - de Moor, Lacey, Van Wyk (2001)   (Correct)
0.5:   CSSV: Towards a Realistic Tool for Statically Detecting All.. - Dor, Rodeh, Sagiv (2000)   (Correct)

Similar documents based on text:   More   All
0.5:   Imperative Program Transformation By Rewriting - Lacey, de Moor (2001)   (Correct)
0.3:   Generic Program Transformation - de Moor, Sittampalam (1998)   (Correct)
0.3:   Higher-order Matching for Program Transformation - de Moor, Sittampalam (1999)   (Correct)

Related documents from co-citation:   More   All
2:   Chapman and Hall (context) - Conway, Finite - 1971

BibTeX entry:   (Update)

O. de Moor, S. Drape, D. Lacey, and G. Sittampalam. Incremental program analysis via language factors. submitted for publication, 2002. http://citeseer.ist.psu.edu/demoor02incremental.html   More

@misc{ moor02incremental,
  author = "O. de Moor and S. Drape and D. Lacey and G. Sittampalam",
  title = "Incremental program analysis via language factors",
  note = "submitted for publication",
  year = "2002",
  url = "citeseer.ist.psu.edu/demoor02incremental.html" }
Citations (may not include all citations):
248   The mathematics of sentence structure (context) - Lambek - 1958
245   Semantics of context-free languages (context) - Knuth - 1968
97   Chapman and Hall (context) - Conway, Finite - 1971
70   An interval-based approach to exhaustive and incremental int.. (context) - Burke - 1990
66   Derivatives of regular expressions (context) - Brzozowski - 1964
59   A Logical Approach to Discrete Math (context) - Gries, Schneider - 1993
38   Practical program analysis using general purpose logic progr.. (context) - Dawson, Ramakrishnan et al. - 1996
26   Incremental evaluation for attribute grammars with applicati.. (context) - Demers, Reps et al. - 1981
24   Imperative program transformation by rewriting - Lacey, de Moor - 2027
19   Incremental model checking in the modal mu-calculus - Sokolsky, Smolka - 1994
16   Proving correctness of compiler optimizations by temporal lo.. - Lacey, Jones et al. - 2002
16   Model checking of unrestricted hierarchical state machines - Benedikt, Godefroid et al. - 2001
14   Conditions for incremental iteration: Examples and counterex.. (context) - Ryder, Marlowe et al. - 1988
12   Data ow analysis as model checking (context) - Ste - 1991
12   The weakest prespeci cation (context) - Hoare, He - 1986
12   The weakest prespeci cation (context) - Hoare, He - 1986
9   Bilinear logic in algebra and linguistics (context) - Lambek - 1995
9   A uni ed approach to path problems (context) - Tarjan - 1981
8   Using model checking in a parallelizing compiler (context) - Rus, Van Wyk - 1998
7   An approach for exploring code-improving transformations (context) - eld, So - 1997
7   Transactions of the American Mathematical Society (context) - Dilworth, lattices - 1939
6   Deciding DPDA equivalence is primitive recursive - Stirling - 2002
6   A calculation approach to mathematical induction (context) - Doornbos, Backhouse et al. - 1997
6   Automatic generation of xed-point- nding evaluators for circ.. (context) - Farrow - 1986
5   decidability results from complete formal systems (context) - enizergues - 2001
4   Solving regular path queries - Liu, Yu - 2002
4   Taming control ow: a structured approach to eliminating GOTO.. (context) - Erosa, Hendren - 1994
4   failure functions and bi-trees (context) - Backhouse, Lutz - 1977
4   Incremental data ow analysis algorithms (context) - Ryder, Paull - 1988
4   Functional incremental attribute evaluation - Saraiva, Swierstra et al. - 2000
2   An incremental ow- and context-sensitive pointer aliasing an.. (context) - Yur, Ryder et al. - 1999
2   An ecient hybrid algorithm for incremental data ow analysis (context) - Marlowe, Ryder - 1990
2   An incremental version of iterative data ow analysis (context) - Pollock, So - 1989
1   Incremental data ow analysis via dominator and attribute upd.. (context) - Carroll, Ryder - 1988
1   Available URL httpwww (context) - Lichtenberg, at et al. - 2001
1   volume 25 of American Mathematical Society Colloquium Public.. (context) - Birkho, Theory - 1967
1   Accepted for publication at PPDP (context) - Drape, de Moor et al. - 2002
1   Ecient computation of ow insensitive interprocedural summary.. (context) - Cooper, Kennedy - 1984
1   Available URL httpwww (context) - Russo, ML et al. - 2000
1   A critical analysis of incremental iterative data ow analysi.. (context) - Burke, Ryder - 1990
1   Accepted for publication in Higher-order and Symbolic Comput.. (context) - de Moor, Lacey et al. - 2002
1   Available at URL http: //www (context) - Lind-Nielsen - 2001

Documents on the same site (http://web.comlab.ox.ac.uk/oucl/work/oege.demoor/pubs.htm):   More
Container Types Categorically - Hoogendijk, de Moor (2000)   (Correct)
Generic Programming With Relations and Functors - Bird, de Moor, Hoogendijk (1999)   (Correct)
Compiling Embedded Languages - Elliott, Finne, de Moor (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC