1894 search results - page 63 / 379 » A TLA Proof System |
95
Voted
ENTCS
2006
15 years 21 days ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
107
click to vote
JCS
2010
14 years 11 months ago
2010
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
84
Voted
CRYPTO
2009
Springer
15 years 7 months ago
2009
Springer
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
103
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
74
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...