12774 search results - page 314 / 2555 » A Framework for Proof Systems |
192
click to vote
RTSS
2003
IEEE
16 years 15 hour ago
2003
IEEE
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
158
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
146
click to vote
TPHOL
1992
IEEE
15 years 10 months ago
1992
IEEE
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
191
click to vote
CTRSA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present a non-interactive chosen ciphertext secure threshold encryption system. The proof of security is set in the standard model and does not use random oracles. Our...
154
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study rational streams (over a field) from a coalgebraic perspective. Exploiting the finality of the set of streams, we present an elementary and uniform proof of the ...