Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423100 | Electronic Notes in Theoretical Computer Science | 2006 | 30 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics