Incremental pattern-based coinduction for process algebra and its Isabelle formalization

Popescu, Andrei and Gunter, Elsa (2010) Incremental pattern-based coinduction for process algebra and its Isabelle formalization. In: Foundations of Software Science and Computation Structures (FOSSACS), 20-28 Mar 2010, Paphos, Cyprus.

[img] PDF - Final accepted version (with author's formatting)
Restricted to Repository staff and depositor only

Download (495kB) |

Abstract

We present a coinductive proof system for bisimilarity in
transition systems specifiable in the de Simone SOS format. Our coinduction is incremental, in that it allows building incrementally an a priori unknown bisimulation, and pattern-based, in that it works on equalities of process patterns (i.e., universally quantified equations of process terms containing process variables), thus taking advantage of equational reasoning in a “circular” manner, inside coinductive proof loops. The proof system has been formalized and proved sound in Isabelle/HOL

Item Type: Conference or Workshop Item (Paper)
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 15378
Notes on copyright: Access to full text restricted pending copyright check
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 27 Apr 2015 15:00
Last Modified: 22 Jan 2018 18:11
URI: http://eprints.mdx.ac.uk/id/eprint/15378

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year