## The Rewriting Logic Semantics Project (2005)

Venue: | SOS 2005 PRELIMINARY VERSION |

Citations: | 46 - 13 self |

### BibTeX

@MISC{Meseguer05therewriting,

author = {José Meseguer and Grigore Rosu},

title = { The Rewriting Logic Semantics Project},

year = {2005}

}

### Years of Citing Articles

### OpenURL

### Abstract

Rewriting logic is a flexible and expressive logical framework that unifies denotational semantics and SOS in a novel way, avoiding their respective limitations and allowing very succinct semantic definitions. The fact that a rewrite theory’s axioms include both equations and rewrite rules provides a very useful “abstraction knob” to find the right balance between abstraction and observability in semantic definitions. Such semantic definitions are directly executable as interpreters in a rewriting logic language such as Maude, whose generic formal tools can be used to endow those interpreters with powerful program analysis capabilities.

### Citations

2668 | Model Checking
- Grumberg, Clarke, et al.
- 1999
(Show Context)
Citation Context ...ation that have to be checked by a standard model checker. One way to avoid this state explosion is to use partial order reduction (POR) tech29 J. of TCS, Volume 373(3), pp 213-237. 2007 niques, (see =-=[16]-=- and references there), in which many of these interleaving computations are never explored. POR is complete, in the sense that an LTL formula not involving the “next” operator © can be shown to hold ... |

1371 | A structural approach to operational semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...ssible. Typically, the rules follow the syntactic structure of programs, defining the semantics of a language construct in terms of that of its parts. The locus classicus is Plotkin’s Aarhus lectures =-=[55]-=-; there is again a vast literature on the topic that we do not attempt to survey; for a good textbook introduction see [35]. Strong points of SOS include: (1) it is a general, yet quite intuitive form... |

509 |
Conditional rewriting logic as a unified model of concurrency
- Meseguer
- 1992
(Show Context)
Citation Context ... used to endow those interpreters with powerful program analysis capabilities. Key words: Semantics and analysis of programming languages, rewriting logic 1 Introduction The fact that rewriting logic =-=[40,9]-=- provides an easy and expressive way to develop executable formal definitions of languages, which can then be subjected to different tool-supported formal analyses, is by now well established [6,70,67... |

489 | The chemical abstract machine
- Berry, Boudol
- 1990
(Show Context)
Citation Context ...table normal form. A different approach, also subsumed by rewriting logic semantics, is sometimes described as reduction semantics. It goes back to Berry and Boudol’s Chemical Abstract Machine (Cham) =-=[4]-=-, and has been used to give semantics to different concurrent calculi and programming languages (see [4,47] for two early references). In essence, a reduction semantics, either of the Cham type or wit... |

335 | Functions as Processes - Milner - 1992 |

216 |
Outline of a mathematical theory of computation
- Scott
- 1970
(Show Context)
Citation Context ...t book), equational specifications are used as semantic equations to give a formal semantics to a language. This use of semantic equations is similar to the one in traditional denotational semantics (=-=[62,63,61,50]-=-). Two differences are: (i) the use of first-order equations in the algebraic case versus the higher-order ones in traditional denotational semantics; and (ii) the kinds of models used in each case. B... |

193 | Maude: specification and programming in rewriting logic
- Clavel
- 2002
(Show Context)
Citation Context ...voiding their respective limitations and allowing very succinct semantic definitions; (2) that rewriting logic semantic definitions are directly executable in a rewriting logic language such as Maude =-=[17]-=-, and can thus become efficient interpreters; and Preprint submitted to Elsevier Science 1 August 2006 J. of TCS, Volume 373(3), pp 213-237. 2007 (3) that generic formal tools such as the Maude LTL mo... |

160 |
Denotational semantics
- Mosses
- 1990
(Show Context)
Citation Context ...t book), equational specifications are used as semantic equations to give a formal semantics to a language. This use of semantic equations is similar to the one in traditional denotational semantics (=-=[62,63,61,50]-=-). Two differences are: (i) the use of first-order equations in the algebraic case versus the higher-order ones in traditional denotational semantics; and (ii) the kinds of models used in each case. B... |

157 | Membership algebra as a logical framework for equational specification
- Meseguer
(Show Context)
Citation Context ...ches (4.3). We end with some concluding remarks in Section 5. 5 J. of TCS, Volume 373(3), pp 213-237. 2007 2 Rewriting Logic Semantics Membership Equational Logic. A membership equational logic (mel) =-=[41]-=- signature is a triple (K,Σ, S) (just Σ in the following), with K a set of kinds, Σ = {Σw,k}(w,k)∈K∗×K a many-kinded signature, and S = {Sk}k∈K a K-kinded family of disjoint sets of sorts. The kind of... |

112 | Specification and proof in membership equational logic
- Bouhoula, Jouannaud, et al.
(Show Context)
Citation Context ...ns it is useful to make the equational rewriting relation 5 context-sensitive. This can be accomplished by specifying a function µ : Σ −→ IN∗ assigning to each function symbol f ∈ Σ (with, say, 4 See =-=[5]-=- for a detailed study of equational rewriting concepts and proof techniques for mel theories. 5 As we shall see, in a rewrite theory R rewriting can happen at two levels: (1) equational rewriting with... |

109 |
Algebraic Semantics of Imperative Programs
- Goguen, Malcolm
- 1996
(Show Context)
Citation Context ...antic frameworks for programming languages are: algebraic denotational semantics and structural operational semantics (SOS). In algebraic denotational semantics (see [72,32,8,49] for early papers and =-=[31]-=- for a recent book), equational specifications are used as semantic equations to give a formal semantics to a language. This use of semantic equations is similar to the one in traditional denotational... |

82 |
The Semantics of Programming Languages: An Elementary Introduction Using Structural Operational Semantics
- Hennessy
- 1990
(Show Context)
Citation Context ...terms of that of its parts. The locus classicus is Plotkin’s Aarhus lectures [55]; there is again a vast literature on the topic that we do not attempt to survey; for a good textbook introduction see =-=[35]-=-. Strong points of SOS include: (1) it is a general, yet quite intuitive formalism, allowing detailed modeling of program executions; (2) it has a simple prooftheoretic semantics using semantic rules ... |

66 | A Dynamic Logic for the formal verification of Java Card programs
- Beckert
- 2000
(Show Context)
Citation Context ...cond) Il:[ExpList,IntSet,FindResult] --> [t(k(val lockv(1) -> acquire -> discard -> exp((release lock(1) ; release lock(n)), [i,loc(1)][n,loc(0)]) -> return -> stop) stack(freeze(stop) -> stop) holds(=-=[3,0]-=-)) t(k(val lockv(2) -> acquire -> discard -> exp((release lock(x + 1) ; release lock(x)), [n,loc(0)] [x,loc(2)]) -> return -> stop) stack(freeze(die) -> stop) holds([1,0])) t(k(val lockv(3) -> acquire... |

66 | The tile model - Gadducci, Montanari - 2000 |

63 | Modular structural operational semantics - Mosses - 2004 |

62 | The Maude LTL model checker
- Eker, Meseguer, et al.
- 2002
(Show Context)
Citation Context ...us become efficient interpreters; and Preprint submitted to Elsevier Science 1 August 2006 J. of TCS, Volume 373(3), pp 213-237. 2007 (3) that generic formal tools such as the Maude LTL model checker =-=[24]-=-, the Maude inductive theorem prover [19,20], and new tools such as a language-generic partial order reduction tool [26], allow us to amortize tool development cost across many programming languages, ... |

46 | Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools
- Meseguer, Roşu
- 2004
(Show Context)
Citation Context ...c [40,9] provides an easy and expressive way to develop executable formal definitions of languages, which can then be subjected to different tool-supported formal analyses, is by now well established =-=[6,70,67,65,42,68,15,58,69,27,25,37,7,44,45,12,11,26,21,59,1,66,23,60,38,36,30]-=-. In fact, the just-mentioned papers by different authors are contributions to a collective ongoing research project which we call the rewriting logic semantics project. A first snapshot of this proje... |

40 | Building equational proving tools by reflection in rewriting logic
- Clavel
- 2000
(Show Context)
Citation Context ...print submitted to Elsevier Science 1 August 2006 J. of TCS, Volume 373(3), pp 213-237. 2007 (3) that generic formal tools such as the Maude LTL model checker [24], the Maude inductive theorem prover =-=[19,20]-=-, and new tools such as a language-generic partial order reduction tool [26], allow us to amortize tool development cost across many programming languages, that can thus be endowed with powerful progr... |

40 | Compiling Natural Semantics
- Pettersson
- 1995
(Show Context)
Citation Context ...ion 2.1); (2) standard SOS definitions are notoriously unmodular, unless one adopts Mosses’ MSOS framework [51–53]; (3) although some tools have been built to execute SOS definitions (see for example =-=[22,34,54]-=-), tool support for verifying properties is perhaps less developed than for denotational semantics. 1.2 Abstraction Dial: Unifying Algebraic Denotational Semantics and SOS For the most part, algebraic... |

38 | Generalized rewrite theories
- Bruni, Meseguer
- 2003
(Show Context)
Citation Context ... used to endow those interpreters with powerful program analysis capabilities. Key words: Semantics and analysis of programming languages, rewriting logic 1 Introduction The fact that rewriting logic =-=[40,9]-=- provides an easy and expressive way to develop executable formal definitions of languages, which can then be subjected to different tool-supported formal analyses, is by now well established [6,70,67... |

33 | Foundations of modular SOS - Mosses - 1999 |

30 |
Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics
- Braga
- 2001
(Show Context)
Citation Context ...c [40,9] provides an easy and expressive way to develop executable formal definitions of languages, which can then be subjected to different tool-supported formal analyses, is by now well established =-=[6,70,67,65,42,68,15,58,69,27,25,37,7,44,45,12,11,26,21,59,1,66,23,60,38,36,30]-=-. In fact, the just-mentioned papers by different authors are contributions to a collective ongoing research project which we call the rewriting logic semantics project. A first snapshot of this proje... |

30 | Modular rewriting semantics of programming languages
- Braga, Meseguer
- 2003
(Show Context)
Citation Context ...c [40,9] provides an easy and expressive way to develop executable formal definitions of languages, which can then be subjected to different tool-supported formal analyses, is by now well established =-=[6,70,67,65,42,68,15,58,69,27,25,37,7,44,45,12,11,26,21,59,1,66,23,60,38,36,30]-=-. In fact, the just-mentioned papers by different authors are contributions to a collective ongoing research project which we call the rewriting logic semantics project. A first snapshot of this proje... |

21 |
Natural semantics on the computer
- Clément, Despeyroux, et al.
- 1986
(Show Context)
Citation Context ...ion 2.1); (2) standard SOS definitions are notoriously unmodular, unless one adopts Mosses’ MSOS framework [51–53]; (3) although some tools have been built to execute SOS definitions (see for example =-=[22,34,54]-=-), tool support for verifying properties is perhaps less developed than for denotational semantics. 1.2 Abstraction Dial: Unifying Algebraic Denotational Semantics and SOS For the most part, algebraic... |

20 | Certifying domainspecific policies
- Lowry, Pressburger, et al.
- 2001
(Show Context)
Citation Context ...emantic programming language definitions have been investigated in depth in several places. In [15,14] we discuss such certifiers for the domains of units of measurement and a large fragment of C, in =-=[39]-=- we present a domain-specific certifier for the domain of coordinate frames, and in [58] one for the domain of optimal state estimation. Each analysis tool has its particularities and may raise comple... |

19 |
On the algebraic definition of programming languages
- Broy, Wirsing, et al.
- 1987
(Show Context)
Citation Context ...gebraic vs. SOS Two well-known semantic frameworks for programming languages are: algebraic denotational semantics and structural operational semantics (SOS). In algebraic denotational semantics (see =-=[72,32,8,49]-=- for early papers and [31] for a recent book), equational specifications are used as semantic equations to give a formal semantics to a language. This use of semantic equations is similar to the one i... |

16 | A runtime environment for concurrent objects with asynchronous method calls
- Johnsen, Owe, et al.
- 2004
(Show Context)
Citation Context |

15 | Certifying measurement unit safety policy
- Chen, Roşu
- 2003
(Show Context)
Citation Context ... -> K) = k(unit(U U’) -> K) . Formal definitions of domain-specific certifiers built on rewriting logic semantic programming language definitions have been investigated in depth in several places. In =-=[15,14]-=- we discuss such certifiers for the domains of units of measurement and a large fragment of C, in [39] we present a domain-specific certifier for the domain of coordinate frames, and in [58] one for t... |

15 |
LETOS – a lightweight execution tool for operational semantics
- Hartel
- 1999
(Show Context)
Citation Context ...ion 2.1); (2) standard SOS definitions are notoriously unmodular, unless one adopts Mosses’ MSOS framework [51–53]; (3) although some tools have been built to execute SOS definitions (see for example =-=[22,34,54]-=-), tool support for verifying properties is perhaps less developed than for denotational semantics. 1.2 Abstraction Dial: Unifying Algebraic Denotational Semantics and SOS For the most part, algebraic... |

15 | Formal models of Java at the JVM level – a survey from the ACL2 perspective
- Moore, Krug, et al.
- 2001
(Show Context)
Citation Context ...s extensive redefinition of earlier semantic equations. 1 Two good examples of indirectly modeling concurrency within a purely functional framework are the ACL2 semantics of the JVM using a scheduler =-=[48]-=-, and the use of lazy data structures in Haskell to analyze cryptographic protocols [2]. 2 J. of TCS, Volume 373(3), pp 213-237. 2007 In SOS, formal definitions take the form of semantic rules. SOS is... |

14 | Rule-based analysis of dimensional safety
- Chen, Rosu, et al.
- 2003
(Show Context)
Citation Context |

13 | Software Specification and Verification in Rewriting Logic
- Meseguer
(Show Context)
Citation Context |

12 |
Modular rewriting semantics in practice
- Braga, Meseguer
- 2004
(Show Context)
Citation Context |

11 | A Modular Rewriting Semantics for CML
- Chalub, Braga
- 2004
(Show Context)
Citation Context |

10 | Automatic validation of transformation rules for Java verification against a rewriting semantics
- Ahrendt, Roth, et al.
- 2005
(Show Context)
Citation Context |

10 | Maude versus Haskell: an experimental comparison in security protocol analysis
- Basin, Denker
- 2000
(Show Context)
Citation Context ...y modeling concurrency within a purely functional framework are the ACL2 semantics of the JVM using a scheduler [48], and the use of lazy data structures in Haskell to analyze cryptographic protocols =-=[2]-=-. 2 J. of TCS, Volume 373(3), pp 213-237. 2007 In SOS, formal definitions take the form of semantic rules. SOS is a prooftheoretic approach, focusing on giving a detailed step-by-step (which can be “s... |

10 |
Algebraic denotational semantics using parameterized abstract modules
- Goguen, Parsaye-Ghomi
- 1981
(Show Context)
Citation Context ...gebraic vs. SOS Two well-known semantic frameworks for programming languages are: algebraic denotational semantics and structural operational semantics (SOS). In algebraic denotational semantics (see =-=[72,32,8,49]-=- for early papers and [31] for a recent book), equational specifications are used as semantic equations to give a formal semantics to a language. This use of semantic equations is similar to the one i... |

9 | Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
- Cervesato, Stehr
- 2004
(Show Context)
Citation Context ...er, D’Amorim and Roşu have given a definition of the Scheme language in [23]. Other language case studies, all specified in Maude, include BC [7], CCS [70,7], CIAO [66], Creol [37], ELOTOS [68], MSR =-=[10,64]-=-, PLAN [65,66], the ABEL hardware description language [38], SILF [36], FUN [57], and the pi-calculus [67]. Some of these rewrite logic language definitions do not obey the continuation-based style ad... |

9 | G.: Formal Analysis of Java Programs - Farzan, Chen - 2004 |

8 | An Equational Specification for the Scheme Language
- d’Amorim, Roşu
(Show Context)
Citation Context |

7 | Partial order reduction for rewriting semantics of programming languages - Farzan, Meseguer - 2005 |

5 |
The ITP tool’s manual. Universidad Complutense
- Clavel, Palomino
- 2005
(Show Context)
Citation Context ...print submitted to Elsevier Science 1 August 2006 J. of TCS, Volume 373(3), pp 213-237. 2007 (3) that generic formal tools such as the Maude LTL model checker [24], the Maude inductive theorem prover =-=[19,20]-=-, and new tools such as a language-generic partial order reduction tool [26], allow us to amortize tool development cost across many programming languages, that can thus be endowed with powerful progr... |

5 | Formal JVM code analysis - Farzan, Meseguer, et al. |

5 | Programming language classes - Roşu |

5 |
Taclets vs. rewriting logic – relating semantics of Java. Master’s thesis, Fakultät für Informatik, Universität
- Sasse
- 2005
(Show Context)
Citation Context |

3 |
ASIP + ITP: A verification tool based on algebraic semantics
- Clavel, Santa-Cruz
- 2005
(Show Context)
Citation Context |

3 |
Lecture notes on program verification
- Meseguer
- 2005
(Show Context)
Citation Context ... case study, this time involving both tasks (1) and (2), has centered on the Pascal-like language used in [31]. A Hoare logic for a substantial fragment of this Pascal-like language has been given in =-=[43]-=-, where the correctness of the Hoare rules is mathematically justified on the basis of the language’s formal semantics RL, thus addressing task (1). Task (2) has been addressed by M. Clavel and J. San... |

3 | Certifying optimality of state estimation programs
- Roşu, Venkatesan, et al.
- 2003
(Show Context)
Citation Context |

2 | eds.). Selected papers of the 2nd workshop on concurrency and compositionality - DeNicola, M - 1990 |

1 | An implementation of modular sos in maude - Chalub - 2005 |