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 present a sound static analysis technique for fighting the combinatorialexplosion of parameterised Boolean equation systems (PBESs). These essentiallyare systems of mutually recursive fixed point equations ranging overfirst-order logic formulae. Our method detects parameters that are not live byanalysing a control flow graph of a PBES, and it subsequently eliminates suchparameters. We show that a naive approach to constructing a control flow graph,needed for the analysis, may suffer from an exponential blow-up, and we definean approximate analysis that avoids this problem. The effectiveness of ourtechniques is evaluated using a number of case studies.

Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction