Denotational semantics: a methodology for language development
Denotational semantics: a methodology for language development
On the algebraic definition of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
The semantics of programming languages: an elementary introduction using structural operational semantics
Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Selected papers of the Second Workshop on Concurrency and compositionality
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
LETOS — a lightweight execution tool for operational semantics
Software—Practice & Experience
Algebraic Semantics of Imperative Programs
Algebraic Semantics of Imperative Programs
Compiling Natural Semantics
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Algebraic Denotational Semantics Using Parameterized Abstract Modules
Proceedings of the International Colloquium on Formalization of Programming Concepts
Certifying Domain-Specific Policies
Proceedings of the 16th IEEE international conference on Automated software engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
Modular Rewriting Semantics in Practice
Electronic Notes in Theoretical Computer Science (ENTCS)
A Run-Time Environment for Concurrent Objects With Asynchronous Method Calls
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategies and simulations in a semantic framework
Journal of Algorithms
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A Natural Implementation of Plural Semantics in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
RLSRunner: linking rascal with k for program analysis
SLE'11 Proceedings of the 4th international conference on Software Language Engineering
On abstractions for timing analysis in the K framework
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
| Hi-index | 0.00 |
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.