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. Foundations of Software Science and Computational Structures : 13th International Conference, FOSSACS 2010, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20-28, 2010. Proceedings. In: Foundations of Software Science and Computation Structures (FOSSACS), 20-28 Mar 2010, Paphos, Cyprus. ISBN 9783642120312. ISSN 0302-9743 [Conference or Workshop Item]

[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: 21 Jul 2021 17:12
URI: https://eprints.mdx.ac.uk/id/eprint/15378

Actions (login required)

View Item View Item

Statistics

Downloads
Activity Overview
5Downloads
269Hits

Additional statistics are available via IRStats2.