Rule Formats for Determinism and Idempotence

Aceto, Luca; Birgisson, Arnar; Ingólfsdóttir, Anna; Mousavi, Mohammad Reza; Reniers, Michel A.

doi:10.1007/978-3-642-11623-0_8

Cited by 7 publications

(9 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…, if t t and T is in a congruence format for ↔ --, is guaranteed by results in [1] and in the classic theory of structural operational semantics.…”

Section: The Relationmentioning

confidence: 94%

“…In each row, the first column (column toc(d 1 )) specifies the form of the target of the conclusion of the -defining rule d 1 (e.g., x in case of row 3), the second column (column toc(d 2 )) specifies the form of the target of the conclusion of the -defining rule d 2 (e.g., x y in case of row 3), if the conditions in the column further requirements are satisfied (e.g., in row 3, among all possible -defining rules only d 1 can satisfy premises x a → x and y a → y ), then the result of the transition of terms (p q) r and (p r) (q r) is specified by the term given in column result (e.g., p q in row 3). The requirement idempotent means that the operator can be proved idempotent, e.g., by means of the rule format offered in [1].…”

Section: Analyzing the Distributivity Compliancementioning

confidence: 99%

“…The literature on SOS provides rule formats for basic algebraic properties of operators such as commutativity [26], associativity [19], idempotence [1] and the existence of unit and zero elements [4,10]. The main advantage of this approach is that one is able to verify the desired property by syntactic checks that can be mechanized.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Rule Formats for Distributivity

Aceto

Cimini

Ingólfsdóttir

et al. 2011

Language and Automata Theory and Applications

Self Cite

View full text Add to dashboard Buy / Rent full text

DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

show abstract

“…, if t t and T is in a congruence format for ↔ --, is guaranteed by results in [1] and in the classic theory of structural operational semantics.…”

Section: The Relationmentioning

confidence: 94%

Section: Analyzing the Distributivity Compliancementioning

confidence: 99%

See 1 more Smart Citation

Rule Formats for Distributivity

Aceto

Cimini

Ingólfsdóttir

et al. 2011

Language and Automata Theory and Applications

Self Cite

View full text Add to dashboard Buy / Rent full text

show abstract

“…A related line of work is the one pursued in, e.g., the papers [1,13,28]. Those papers present rule formats that guarantee the soundness of certain algebraic laws over a process language 'by design', provided that the SOS rules giving the semantics of certain operators fit that format.…”

Section: Related and Future Workmentioning

confidence: 99%

A Bisimulation-based Method for Proving the Validity of Equations in GSOS Languages

Aceto

Cimini

Ingólfsdóttir

2010

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Buy / Rent full text

This paper presents a bisimulation-based method for establishing the soundness of equations between terms constructed using operations whose semantics is specified by rules in the GSOS format of Bloom, Istrail and Meyer. The method is inspired by de Simone's FH-bisimilarity and uses transition rules as schematic transitions in a bisimulation-like relation between open terms. The soundness of the method is proven and examples showing its applicability are provided. The proposed bisimulation-based proof method is incomplete, but the article offers some completeness results for restricted classes of GSOS specifications

show abstract

“…This paper is part of our ongoing line of research on capturing basic properties of composition operators in terms of syntactic rule formats, exemplified by rule formats for commutativity [11], associativity [6], determinism and idempotence [1].…”

Section: Introductionmentioning

confidence: 99%