Sciweavers

1882 search results - page 157 / 377
» Transformational Programming and Forests
Sort
View
ENTCS
2002
79views more  ENTCS 2002»
14 years 9 months ago
Debugging and Testing Optimizers through Comparison Checking
We present a novel technique called comparison checking that helps optimizer writers debug optimizers by testing, for given inputs, that the semantics of a program are not changed...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
HASKELL
2009
ACM
15 years 4 months ago
Finding the needle: stack traces for GHC
Even Haskell programs can occasionally go wrong. Programs calling head on an empty list, and incomplete patterns in function definitions can cause program crashes, reporting littl...
Tristan O. R. Allwood, Simon Peyton Jones, Susan E...
GPCE
2007
Springer
15 years 1 months ago
Generative metaprogramming
Recent advances in Software Engineering have reduced the cost of coding programs at the expense of increasing the complexity of program synthesis, i.e. metaprograms, which when ex...
Salvador Trujillo, Maider Azanza, Oscar Día...
TSE
1998
102views more  TSE 1998»
14 years 9 months ago
Designing Masking Fault-Tolerance via Nonmasking Fault-Tolerance
—Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guara...
Anish Arora, Sandeep S. Kulkarni
94
Voted
CC
2004
Springer
177views System Software» more  CC 2004»
15 years 3 months ago
Value-Based Partial Redundancy Elimination
Abstract. Partial redundancy elimination (PRE) is a program transformation that identifies and eliminates expressions that are redundant on at least one (but not necessarily all) ...
Thomas VanDrunen, Antony L. Hosking