The Rewriting Logic Semantics Project: A Progress Report

Meseguer, José; Roşu, Grigore

doi:10.1007/978-3-642-22953-4_1

Cited by 19 publications

(23 citation statements)

References 71 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A survey on similar techniques that abstract away from possibly irrelevant information w.r.t. the problem under consideration is provided in [18].…”

Section: Discussionmentioning

confidence: 99%

“…This way one derives a simplified, reduced semantics of SCOOP, more appropriate for model checking, for instance; the current SCOOP formalization in Maude is often too large for this purpose. A survey on abstracting techniques on top of Maude executable semantics is provided in [18]. Furthermore, the aliasing information could be used for the so-called "deadlocking" problem, where two or more executing threads are each waiting for the other to finish.…”

Section: Further Applications Of the Alias Calculusmentioning

confidence: 99%

See 1 more Smart Citation

Expression-Based Aliasing for OO–languages

Caltais

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. Alias analysis has been an interesting research topic in verification and optimization of programs. The undecidability of determining whether two expressions in a program may reference to the same object is the main source of the challenges raised in alias analysis. In this paper we propose an extension of a previously introduced alias calculus based on program expressions, to the setting of unbounded program executions such as infinite loops and recursive calls. Moreover, we devise a corresponding executable specification in the K-framework. An important property of our extension is that, in a non-concurrent setting, the corresponding alias expressions can be over-approximated in terms of a notion of regular expressions. This further enables us to show that the associated K-machinery implements an algorithm that always stops and provides a sound over-approximation of the "may aliasing" information, where soundness stands for the lack of false negatives. As a case study, we analyze the integration and further applications of the alias calculus in SCOOP. The latter is an object-oriented programming model for concurrency, recently formalized in Maude; K definitions can be compiled into Maude for execution.

show abstract

“…A survey on similar techniques that abstract away from possibly irrelevant information w.r.t. the problem under consideration is provided in [18].…”

Section: Discussionmentioning

confidence: 99%

Section: Further Applications Of the Alias Calculusmentioning

confidence: 99%

Expression-Based Aliasing for OO–languages

Caltais

2015

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…The good theoretical and practical advantages of using rewriting logic to give semantic definitions to programming languages have stimulated an international research effort called the rewriting logic semantics project (see [333][334][335]423] for some overview papers). Not only have semantic definitions allowing effective program analyses been given for many real languages such as Java, the JVM, Scheme, and C, and for hardware description languages such as ABEL and Verilog: it has also been possible to build a host of sophisticated program analysis tools for real languages based on different kinds of abstract semantics.…”

Section: Rewriting Logic Semantics Of Programming Languagesmentioning

confidence: 99%

Twenty years of rewriting logic

Meseguer

2012

The Journal of Logic and Algebraic Programming

Self Cite

160

View full text Add to dashboard Cite

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems.

show abstract

“…Further Reading. Besides [28], the following references may be helpful: (i) for the semantics of rewrite theories [90,19]; for the modeling of concurrent systems, programming languages, and logical systems in rewriting logic [98,94,107,123,108,83]; (iii) for the ground coherence property and how to check it [47]; (iv) for automatically transforming a rewrite theory into a semantically equivalent one that is ground coherent [100]; and for an even more general notion of rewrite theory well suited for symbolic computation [100].…”

Section: Computation = Deductionmentioning

confidence: 99%

Programming and symbolic computation in Maude

Durán

Eker

Escobar

et al. 2020

Journal of Logical and Algebraic Methods in Programming

Self Cite

View full text Add to dashboard Cite

Rewriting logic is both a flexible semantic framework within which widely different concurrent systems can be naturally specified and a logical framework in which widely different logics can be specified. Maude programs are exactly rewrite theories. Maude has also a formal environment of verification tools. Symbolic computation is a powerful technique for reasoning about the correctness of concurrent systems and for increasing the power of formal tools. We present several new symbolic features of Maude that enhance formal reasoning about Maude programs and the effectiveness of formal tools. They include: (i) very general unification modulo user-definable equational theories, and (ii) symbolic reachability analysis of concurrent systems using narrowing. The paper does not focus just on symbolic features: it also describes several other new Maude features, including: (iii) Maude's strategy language for controlling rewriting, and (iv) external objects that allow flexible interaction of Maude object-based concurrent systems with the external world. In particular, metainterpreters are external objects encapsulating Maude interpreters that can interact with many other objects. To make the paper self-contained and give a reasonably complete language overview, we also review the basic Maude features for equational rewriting and rewriting with rules, Maude programming of concurrent object systems, and reflection. Furthermore, we include many examples illustrating all the Maude notions and features described in the paper.

show abstract

The Rewriting Logic Semantics Project: A Progress Report

Cited by 19 publications

References 71 publications

Expression-Based Aliasing for OO–languages

Expression-Based Aliasing for OO–languages

Twenty years of rewriting logic

Programming and symbolic computation in Maude

Contact Info

Product

Resources

About