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

We build a SAT solver implementing the DPLL algorithm in theverification-enabled programming language Dafny. The resulting solver is fullyverified (soundness, completeness and termination are computer checked). Webenchmark our Dafny solver and we show that it is just as efficient as anequivalent DPLL solver implemented in C# and roughly two times less efficientthan an equivalent solver written in C++. We conclude that auto-activeverification is a promising approach to increasing trust in SAT solvers, as itcombines a good trade-off between execution speed and degree of trustworthinessof the final product.

Who Verifies the Verifiers? A Computer-Checked Implementation of the DPLL Algorithm in Dafny