Sciweavers

11740 search results - page 206 / 2348
» More Problems in Rewriting
Sort
View
LPAR
2004
Springer
16 years 12 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...
187
Voted
OOPSLA
2004
Springer
16 years 12 days ago
A language-independent approach to software maintenance using grammar adapters
A long-standing goal of software engineering is to construct software that is easily modified and extended. Recent advances in software design techniques, such as aspect-oriented ...
Suman Roychoudhury
SEM
2004
Springer
16 years 12 days ago
Extending Standard Java Runtime Systems for Resource Management
Resource management is a precondition to build reliable, extensible middleware and to host potentially untrusted user components. Resource accounting allows to charge users for the...
Walter Binder, Jarle Hulaas
CSMR
2003
IEEE
16 years 10 days ago
Towards Automatical Migration of Transformation Rules after Grammar Extension
The paper addresses two problems in software maintenance. Firstly, some maintenance tasks require modifications of the grammar. A change in a grammar can make syntax and transfor...
Wolfgang Lohmann, Günter Riedewald
WIDM
2003
ACM
16 years 9 days ago
XPath query transformation based on XSLT stylesheets
Whenever XML data must be shared by heterogeneous applications, transformations between different applicationspecific XML formats are necessary. The state-of-the-art method transf...
Sven Groppe, Stefan Böttcher