## A Modular Rewriting Semantics for CML (2004)

Venue: | Journal of Universal Computer Science |

Citations: | 11 - 1 self |

### BibTeX

@ARTICLE{Chalub04amodular,

author = {Fabricio Chalub and Christiano Braga},

title = {A Modular Rewriting Semantics for CML},

journal = {Journal of Universal Computer Science},

year = {2004},

volume = {10}

}

### OpenURL

### Abstract

Abstract: This paper presents a modular rewriting semantics (MRS) specification for Reppy’s Concurrent ML (CML), based on Peter Mosses ’ modular structural operational semantics specification for CML. A modular rewriting semantics specification for a programming language is a rewrite theory in rewriting logic written using techniques that support the modular development of the specification in the precise sense that every module extension is conservative. We show that the MRS of CML can be used to interpret CML programs using the rewrite engine of the Maude system, a highperformance implementation of rewriting logic, and to verify CML programs using Maude’s built-in LTL model checker. It is assumed that the reader is familiar with basic concepts of structural operational semantics and algebraic specifications.

### Citations

1371 | A structural approach to operational semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...ssion on the relationship with MSOS we refer to [16]. There are two main techniques for the specification of transition rules in operational semantics: structural (or small-step), proposed by Plotkin =-=[24]-=- and natural (or big-step), proposed by Kahn [10]. Therefore, in the context of representing an operational semantics specification in rewriting logic it is important to be able to control the number ... |

634 |
D.: The Definition of Standard ML (Revised
- Milner, Tofte, et al.
- 1997
(Show Context)
Citation Context ... semantics-preserving transformation from MSOS to MRS with a formal proof of bisimulation between the models of MSOS and MRS. Reppy’s Concurrent ML (CML) [25], is an extension of Milner’s Standard ML =-=[18]-=- with concurrency features. Both languages have formal semantics and have several implementations [11, 26, 13, 1] including several different tools, such as [23, 22]. The objective of this paper is tw... |

160 |
Denotational semantics
- Mosses
- 1990
(Show Context)
Citation Context ...e representation of bindings and add a counter to each binding, which would not force any change to the rule above. This rule is written once and for all, and as Mosses properly states, is definitive =-=[21]-=-. However it is not definitive only due to the record inheritance but also due to the use of abstract interfaces [17]. The evaluation of e:Exp with the new environment rho’:Env rewrites to e’:Exp and ... |

129 | Higher-Order Concurrency
- Reppy
- 1992
(Show Context)
Citation Context ...ga C.: A Modular Rewriting Semantics for CML a semantics-preserving transformation from MSOS to MRS with a formal proof of bisimulation between the models of MSOS and MRS. Reppy’s Concurrent ML (CML) =-=[25]-=-, is an extension of Milner’s Standard ML [18] with concurrency features. Both languages have formal semantics and have several implementations [11, 26, 13, 1] including several different tools, such ... |

109 |
Algebraic Semantics of Imperative Programs
- Goguen, Malcolm
- 1996
(Show Context)
Citation Context ...se of equations to specify the sequential part, therefore making model checking faster. It is also believed that this technique should shorten execution time; (iii) move towards a reduction semantics =-=[9]-=- together with a continuation-passing style [7] in order to avoid conditional rewrites representing transition rules’ premises. Acknowledgements The authors would like to thank the anonymous referees ... |

93 | The maude 2.0 system
- Clavel, Durán, et al.
- 2003
(Show Context)
Citation Context ... is a logical framework [14] which can represent in a natural way many different logics, languages, operational formalisms and models of computation. Having different high-performance implementations =-=[2, 5, 8]-=-, including the Maude system, RWL can be used to create powerful analysis tools for programming languages, such as JavaFAN [7], a rewriting logic-based analysis tool for Java programs. Modular rewriti... |

65 |
Rewriting as a unified model of concurrency
- Meseguer
- 1991
(Show Context)
Citation Context ...3.1, F.3.2 1 Introduction Journal of Universal Computer Science, vol. 10, no. 7 (2004), 789-807 submitted: 16/2/04, accepted: 21/6/04, appeared: 28/7/04 © J.UCS Rewriting logic is a logical framework =-=[14]-=- which can represent in a natural way many different logics, languages, operational formalisms and models of computation. Having different high-performance implementations [2, 5, 8], including the Mau... |

63 | Modular structural operational semantics
- Mosses
- 2004
(Show Context)
Citation Context ...ng to some techniques that supports modular definitions, that is, each module extension being a conservative one. MRS has a close relation with Mosses’ modular structural operational semantics (MSOS) =-=[21]-=-. This is due to the fact that structural operational semantics has a direct representation in rewriting logic [12, 3, 27, 16, 4] and that MRS and MSOS use a similar technique to achieve modularity ba... |

62 | The Maude LTL model checker
- Eker, Meseguer, et al.
- 2002
(Show Context)
Citation Context ...ore solutions. states: 165 rewrites: 67490 in 3970ms cpu (4046ms real) (17000 rewrites/second) 4.3 Model Checking Dekker’s Algorithm for Mutual Exclusion Maude comes with a built-in LTL model checker =-=[6]-=-. In what follows it is exemplified the use of the MRS of CML together with the Maude model checker to verify Dekker’s algorithm [6], one of the earliest correct solutions to the mutual exclusion prob... |

57 | Elan from a rewriting logic point of view
- Borovansky, Kirchner, et al.
(Show Context)
Citation Context ... is a logical framework [14] which can represent in a natural way many different logics, languages, operational formalisms and models of computation. Having different high-performance implementations =-=[2, 5, 8]-=-, including the Maude system, RWL can be used to create powerful analysis tools for programming languages, such as JavaFAN [7], a rewriting logic-based analysis tool for Java programs. Modular rewriti... |

35 | Formal Analysis of Java Programs in JavaFAN
- Farzan, Chen, et al.
- 2004
(Show Context)
Citation Context ...s of computation. Having different high-performance implementations [2, 5, 8], including the Maude system, RWL can be used to create powerful analysis tools for programming languages, such as JavaFAN =-=[7]-=-, a rewriting logic-based analysis tool for Java programs. Modular rewriting semantics (MRS) [4, 16] is a novel technique for the modular specification of programming languages semantics in rewriting ... |

31 | Equational Abstractions
- Meseguer, Palomino, et al.
(Show Context)
Citation Context ...et of CML. From this experiment it follows that the right balance between equational and rule-based axiomatizations should be pursued, following the lines of [15], which are already being followed in =-=[17, 7]-=-. Roughly speaking, the sequential fragment should be equationaly specified and the concurrent fragment should be rule-based. In this way the state space is restricted to concurrency-related computati... |

30 |
Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics
- Braga
- 2001
(Show Context)
Citation Context ...RS has a close relation with Mosses’ modular structural operational semantics (MSOS) [21]. This is due to the fact that structural operational semantics has a direct representation in rewriting logic =-=[12, 3, 27, 16, 4]-=- and that MRS and MSOS use a similar technique to achieve modularity based on the encapsulation of the semantic information. Moreover, MRS builds on MSOS insights with new techniques to achieve modula... |

30 | Modular rewriting semantics of programming languages
- Braga, Meseguer
- 2003
(Show Context)
Citation Context ...de system, RWL can be used to create powerful analysis tools for programming languages, such as JavaFAN [7], a rewriting logic-based analysis tool for Java programs. Modular rewriting semantics (MRS) =-=[4, 16]-=- is a novel technique for the modular specification of programming languages semantics in rewriting logic. A MRS specification is a rewrite theory in rewriting logic developed according to some techni... |

14 |
CafeOBJ report
- Diaconescu, Futatsugi
- 1998
(Show Context)
Citation Context ... is a logical framework [14] which can represent in a natural way many different logics, languages, operational formalisms and models of computation. Having different high-performance implementations =-=[2, 5, 8]-=-, including the Maude system, RWL can be used to create powerful analysis tools for programming languages, such as JavaFAN [7], a rewriting logic-based analysis tool for Java programs. Modular rewriti... |

13 | Software Specification and Verification in Rewriting Logic
- Meseguer
(Show Context)
Citation Context ... in rewriting logic for a significant subset of CML. From this experiment it follows that the right balance between equational and rule-based axiomatizations should be pursued, following the lines of =-=[15]-=-, which are already being followed in [17, 7]. Roughly speaking, the sequential fragment should be equationaly specified and the concurrent fragment should be rule-based. In this way the state space i... |

12 |
Modular rewriting semantics in practice
- Braga, Meseguer
- 2004
(Show Context)
Citation Context ...de system, RWL can be used to create powerful analysis tools for programming languages, such as JavaFAN [7], a rewriting logic-based analysis tool for Java programs. Modular rewriting semantics (MRS) =-=[4, 16]-=- is a novel technique for the modular specification of programming languages semantics in rewriting logic. A MRS specification is a rewrite theory in rewriting logic developed according to some techni... |

6 | Fundamental Concepts and Formal Semantics of Programming Languages— an introductory course. Lecture notes, available at http://www.daimi.au.dk/ jwig-cnn/dSem
- Mosses
- 2004
(Show Context)
Citation Context ...system. The MRS of CML is the result of the application of the semantics-preserving translation between MSOS and MRS, developed by the second author and Meseguer, to Mosses’ MSOS specification of CML =-=[19]-=-. This paper is organized as follows. Section 2 gives the necessary background in rewriting logic and modular rewriting semantics. Section 3 presents the modular rewriting semantics of CML. Section 4 ... |

2 |
Natural semantics. Report 601, Inria, Institut national de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquencourt B.P.105 78153 Le Chesnay Cedex Fance
- Kahn
- 1987
(Show Context)
Citation Context ...16]. There are two main techniques for the specification of transition rules in operational semantics: structural (or small-step), proposed by Plotkin [24] and natural (or big-step), proposed by Kahn =-=[10]-=-. Therefore, in the context of representing an operational semantics specification in rewriting logic it is important to be able to control the number of steps of rewrites in the conditions of a rule.... |

2 |
Handbook of Philosophical Logic, volume 61, chapter Rewriting Logic as a Logical and Semantic Framework
- Martí-Oliet, Meseguer
- 2001
(Show Context)
Citation Context ...RS has a close relation with Mosses’ modular structural operational semantics (MSOS) [21]. This is due to the fact that structural operational semantics has a direct representation in rewriting logic =-=[12, 3, 27, 16, 4]-=- and that MRS and MSOS use a similar technique to achieve modularity based on the encapsulation of the semantic information. Moreover, MRS builds on MSOS insights with new techniques to achieve modula... |

1 |
http://www.itu.dk/research/ Chalub F., Braga C.: A Modular Rewriting Semantics for CML mlkit
- Kit
(Show Context)
Citation Context ...models of MSOS and MRS. Reppy’s Concurrent ML (CML) [25], is an extension of Milner’s Standard ML [18] with concurrency features. Both languages have formal semantics and have several implementations =-=[11, 26, 13, 1]-=- including several different tools, such as [23, 22]. The objective of this paper is twofold: (i) to define a MRS for CML; and (ii) to show how CML programs can be executed and model checked in rewrit... |

1 |
Definitive semantics. Lecture notes
- Mosses
- 2003
(Show Context)
Citation Context ...e representation of bindings and add a counter to each binding, which would not force any change to the rule above. This rule is written once and for all, and as Mosses properly states, is definitive =-=[20]-=-. However it is not definitive only due to the record inheritance but also due to the use of abstract interfaces [16]. The evaluation of e:Exp with the new environment rho’:Env rewrites to e’:Exp and ... |

1 |
Cambridge Computer Laboratory. HOL, automated proof system for higher order logic. http://hol.sourceforge.net
- of
(Show Context)
Citation Context ...s an extension of Milner’s Standard ML [18] with concurrency features. Both languages have formal semantics and have several implementations [11, 26, 13, 1] including several different tools, such as =-=[23, 22]-=-. The objective of this paper is twofold: (i) to define a MRS for CML; and (ii) to show how CML programs can be executed and model checked in rewriting logic using the MRS of CML and the Maude system.... |

1 |
a generic theorem proving environment. http: //www.cl.cam.ac.uk/Research/HVG/Isabelle
- Isabelle
(Show Context)
Citation Context ...s an extension of Milner’s Standard ML [18] with concurrency features. Both languages have formal semantics and have several implementations [11, 26, 13, 1] including several different tools, such as =-=[23, 22]-=-. The objective of this paper is twofold: (i) to define a MRS for CML; and (ii) to show how CML programs can be executed and model checked in rewriting logic using the MRS of CML and the Maude system.... |

1 |
Maude como um marco semântico ejecutable
- Verdejo
- 2003
(Show Context)
Citation Context ...RS has a close relation with Mosses’ modular structural operational semantics (MSOS) [21]. This is due to the fact that structural operational semantics has a direct representation in rewriting logic =-=[12, 3, 27, 16, 4]-=- and that MRS and MSOS use a similar technique to achieve modularity based on the encapsulation of the semantic information. Moreover, MRS builds on MSOS insights with new techniques to achieve modula... |

1 |
Software specification and verification in rewriting logic. http:// maude.cs.uiuc.edu/papers
- Meseguer
- 2003
(Show Context)
Citation Context ...n in rewriting logic for a significant subset of CML. From this experiment it follows that the right balance between equational and rulebased axiomatizations should be pursued, following the lines of =-=[15]-=-, which are already being followed in [18, 7]. Roughly speaking, the sequential fragment should be equationaly specified and the concurrent fragment should be rule-based. In this way the state space i... |