Sciweavers

4940 search results - page 517 / 988
» On the Complexity of Universal Programs
Sort
View
PEPM
2004
ACM
16 years 6 days ago
Dynamic slicing based on redex trails
Tracing computations is a widely used methodology for program debugging. Lazy languages, in particular, pose new demands on tracing techniques since following the actual trace of ...
Claudio Ochoa, Josep Silva, Germán Vidal
CSMR
2003
IEEE
16 years 5 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
LCPC
2001
Springer
15 years 11 months ago
Strength Reduction of Integer Division and Modulo Operations
Integer division, modulo, and remainder operations are expressive and useful operations. They are logical candidates to express complex data accesses such as the wrap-around behav...
Jeffrey Sheldon, Walter Lee, Ben Greenwald, Saman ...
SIGCSE
2000
ACM
119views Education» more  SIGCSE 2000»
15 years 11 months ago
Bugs as features: teaching network protocols through debugging
Being exposed to well-written code is a valuable experience for students -- especially when the code is larger or more complex than they are currently capable of writing. In addit...
Brad Richards
DBPL
1999
Springer
114views Database» more  DBPL 1999»
15 years 11 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven