101 search results - page 20 / 21 » Zap: Automated Theorem Proving for Software Analysis |
POPL
2010
ACM
14 years 3 months ago
2010
ACM
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
BMCBI
2005
13 years 5 months ago
2005
Backgorund: The completion of the Human Genome Project has resulted in large quantities of biological data which are proving difficult to manage and integrate effectively. There i...
BMCBI
2010
13 years 5 months ago
2010
Background: Determining beforehand specific positions to align (anchor points) has proved valuable for the accuracy of automated multiple sequence alignment (MSA) software. This f...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
POPL
2007
ACM
14 years 6 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...