83 search results - page 2 / 17 » A compact fixpoint semantics for term rewriting systems |
RTA
2004
Springer
15 years 2 months ago
2004
Springer
Over the past decade, researchers have found context-sensitive term-rewriting semantics to be powerful and expressive tools for modeling programming languages, particularly in esta...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
107
click to vote
PLILP
1994
Springer
15 years 1 months ago
1994
Springer
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
DOCENG
2003
ACM
15 years 2 months ago
2003
ACM
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 ...
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We introduce a denotational semantics for non-linear hybrid automata, and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is d...