Sciweavers

540 search results - page 43 / 108
» Mathematical programming based debugging
Sort
View
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
15 years 10 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
AADEBUG
2005
Springer
15 years 3 months ago
Automated bug isolation via program chipping
This paper introduces program chipping, a simple yet effective technique to isolate bugs. This technique automatically removes or chips away parts of a program so that the part t...
Chad D. Sterling, Ronald A. Olsson
APLAS
2000
ACM
15 years 2 months ago
Kima - An Automated Error Correction System for Concurrent Logic Programs
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...
Yasuhiro Ajiro, Kazunori Ueda
PLILP
1997
Springer
15 years 1 months ago
DrScheme: A Pedagogic Programming Environment for Scheme
Abstract. Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scienti c int...
Robert Bruce Findler, Cormac Flanagan, Matthew Fla...
SIGSOFT
2007
ACM
15 years 10 months ago
Training on errors experiment to detect fault-prone software modules by spam filter
The fault-prone module detection in source code is of importance for assurance of software quality. Most of previous fault-prone detection approaches are based on software metrics...
Osamu Mizuno, Tohru Kikuno