Sciweavers

686 search results - page 84 / 138
» How Bayesians Debug
Sort
View
AAAI
2006
13 years 10 months ago
Learning Systems of Concepts with an Infinite Relational Model
Relationships between concepts account for a large proportion of semantic knowledge. We present a nonparametric Bayesian model that discovers systems of related concepts. Given da...
Charles Kemp, Joshua B. Tenenbaum, Thomas L. Griff...
DAC
2002
ACM
14 years 10 months ago
Hole analysis for functional coverage data
One of the main goals of coverage tools is to provide the user with informative presentation of coverage information. Specifically, information on large, cohesive sets of uncovere...
Oded Lachish, Eitan Marcus, Shmuel Ur, Avi Ziv
SIGSOFT
2007
ACM
14 years 9 months ago
Quantifying the effectiveness of testing via efficient residual path profiling
Software testing is extensively used for uncovering bugs in large, complex software. Testing relies on well designed regression test suites that anticipate all reasonable software...
Trishul M. Chilimbi, Aditya V. Nori, Kapil Vaswani
VLDB
2007
ACM
153views Database» more  VLDB 2007»
14 years 9 months ago
Declarative Information Extraction Using Datalog with Embedded Extraction Predicates
In this paper we argue that developing information extraction (IE) programs using Datalog with embedded procedural extraction predicates is a good way to proceed. First, compared ...
Warren Shen, AnHai Doan, Jeffrey F. Naughton, Ragh...
ICSE
2004
IEEE-ACM
14 years 9 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury