RTA
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. We show that the structures of binding algebras and Σmonoids by Fiore, Plotkin and Turi are sound and complete models of Klop’s Combinatory Reduction Systems (CRSs). T...
RTA
2005
Springer
14 years 6 months ago
2005
Springer
A convenient method for defining a quasi-ordering, such as those used for proving termination of rewriting, is to choose the minimum of a set of quasi-orderings satisfying some d...
RTA
2005
Springer
14 years 6 months ago
2005
Springer
Abstract. As a window into the subject, we recount some of the history (and geography) of two mature, challenging, partially open, partially closed problems in the theory of rewrit...
RTA
2005
Springer
14 years 6 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
RTA
2005
Springer
14 years 6 months ago
2005
Springer
In this paper, we consider the monadic second order logic (MSO) and two of its extensions, namely Counting MSO (CMSO) and Presburger MSO (PMSO), interpreted over unranked and unord...
RTA
2005
Springer
14 years 6 months ago
2005
Springer
ICS
2005
Tsinghua U.
14 years 6 months ago
2005
Tsinghua U.
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
ICS
2005
Tsinghua U.
14 years 6 months ago
2005
Tsinghua U.
ICS
2005
Tsinghua U.
14 years 6 months ago
2005
Tsinghua U.
Parallel I/O needs to keep pace with the demand of high performance computing applications on systems with ever-increasing speed. Exploiting high-end interconnect technologies to ...
ICS
2005
Tsinghua U.
14 years 6 months ago
2005
Tsinghua U.
A key step in program optimization is the determination of optimal values for code optimization parameters such as cache tile sizes and loop unrolling factors. One approach, which...