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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Dartagnan is a bounded model checker for concurrent programs under weak memory models. What makes it different from other tools is that the memory model is not hard-coded inside  Dartagnan but taken as part of the input. For  SV-COMP ’20, we take as input sequential consistency (i.e. the standard interleaving memory model) extended by support for atomic blocks. Our point is to demonstrate that a universal tool can be competitive and perform well in  SV-COMP . Being a bounded model checker,  Dartagnan ’s focus is on disproving safety properties by finding counterexample executions. For programs with bounded loops,  Dartagnan performs an iterative unwinding that results in a complete analysis. The  SV-COMP ’20 version of  Dartagnan works on  Boogie code. The C programs of the competition are translated internally to  Boogie using  SMACK .

Dartagnan: Bounded Model Checking for Weak Memory Models (Competition Contribution)