7167 search results - page 544 / 1434 » Answer Set Programming |
140
click to vote
POPL
2010
ACM
16 years 2 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
143
click to vote
TACAS
2009
Springer
15 years 11 months ago
2009
Springer
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
152
click to vote
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
142
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
137
click to vote
STOC
2007
ACM
16 years 5 months ago
2007
ACM
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...