2137 search results - page 387 / 428 » Proving Abstract Non-interference |
119
Voted
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
90
Voted
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
127
Voted
MOBIHOC
2008
ACM
16 years 1 months ago
2008
ACM
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
125
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
115
Voted
POPL
2010
ACM
15 years 11 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...