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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Separation logics are a family of extensions of Hoare logic for reasoningabout programs that mutate memory. These logics are "abstract" because they areindependent of any particular concrete memory model. Their assertion languages,called propositional abstract separation logics, extend the logic of (Boolean)Bunched Implications (BBI) in various ways.  We develop a modular proof theory for various propositional abstractseparation logics using cut-free labelled sequent calculi. We first extend thecut-fee labelled sequent calculus for BBI of Hou et al to handle Calcagno etal's original logic of separation algebras by adding sound rules forpartial-determinism and cancellativity, while preserving cut-elimination. Weprove the completeness of our calculus via a sound intermediate calculus thatenables us to construct counter-models from the failure to find a proof. Wethen capture other propositional abstract separation logics by adding soundrules for indivisible unit and disjointness, while maintaining completeness. Wepresent a theorem prover based on our labelled calculus for these propositionalabstract separation logics.

Proof search for propositional abstract separation logics via labelled sequents