1894 search results - page 67 / 379 » A TLA Proof System |
116
click to vote
CSL
2006
Springer
15 years 4 months ago
2006
Springer
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
96
Voted
ASIACRYPT
2008
Springer
15 years 2 months ago
2008
Springer
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
108
click to vote
CADE
2004
Springer
16 years 1 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
CORR
2010
Springer
15 years 24 days ago
2010
Springer
We propose an algorithm that tests membership for regular expressions and show that the algorithm is correct. This algorithm is written in the style of a sequent proof system. The...
APAL
2005
15 years 18 days ago
2005
We give the precise correspondence between polarized linear logic and polarized classical logic. The properties of focalization and reversion of linear proofs are at the heart of ...