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

Model checking and automated theorem proving are two pillars of formalmethods. This paper investigates model checking from an automated theoremproving perspective, aiming at combining the expressiveness of automatedtheorem proving and the complete automaticity of model checking. The focus ofthis paper is on the verification of temporal logic properties of Kripkemodels. The main contributions of this paper are: first the definition of anextended computation tree logic that allows polyadic predicate symbols, then aproof system for this logic, taking Kripke models as parameters, then, thedesign of a proof-search algorithm for this calculus and a new automatedtheorem prover to implement it. The verification process is completelyautomatic, and produces either a counterexample when the property does nothold, or a certificate when it does. The experimental result compares well toexisting state-of-the-art tools on some benchmarks, including an application toair traffic control and the design choices that lead to this efficiency arediscussed.

SCTL: Towards Combining Model Checking and Proof Checking