63 search results - page 8 / 13 » Computing Critical Pairs in 2-Dimensional Rewriting Systems |
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
RTA
1993
Springer
13 years 11 months ago
1993
Springer
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...
CSUR
1999
13 years 7 months ago
1999
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
COMPSAC
2005
IEEE
14 years 1 months ago
2005
IEEE
Monitoring is a task of collecting measurements that reflect the state of a system. Administration is a collection of tasks for control and manipulation of computer systems. Monito...