Abstract
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory's axioms include both equations and rewrite rules provides a useful "abstraction dial" to find the right balance between abstraction and computational 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) | 213-237 |
Number of pages | 25 |
Journal | Theoretical Computer Science |
Volume | 373 |
Issue number | 3 |
DOIs | |
State | Published - Apr 5 2007 |
Keywords
- Rewriting logic
- Semantics and analysis of programming languages
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science