1686 search results - page 272 / 338 » Programs as polygraphs: computability and complexity |
119
click to vote
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
HIPC
2004
Springer
15 years 3 months ago
2004
Springer
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
94
Voted
PARA
2004
Springer
15 years 3 months ago
2004
Springer
Cache optimizations typically include code transformations to increase the locality of memory accesses. An orthogonal approach is to enable for latency hiding by introducing prefet...
ICS
2003
Tsinghua U.
15 years 2 months ago
2003
Tsinghua U.
This paper performs a comprehensive investigation of dynamic selection for long atomic traces. It introduces a classification of trace selection methods and discusses existing and...
UM
2010
Springer
15 years 2 months ago
2010
Springer
A Knowledge Worker (KW) uses her computer to perform different tasks for which she gathers and uses information from disparate sources such as the Web and e-mail, and creates new ...