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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We examine verification of concurrent programs under the total store ordering(TSO) semantics used by the x86 architecture. In our model, threads manipulatevariables over infinite domains and they can check whether variables arerelated for a range of relations. We show that, in general, the control statereachability problem is undecidable. This result is derived through a reductionfrom the state reachability problem of lossy channel systems with data (whichis known to be undecidable). In the light of this undecidability, we turn ourattention to a more tractable variant of the reachability problem.Specifically, we study context bounded runs, which provide anunder-approximation of the program behavior by limiting the possibleinteractions between processes. A run consists of a number of contexts, witheach context representing a sequence of steps where a only single designatedthread is active. We prove that the control state reachability problem underbounded context switching is PSPACE complete.

Verification under TSO with an infinite Data Domain