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

Dynamic Pushdown Networks (DPNs) are a model for multithreaded programs withrecursion and dynamic creation of threads. In this paper, we propose a temporallogic called NTL for reasoning about the call- and return- as well as threadcreation behaviour of DPNs. Using tree automata techniques, we investigate themodel checking problem for the novel logic and show that its complexity is nothigher than that of LTL model checking against pushdown systems despite a moreexpressive logic and a more powerful system model. The same holds true for thesatisfiability problem when compared to the satisfiability problem for arelated logic for reasoning about the call- and return-behaviour of pushdownsystems. Overall, this novel logic offers a promising approach for theverification of recursive programs with dynamic thread creation.

A Navigation Logic for Recursive Programs with Dynamic Thread Creation