English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we show how previous work on escape analysis can be adapted and extended to yield a static analysis that is ecient yet eective for reducing the number of interference dependence edges considered while slicing concurrent Java programs. The key idea is to statically detect situations where run-time heap objects are reachable from a single thread and use it to prune spurious interference dependence edges. We also show how this analysis can be extended to reduce the number of ready dependence edges - dependences that capture indefinite delay due to Java synchronization constructs. The analysis we describe has been implemented in the Bandera(9) slicer which is being applied to reduce the size of software models for model- checking. Using this implementation, we give experimental results that demonstrate the eectiveness of our approach. We believe leveraging es- cape information in the manner we describe is a crucial element in scaling slicing techniques to larger concurrent object-oriented programs.

Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs