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

Asynchronous message-passing systems are employed frequently to implementdistributed mechanisms, protocols, and processes. This paper addresses theproblem of precise data flow analysis for such systems. To obtain goodprecision, data flow analysis needs to somehow skip execution paths that readmore messages than the number of messages sent so far in the path, as suchpaths are infeasible at run time. Existing data flow analysis techniques doelide a subset of such infeasible paths, but have the restriction that theyadmit only finite abstract analysis domains. In this paper we propose ageneralization of these approaches to admit infinite abstract analysis domains,as such domains are commonly used in practice to obtain high precision. We haveimplemented our approach, and have analyzed its performance on a set of 14benchmarks. On these benchmarks our tool obtains significantly higher precisioncompared to a baseline approach that does not elide any infeasible paths and toanother baseline that elides infeasible paths but admits only finite abstractdomains.

Data Flow Analysis of Asynchronous Systems using Infinite Abstract Domains