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

Static alias analysis of different type of programming languages has beendrawing researcher attention. However most of the results of existingtechniques for alias analysis are not precise enough compared to needs ofmodern compilers. Probabilistic versions of these results, in which resultelements are associated with occurrence probabilities, are required inoptimizations techniques of modern compilers.  This paper presents a new probabilistic approach for alias analysis ofparallel programs. The treated parallelism model is that of SPMD where in SPMD,a program is executed using a fixed number of program threads running ondistributed machines on different data. The analyzed programs are assumed to bein the static single assignment (SSA) form which is a program representationform facilitating program analysis. The proposed technique has the form ofsimply-strictured system of inference rules. This enables using the system inapplications like Proof-Carrying Code (PPC) which is a general technique forproving the safety characteristics of modern programs.

Probabilistic Alias Analysis for Parallel Programming in SSA Forms