7820 search results - page 355 / 1564 » Formalization of Time and Space |
207
click to vote
MEMOCODE
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract: We present an implementation of a highthroughput cryptosorter, capable of sorting an encrypted database of eight megabytes in .15 seconds; 1102 times faster than a softwa...
115
click to vote
ICCS
2004
Springer
16 years 28 days ago
2004
Springer
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication proc...
167
click to vote
SAS
1993
Springer
15 years 11 months ago
1993
Springer
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
192
click to vote
FORMATS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integra...
187
click to vote
FMCAD
2006
Springer
15 years 11 months ago
2006
Springer
We present an approach to automatic synthesis of specifications given in Linear Time Logic. The approach is based on a translation through universal co-B