1894 search results - page 315 / 379 » A TLA Proof System |
108
click to vote
WWW
2009
ACM
16 years 4 months ago
2009
ACM
We show how a number of novel email search features can be implemented without any kind of natural language processing (NLP) or advanced data mining. Our approach inspects the ema...
246
click to vote
PADL
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In this paper, we present our initial design and implementation of a declarative network verifier (DNV). DNV utilizes theorem proving, a well established verification tec...
253
click to vote
POPL
2009
ACM
16 years 4 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
138
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
145
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...