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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We consider the problem of detecting data races in program traces that havebeen compressed using straight line programs (SLP), which are specialcontext-free grammars that generate exactly one string, namely the trace thatthey represent. We consider two classical approaches to race detection ---using the happens-before relation and the lockset discipline. We presentalgorithms for both these methods that run in time that is linear in the sizeof the compressed, SLP representation. Typical program executions almost alwaysexhibit patterns that lead to significant compression. Thus, our algorithms areexpected to result in large speedups when compared with analyzing theuncompressed trace. Our experimental evaluation of these new algorithms onstandard benchmarks confirms this observation.

Data Race Detection on Compressed Traces