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/

Zendy Plus

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

Zendy Tools

Zendy Open

A classical result by Ramalingam about synchronization-sensitiveinterprocedural program analysis implies that reachability for concurrentthreads running recursive procedures is undecidable. A technique proposed byQadeer and Rehof, to bound the number of context switches allowed between thethreads, leads to an incomplete solution that is, however, believed to catch"most bugs" in practice. The question whether the technique can also prove theabsence of bugs at least in some cases has remained largely open.  In this paper we introduce a broad verification methodology forresource-parameterized programs that observes how changes to the resourceparameter affect the behavior of the program. Applied to the context-unboundedanalysis problem (CUBA), the methodology results in partial verificationtechniques for procedural concurrent programs. Our solutions may not terminate,but are able to both refute and prove context-unbounded safety for concurrentrecursive threads. We demonstrate the effectiveness of our method using avariety of examples, the safe of which cannot be proved safe by earlier,context-bounded methods.

CUBA: Interprocedural Context-UnBounded Analysis of Concurrent Programs (Extended Manuscript)