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

When dealing with inductively defined systems, correctness proofs of different specifications of the same system cannot be accomodated in a framework based on finite state automata. Instead, these systems can be naturally analysed and verified by manipulating the process algebra specifications by means of equational reasoning. In this paper, we describe an attempt to mechanize a proof by mathematical induction of the correctness of a simple buffer. To achieve this goal, we use the interactive theorem prover hol to support the theory of observational congruence for CCS, and provide a set of axiomatic proof tools which can be used interactively.

Mechanizing a proof by induction of process algebra specifications in higher order logic