1894 search results - page 134 / 379 » A TLA Proof System |
90
Voted
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
In [2] Gentzen calculi for intuitionistic logic extended with an existence predicate were introduced. Such logics were first introduced by Dana Scott, who provided a proof system ...
152
Voted
RTSS
2003
IEEE
15 years 9 months 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...
113
click to vote
CADE
1992
Springer
15 years 7 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...
TPHOL
1992
IEEE
15 years 7 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...
141
Voted
CTRSA
2006
Springer
15 years 7 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...