Language definitions as rewrite theories
DOI10.1016/J.JLAMP.2015.09.001zbMATH Open1356.68125OpenAlexW2079991001MaRDI QIDQ730476FDOQ730476
Traian Şerbănuţă, Dorel Lucanu, Vlad Rusu, Grigore Roşu, A. Stefanescu, Andrei Arusoaie
Publication date: 28 December 2016
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.09.001
Recommendations
- Language definitions as rewrite theories
- K-Maude: a rewriting based tool for semantics of programming languages
- A rewrite framework for language definitions and for generation of efficient interpreters
- Symbolic execution based on language transformation
- Executable structural operational semantics in Maude
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)
Cites Work
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- K-Maude: A Rewriting Based Tool for Semantics of Programming Languages
- An overview of the K semantic framework
- Equational rules for rewriting logic
- Rewriting Modulo SMT and Open System Analysis
- Equational abstractions
- One-Path Reachability Logic
- Matching Logic - Extended Abstract (Invited Talk)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories
- Language Definitions as Rewrite Theories
- State Space Reduction of Rewrite Theories Using Invisible Transitions
Cited In (4)
Uses Software
This page was built for publication: Language definitions as rewrite theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730476)
