Sciweavers

53 search results - page 8 / 11
» Testing and Debugging Techniques for Answer Set Solver Devel...
Sort
View
FOCS
2009
IEEE
14 years 3 months ago
Local Graph Partitions for Approximation and Testing
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
Avinatan Hassidim, Jonathan A. Kelner, Huy N. Nguy...
SIGSOFT
2006
ACM
14 years 9 months ago
Dynamic slicing long running programs through execution fast forwarding
Fixing runtime bugs in long running programs using trace based analyses such as dynamic slicing was believed to be prohibitively expensive. In this paper, we present a novel execu...
Xiangyu Zhang, Sriraman Tallam, Rajiv Gupta
ISSTA
2009
ACM
14 years 2 months ago
Identifying semantic differences in AspectJ programs
Program differencing is a common means of software debugging. Although many differencing algorithms have been proposed for procedural and object-oriented languages like C and Ja...
Martin Th Görg, Jianjun Zhao
CCS
2010
ACM
13 years 8 months ago
Sidebuster: automated detection and quantification of side-channel leaks in web application development
A web application is a "two-part" program, with its components deployed both in the browser and in the web server. The communication between these two components inevita...
Kehuan Zhang, Zhou Li, Rui Wang 0010, XiaoFeng Wan...
ECAI
2004
Springer
14 years 5 days ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...