Sciweavers

3256 search results - page 404 / 652
» Mixin-Based Programming in C
Sort
View
STACS
2005
Springer
14 years 4 months ago
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
Abraham Flaxman, Bartosz Przydatek
SAS
2004
Springer
109views Formal Methods» more  SAS 2004»
14 years 4 months ago
Pointer-Range Analysis
Array-Range Analysis computes at compile time the range of possible index values for each array-index expression in a program. This information can be used to detect potential out-...
Suan Hsi Yong, Susan Horwitz
COMPSAC
2003
IEEE
14 years 4 months ago
Incremental Transformation of Procedural Systems to Object Oriented Platforms
Over the past years, the reengineering of legacy software systems to object oriented platforms has received significant attention. In this paper, we present a generic re-engineeri...
Ying Zou, Kostas Kontogiannis
ICFP
2009
ACM
14 years 3 months ago
Experience report: embedded, parallel computer-vision with a functional DSL
This paper presents our experience using a domain-specific functional language, WaveScript, to build embedded sensing applications used in scientific research. We focus on a rec...
Ryan Newton, Teresa Ko
DSN
2000
IEEE
14 years 3 months ago
Robustness Testing of the Microsoft Win32 API
Although Microsoft Windows is being deployed in mission-critical applications, little quantitative data has been published about its robustness. We present the results of executin...
Charles P. Shelton, Philip Koopman, Kobey Devale