Sciweavers

20 search results - page 4 / 4
» Explanation Based Program Transformation
Sort
View
DANCE
2002
IEEE
15 years 6 months ago
Active Names: Flexible Location and Transport of Wide-Area Resources
In this paper, we explore flexible name resolution as a way of supporting extensibility for wide-area distributed services. Our approach, called Active Names, maps names to a cha...
Amin Vahdat, Michael Dahlin, Thomas E. Anderson, A...
ICFP
2002
ACM
16 years 1 months ago
Monads for incremental computing
This paper presents a monadic approach to incremental computation, suitable for purely functional languages such as Haskell. A program that uses incremental computation is able to...
Magnus Carlsson
ISSRE
2002
IEEE
15 years 6 months ago
Mutation of Java Objects
Fault insertion based techniqueshave been used for measuring test adequacy and testability of programs. Mutation analysis inserts faults into a program with the goal of creating m...
Roger T. Alexander, James M. Bieman, Sudipto Ghosh...
RTSS
2002
IEEE
15 years 6 months ago
Embedded System Design Framework for Minimizing Code Size and Guaranteeing Real-Time Requirements
In addition to real-time requirements, the program code size is a critical design factor for real-time embedded systems. To take advantage of the code size vs. execution time trad...
Insik Shin, Insup Lee, Sang Lyul Min
CORR
2002
Springer
96views Education» more  CORR 2002»
15 years 1 months ago
The Sketch of a Polymorphic Symphony
In previous work, we have introduced functional strategies, that is, first-class generic functions that can traverse into terms of any type while mixing uniform and type-specific ...
Ralf Lämmel