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

Reachability analysis is a fundamental program analysis with a wide varietyof applications. We present FlowCFL, a framework for type-based reachabilityanalysis in the presence of mutable data. Interestingly, the underlyingsemantics of FlowCFL is CFL-reachability.  We make three contributions. First, we define a dynamic semantics thatcaptures the notion of flow commonly used in reachability analysis. Second, weestablish correctness of CFL-reachability over graphs with inverse edges(inverse edges are necessary for the handling of mutable heap data). Ourapproach combines CFL-reachability with reference immutability to avoid theaddition of certain infeasible inverse edges and we demonstrate empiricallythat avoiding those edges results in precision improvement. Our formal accountof correctness extends to this case as well. Third, we present a type-basedreachability analysis and establish equivalence between a certainCFL-reachability analysis and the type-based analysis, thus proving correctnessof the type-based analysis.

FlowCFL: A Framework for Type-based Reachability Analysis in the Presence of Mutable Data