A Decision Procedure for Bisimilarity of Generalized Regular Expressions

Bonsangue, Marcello M.; Caltais, Georgiana; Goriac, Eugen-Ioan; Lucanu, Dorel; Rütten, Jan; Silva, Alexandra

doi:10.1007/978-3-642-19829-8_15

Cited by 7 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, we believe it sets the base of an interesting framework for Reo, which will allow the use of powerful existing tools, in order to perform verification, synthesis and modelchecking of Reo circuits. For instance, the general framework of [23] was recently implemented in the automatic theorem prover Circ [19,7]. In [7], the authors proved that it is always possible to automatically decide if two expressions are bisimilar.…”

Section: Discussionmentioning

confidence: 99%

“…For instance, the general framework of [23] was recently implemented in the automatic theorem prover Circ [19,7]. In [7], the authors proved that it is always possible to automatically decide if two expressions are bisimilar. This enables automatic reasoning on the language presented in this paper.…”

Section: Discussionmentioning

confidence: 99%

“…This enables automatic reasoning on the language presented in this paper. We would like to (i) integrate the framework of [7] in the Eclipe tool-suite of Reo; (ii) extend the Circ framework of [7] in order to also automatically prove different equivalences of expressions, such as trace equivalence.…”

Section: Discussionmentioning

confidence: 99%

See 2 more Smart Citations

A Specification Language for Reo Connectors

Silva

2012

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. Recent approaches to component-based software engineering employ coordinating connectors to compose components into software systems. Reo is a model of component coordination, wherein complex connectors are constructed by composing various types of primitive channels. Reo automata are a simple and intuitive formal model of context-dependent connectors, which provided a compositional semantics for Reo. In this paper, we study Reo automata from a coalgebraic perspective. This enables us to apply the recently developed coalgebraic theory of generalized regular expressions in order to derive a specification language, tailor-made for Reo automata, and sound and complete axiomatizations with respect to three distinct notions of equivalence: (coalgebraic) bisimilarity, the bisimulation notion studied in the original papers on Reo automata and trace equivalence. The obtained language is simple, but nonetheless expressive enough to specify all possible finite Reo automata. Moreover, it comes equipped with a Kleene-like theorem: we provide algorithms to translate expressions to Reo automata and, conversely, to compute an expression equivalent to a state in a Reo automaton.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A Specification Language for Reo Connectors

Silva

2012

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is inspired from circular coinduction [12], a coinductive proof technique for infinite data structures and coalgebras of expressions [16].…”

Section: A Circular Proof Systemmentioning

confidence: 99%

Program equivalence by circular reasoning

Lucanu

Rusu

2015

Form. Asp. Comput.

Self Cite

View full text Add to dashboard Cite

We propose a logic and a deductive system for stating and automatically proving the equivalence of programs in deterministic languages having a rewriting-based operational semantics. The deductive system is circular in nature and is proved sound and weakly complete; together, these results say that, when it terminates, our system correctly solves the program-equivalence problem as we state it. We show that our approach is suitable for proving the equivalence of both terminating and non-terminating programs, and also the equivalence of both concrete and symbolic programs. The latter are programs in which some statements or expressions are symbolic variables. By proving the equivalence between symbolic programs, one proves in one shot the equivalence of (possibly, infinitely) many concrete programs obtained by replacing the variables by concrete statements or expressions. We also report on a prototype implementation of the proposed deductive system in the K Framework.Key-words: Program Equivalence, Circular Reasoning, K framework. * University of Iasi, Romania † Inria Lille Nord Europe Equivalence de Programmes par Raisonnement Circulaire Résumé :Nous proposons une logique et un système déductif pour exprimer et prouver automatiquement l'équivalence de programmes dans des langages déterministes munis de sé-mantiques opérationnelles définies par réécriture. Le système déductif proposé est de nature circulaire; nous démontrons qu'il est correct et faiblement complet. Ces deux résultats signifient que notre système résout correctement le problème d'équivalence de programmes tels que nous l'avons posé. Nous montrons que ce système fonctionne autant pour des programmes qui terminent que pour des programmes qui ne terminent pas. Les programmes dits symboliques, dans lesquels certaines expressions ou instructions restent non-interprétés, peuvent également être traités par notre approche. La démonstration d'une équivalence entre deux programmes symboliques revient à démontrer l'équivalence entre une infinité potentielle de programmes concrets, qui sont des instances des programmes symboliques obtenues en remplaçant les variables symboliques par des instructions ou des expressions concrètes. Enfin, nous décrivons une implé-mentation prototype de notre système déductif dans la K framework.

show abstract

“…The K specification of Rite is based on the circularity principle [7,3] to handle the possible cycles in the heap. We employ Rite with kA post * (φ,P), i.e., φ ∈ Rite, for verifying heap-shape properties for Shylock programs.…”

Section: Bounded Model Checking For Shylockmentioning

confidence: 99%

Bounded Model Checking of Recursive Programs with Pointers in K

Asavoae

Boer

Bonsangue

et al. 2013

Recent Trends in Algebraic Development Techniques

Self Cite

View full text Add to dashboard Cite

Abstract. We present an adaptation of model-based verification, via model checking pushdown systems, to semantics-based verification. First we introduce the algebraic notion of pushdown system specifications (PSS) and adapt a model checking algorithm for this new notion. We instantiate pushdown system specifications in the K framework by means of Shylock, a relevant PSS example. We show why K is a suitable environment for the pushdown system specifications and we give a methodology for defining the PSS in K. Finally, we give a parametric K specification for model checking pushdown system specifications based on the adapted model checking algorithm for PSS.

show abstract

A Decision Procedure for Bisimilarity of Generalized Regular Expressions

Cited by 7 publications

References 13 publications

A Specification Language for Reo Connectors

A Specification Language for Reo Connectors

Program equivalence by circular reasoning

Bounded Model Checking of Recursive Programs with Pointers in K

Contact Info

Product

Resources

About