Sciweavers

500 search results - page 85 / 100
» ACD Term Rewriting
Sort
View
LCTRTS
2005
Springer
14 years 27 days ago
System-wide compaction and specialization of the linux kernel
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...
Dominique Chanet, Bjorn De Sutter, Bruno De Bus, L...
DOLAP
2004
ACM
14 years 25 days ago
Aggregate queries in peer-to-peer OLAP
A peer-to-peer (P2P) data management system consists essentially of a network of peer systems, each maintaining full autonomy over its own data resources. Data exchange between pe...
Mauricio Minuto Espil, Alejandro A. Vaisman
CADE
2004
Springer
14 years 24 days ago
Improved Modular Termination Proofs Using Dependency Pairs
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
René Thiemann, Jürgen Giesl, Peter Sch...
LPAR
2004
Springer
14 years 23 days ago
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
Jürgen Giesl, René Thiemann, Peter Sch...
OOPSLA
2004
Springer
14 years 23 days ago
Converting Java classes to use generics
Generics offer significant software engineering benefits since they provide code reuse without compromising type safety. Thus generics will be added to the Java language in the...
Daniel von Dincklage, Amer Diwan