780 search results - page 153 / 156 » Reasoning about sets using redescription mining |
SIGSOFT
2007
ACM
14 years 10 months ago
2007
ACM
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
ICFP
2009
ACM
14 years 10 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
POPL
2005
ACM
14 years 10 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
CCS
2005
ACM
14 years 3 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
ICDT
2005
ACM
14 years 3 months ago
2005
ACM
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...