RTA
2004
Springer
14 years 6 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
RTA
2004
Springer
14 years 6 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
RTA
2004
Springer
14 years 6 months ago
2004
Springer
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
RTA
2004
Springer
14 years 6 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
RTA
2004
Springer
14 years 6 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
ICS
2004
Tsinghua U.
14 years 6 months ago
2004
Tsinghua U.
ICS
2004
Tsinghua U.
14 years 6 months ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...
ICS
2004
Tsinghua U.
14 years 6 months ago
2004
Tsinghua U.
In this paper, we study energy conservation techniques for disk array-based network servers. First, we introduce a new conservation technique, called Popular Data Concentration (P...
ICS
2004
Tsinghua U.
14 years 6 months ago
2004
Tsinghua U.
ICS
2004
Tsinghua U.
14 years 6 months ago
2004
Tsinghua U.
The use of semi-Lagrangian formulations in numerical weather predication models (NWP) allows for an increase in time step size. Use of this method can increase performance of thes...