1716 search results - page 98 / 344 » Proving Conditional Termination |
TPDS
1998
13 years 8 months ago
1998
—Rollback-Dependency Trackability (RDT) is a property that states that all rollback dependencies between local checkpoints are on-line trackable by using a transitive dependency ...
MOC
2011
13 years 3 months ago
2011
Abstract. We prove optimal order error estimates for the Raviart-Thomas interpolation of arbitrary order under the maximum angle condition for triangles and under two generalizatio...
FPGA
2003
ACM
14 years 2 months ago
2003
ACM
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
CSFW
1999
IEEE
14 years 1 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
RTA
2010
Springer
14 years 22 days ago
2010
Springer
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...