Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436277 | Theoretical Computer Science | 2007 | 25 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics