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

This paper shows that a variety of software model-checking algorithms can beseen as proof-search strategies for a non-standard proof system, known as acyclic proof system. Our use of the cyclic proof system as a logical foundationof software model checking enables us to compare different algorithms, toreconstruct well-known algorithms from a few simple principles, and to obtainsoundness proofs of algorithms for free. Among others, we show the significanceof a heuristics based on a notion that we call maximal conservativity; thisexplains the cores of important algorithms such as property-directedreachability (PDR) and reveals a surprising connection to an efficient solverof games over infinite graphs that was not regarded as a kind of PDR.

Software Model-Checking as Cyclic-Proof Search