Incremental data-flow analysis algorithms

Ryder, Barbara G.; Paull, Marvin C.

doi:10.1145/42192.42193

Cited by 77 publications

(19 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…IDE provides a window to write serial code and shows vital information about concurrency to the user. There are many techniques that propose the analysis of code during development like incremental parsing [21], incremental dependency analysis [53], [54], [55], incremental profiling [19], [41], [16], incremental flow graph analysis [17], [42], and so on. Still, identifying and updating data dependency information dynamically, while the code is in development phase poses many challenges.…”

Section: Easyparmentioning

confidence: 99%

A Review of Parallelization Tools and Introduction to Easypar

Sah¹,

Vaidya²

2012

IJCA

View full text Add to dashboard Cite

Multicore processors have paved the way to increase the performance of any application by the virtue of benefits of parallelization. However, exploiting parallelism from a program is not easy, as it requires parallel programming expertise. In addition, manual parallelization is a cumbersome, time consuming and inefficient process. A number of tools proposed in the past ease the effort of parallel programming. This paper presents a classification of such parallelization tools. The classification is based on different eras of tool development, role playedby these tools in various parallelization stages, and features provided by parallel program assistance tools. Classification of tools concludes with a discussion on requirements of futuristic parallelization tools. Finally, this paper proposesour on-going work about the development of a parallel program assistance tool called EasyPar, which is a parallel program assistance tool.

show abstract

Section: Easyparmentioning

confidence: 99%

A Review of Parallelization Tools and Introduction to Easypar

Sah¹,

Vaidya²

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…A variety of incremental algorithms have been developed for data flow analysis problems. Some of them use the elimination method [6,8,25]; others are based on restarting iterations [24], while both techniques are combined in [22]. A comparison of incremental iterative algorithms for data flow analysis can be found in [7].…”

Section: Related Workmentioning

confidence: 99%

Automatic Incrementalization of Prolog Based Static Analyses

Eichberg

Kahl

Saha

et al. 2006

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Abstract. Modern development environments integrate various static analyses into the build process. Analyses that analyze the whole project whenever the project changes are impractical in this context. We present an approach to automatic incrementalization of analyses that are specified as tabled logic programs and evaluated using incremental tabled evaluation, a technique for efficiently updating memo tables in response to changes in facts and rules. The approach has been implemented and integrated into the Eclipse IDE. Our measurements show that this technique is effective for automatically incrementalizing a broad range of static analyses.

show abstract

“…Efforts for coming up with incremental approaches are known in the context of program analysis (see [17,7,14,15]) and program verification (see [18,9,16]). Our work is more closely related to incremental program analysis, although the design of our incremental checking algorithm is notably different from the design of an incremental analyzer (like the ones in [7,14]).…”

Section: Definition 4 (Incremental Checker)mentioning

confidence: 99%

An Incremental Approach to Abstraction-Carrying Code

Albert

Arenas

Puebla

2006

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Abstract. Abstraction-Carrying Code (ACC) has recently been proposed as a framework for Proof-Carrying Code (PCC) in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. Existing approaches for PCC are developed under the assumption that the consumer reads and validates the entire program w.r.t. the full certificate at once, in a non incremental way. In the context of ACC, we propose an incremental approach to PCC for the generation of certificates and the checking of untrusted updates of a (trusted) program, i.e., when a producer provides a modified version of a previously validated program. Our proposal is that, if the consumer keeps the original (fixed-point) abstraction, it is possible to provide only the program updates and the incremental certificate (i.e., the difference of abstractions). Furthermore, it is now possible to define an incremental checking algorithm which, given the new updates and its incremental certificate, only re-checks the fixpoint for each procedure affected by the updates and the propagation of the effect of these fixpoint changes. As a consequence, both certificate transmission time and checking time can be reduced significantly.

show abstract

Incremental data-flow analysis algorithms

Cited by 77 publications

References 31 publications

A Review of Parallelization Tools and Introduction to Easypar

A Review of Parallelization Tools and Introduction to Easypar

Automatic Incrementalization of Prolog Based Static Analyses

An Incremental Approach to Abstraction-Carrying Code

Contact Info

Product

Resources

About