1894 search results - page 120 / 379 » A TLA Proof System |
129
Voted
BIRTHDAY
2003
Springer
15 years 4 months ago
2003
Springer
Aspects are intended to add needed functionality to a system or to treat concerns of the system by augmenting or changing the existing code in a manner that cross-cuts the usual c...
118
Voted
IANDC
2010
14 years 11 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
101
Voted
CSL
2007
Springer
15 years 7 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
138
Voted
HASKELL
2005
ACM
15 years 6 months ago
2005
ACM
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
110
Voted
EUROCRYPT
2000
Springer
15 years 4 months ago
2000
Springer
Cryptography is more and more concerned with elaborate protocols involving many participants. In some cases, it is crucial to be sure that players behave fairly especially when the...