Sciweavers

452 search results - page 34 / 91
» Finding bugs is easy
Sort
View
LISP
2008
96views more  LISP 2008»
13 years 8 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
UIST
2010
ACM
13 years 5 months ago
Gestalt: integrated support for implementation and analysis in machine learning
We present Gestalt, a development environment designed to support the process of applying machine learning. While traditional programming environments focus on source code, we exp...
Kayur Patel, Naomi Bancroft, Steven M. Drucker, Ja...
USS
2010
13 years 5 months ago
Securing Script-Based Extensibility in Web Browsers
Web browsers are increasingly designed to be extensible to keep up with the Web's rapid pace of change. This extensibility is typically implemented using script-based extensi...
Vladan Djeric, Ashvin Goel
TSE
2010
155views more  TSE 2010»
13 years 2 months ago
Incremental Test Generation for Software Product Lines
Recent advances in mechanical techniques for systematic testing have increased our ability to automatically find subtle bugs, and hence to deploy more dependable software. This pap...
Engin Uzuncaova, Sarfraz Khurshid, Don S. Batory
ICCAD
2003
IEEE
113views Hardware» more  ICCAD 2003»
14 years 4 months ago
Branch Merge Reduction of RLCM Networks
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...
Bernard N. Sheehan