6978 search results - page 144 / 1396 » On Proofs in System P |
129
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
185
click to vote
FC
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The banking industry in Norway has developed a new security infrastructure for conducting commerce on the Internet. The initiative, called BankID, aims to become a nation...
162
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
155
click to vote
CSFW
1999
IEEE
15 years 10 months ago
1999
IEEE
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
165
click to vote
FTRTFT
1998
Springer
15 years 10 months ago
1998
Springer
We present a compositional semantics of synchronous systems that captures both safety and progress properties of such systems. The fair synchronous transitions systems (fsts) mode...