Sciweavers

544 search results - page 65 / 109
» Testing concurrent programs using value schedules
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 11 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli
ASPLOS
2006
ACM
15 years 3 months ago
HeapMD: identifying heap-based bugs using anomaly detection
We present the design, implementation, and evaluation of HeapMD, a dynamic analysis tool that finds heap-based bugs using anomaly detection. HeapMD is based upon the observation ...
Trishul M. Chilimbi, Vinod Ganapathy
ECOOP
2005
Springer
15 years 3 months ago
Attached Types and Their Application to Three Open Problems of Object-Oriented Programming
The three problems of the title — the first two widely discussed in the literature, the third less well known but just as important for further development of object technology ...
Bertrand Meyer
ICFP
2002
ACM
15 years 9 months ago
A demand-driven adaptive type analysis
Compilers for dynamically and statically typed languages ensure safe execution by verifying that all operations are performed on appropriate values. An operation as simple as car ...
Danny Dubé, Marc Feeley
ICS
2001
Tsinghua U.
15 years 2 months ago
Reducing the complexity of the issue logic
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
Ramon Canal, Antonio González