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.
Original language | English (US) |
---|---|
Pages (from-to) | 27-56 |
Number of pages | 30 |
Journal | Electronic Notes in Theoretical Computer Science |
Volume | 156 |
Issue number | 1 SPEC. ISS. |
DOIs | |
State | Published - May 15 2006 |
Keywords
- Semantics and analysis of programming languages
- rewriting logic
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science