1941 search results - page 169 / 389 » Reasoning about Computations Using Two-Levels of Logic |
137
click to vote
CCS
2011
ACM
14 years 3 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
115
Voted
BIRTHDAY
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
152
click to vote
LICS
2007
IEEE
15 years 9 months ago
2007
IEEE
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
158
click to vote
ASIAN
2003
Springer
15 years 8 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
127
Voted
CSL
2005
Springer
15 years 9 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...