Sciweavers

2218 search results - page 97 / 444
» Testing Expressibility Is Hard
Sort
View
SIGSOFT
2004
ACM
14 years 9 months ago
Testing static analysis tools using exploitable buffer overflows from open source code
Five modern static analysis tools (ARCHER, BOON, PolySpace C Verifier, Splint, and UNO) were evaluated using source code examples containing 14 exploitable buffer overflow vulnera...
Misha Zitser, Richard Lippmann, Tim Leek
KDD
2004
ACM
112views Data Mining» more  KDD 2004»
14 years 9 months ago
A rank sum test method for informative gene discovery
Finding informative genes from microarray data is an important research problem in bioinformatics research and applications. Most of the existing methods rank features according t...
Lin Deng, Jian Pei, Jinwen Ma, Dik Lun Lee
POPL
2006
ACM
14 years 9 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
MSR
2005
ACM
14 years 2 months ago
Software repository mining with Marmoset: an automated programming project snapshot and testing system
Most computer science educators hold strong opinions about the “right” approach to teaching introductory level programming. Unfortunately, we have comparatively little hard ev...
Jaime Spacco, Jaymie Strecker, David Hovemeyer, Wi...
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
14 years 2 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang