45 search results - page 7 / 9 » On Modularity in Term Rewriting and Narrowing |
ENTCS
2007
14 years 9 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
MFCS
1997
Springer
15 years 1 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
ENTCS
2006
14 years 9 months ago
2006
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...