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

Datalog has become a popular language for writing static analyses. BecauseDatalog is very limited, some implementations of Datalog for static analysishave extended it with new language features. However, even with these featuresit is hard or impossible to express a large class of analyses because they uselogical formulae to represent program state. FormuLog fills this gap byextending Datalog to represent, manipulate, and reason about logical formulae.We have used FormuLog to implement declarative versions of symbolic executionand abstract model checking, analyses previously out of the scope ofDatalog-based languages. While this paper focuses on the design of FormuLog andone of the analyses we have implemented in it, it also touches on a prototypeimplementation of the language and identifies performance optimizations that webelieve will be necessary to scale FormuLog to real-world static analysisproblems.

FormuLog: Datalog for static analysis involving logical formulae