Sciweavers

125 search results - page 12 / 25
» Anytime dynamic programming for coalition structure generati...
Sort
View
KBSE
2009
IEEE
14 years 2 months ago
A Case for Automated Debugging Using Data Structure Repair
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
Muhammad Zubair Malik, Khalid Ghori, Bassem Elkara...
RSA
2008
123views more  RSA 2008»
13 years 7 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
IUI
2005
ACM
14 years 1 months ago
Metafor: visualizing stories as code
Every program tells a story. Programming, then, is the art of constructing a story about the objects in the program and what they do in various situations. So-called programming l...
Hugo Liu, Henry Lieberman
PLDI
2010
ACM
14 years 20 days ago
Decoupled lifeguards: enabling path optimizations for dynamic correctness checking tools
Dynamic correctness checking tools (a.k.a. lifeguards) can detect a wide array of correctness issues, such as memory, security, and concurrency misbehavior, in unmodified executa...
Olatunji Ruwase, Shimin Chen, Phillip B. Gibbons, ...
ACSAC
2004
IEEE
13 years 11 months ago
A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors)
Buffer overflow vulnerabilities are caused by programming errors that allow an attacker to cause the program to write beyond the bounds of an allocated memory block to corrupt oth...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...