Sciweavers

145 search results - page 5 / 29
» K-Maude: A Rewriting Based Tool for Semantics of Programming...
Sort
View
ENTCS
2006
114views more  ENTCS 2006»
13 years 7 months ago
Prototyping SOS Meta-theory in Maude
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
Mohammad Reza Mousavi, Michel A. Reniers
MEMOCODE
2003
IEEE
14 years 24 days ago
Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
José Meseguer
DOCENG
2003
ACM
14 years 24 days ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
Jean-Yves Vion-Dury
ESOP
2001
Springer
14 years 1 days ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
ENTCS
2007
91views more  ENTCS 2007»
13 years 7 months ago
Rule-Based Operational Semantics for an Imperative Language
Operational semantics for programming languages usually come in two flavours: big-step and small-step. Both are defined using deduction rules with a congruence rule allowing redu...
Florent Kirchner, François-Régis Sin...