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

The treewidth of control flow graphs arising from structured programs isknown to be at most six. However, as a control flow graph is inherentlydirected, it makes sense to consider a measure of width for digraphs instead.We use the so-called DAG-width and show that the DAG-width of control flowgraphs arising from structured (goto-free) programs is at most three.Additionally, we also give a linear time algorithm to compute the DAGdecomposition of these control flow graphs. One consequence of this result isthat parity games (and hence the $\mu$-calculus model checking problem), whichare known to be tractable on graphs of bounded DAG-width, can be solvedefficiently in practice on control flow graphs.

DAG-width of Control Flow Graphs with Applications to Model Checking