10715 search results - page 54 / 2143 » From Tests to Proofs |
STOC
1994
ACM
14 years 1 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
ITP
2010
14 years 1 months ago
2010
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
This paper presents experiments on common knowledge logic, conducted with the help of the proof assistant Coq. The main feature of common knowledge logic is the eponymous modality...
CP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
ISPA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In a hybrid peer-to-peer environment, clients can either directly download data from their server, or share data with each other. In order to create incentives for client...