478 search results - page 1 / 96 » Context-Sensitive Dependency Pairs |
111
Voted
FSTTCS
2006
Springer
15 years 4 months ago
2006
Springer
Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of co...
105
Voted
FROCOS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
136
Voted
FOSSACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
201
Voted
ECOOP
2009
Springer
16 years 1 months ago
2009
Springer
Pointer analyses derived from a Context-Free-Language (CFL) reachability formulation achieve very high precision, but they do not scale well to compute the points-to solution for a...
148
Voted
WFLP
2009
Springer
15 years 7 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...