793 search results - page 71 / 159 » Argumentation and standards of proof |
119
Voted
TPHOL
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract. We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics enable the verification of partial correctne...
95
Voted
TCC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifi...
CORR
2008
Springer
15 years 25 days ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
115
click to vote
ENTCS
2008
15 years 24 days ago
2008
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
124
click to vote
ENTCS
2006
15 years 22 days ago
2006
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...