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/HO
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
We develop a theory of syntax with bindings, focusing on:- methodological issues concerning the conv...
AbstractFormal verification methods have gained increased importance due to their ability to guarant...
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de ...
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de ...
Coinductive reasoning about infinitary structures such as streams is widely applicable. However, pra...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Coalgebra has in recent years been recognized as the framework of choice for the treatment of reacti...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
International audienceInduction is a pervasive tool in computer science and mathematics for defining...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
We develop a theory of syntax with bindings, focusing on:- methodological issues concerning the conv...
AbstractFormal verification methods have gained increased importance due to their ability to guarant...
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de ...
We present a coinductive proof system for bisimilarity in transition systems specifiable in the de ...
Coinductive reasoning about infinitary structures such as streams is widely applicable. However, pra...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
Coinduction is a method for specifying and reasoning about infinite data types and automata with inf...
Coinduction is a method of growing importance in reasoning about functional languages, due to the in...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Coalgebra has in recent years been recognized as the framework of choice for the treatment of reacti...
Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof...
Induction is a pervasive tool in computer science and mathematics for defining objects and reasoning...
International audienceBisimulation up-to enhances the coinductive proof method for bisimilarity, pro...
International audienceInduction is a pervasive tool in computer science and mathematics for defining...
AbstractWe introduce the λ-coiteration schema for a distributive law λ of a functor T over a functor...
We develop a theory of syntax with bindings, focusing on:- methodological issues concerning the conv...
AbstractFormal verification methods have gained increased importance due to their ability to guarant...