1716 search results - page 98 / 344 » Proving Conditional Termination |
80
Voted
TPDS
1998
15 years 13 days 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 ...
103
click to vote
MOC
2011
14 years 7 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
15 years 6 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...
142
Voted
CSFW
1999
IEEE
15 years 5 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...
102
Voted
RTA
2010
Springer
15 years 4 months 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...