1274 search results - page 56 / 255 » New Proofs for |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
ACNS
2006
Springer
14 years 1 months ago
2006
Springer
We propose a new password-based 3-party protocol with a formal security proof in the standard model. Under reasonable assumptions we show that our new protocol is more efficient t...
IPPS
2003
IEEE
14 years 28 days ago
2003
IEEE
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and pro...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...