13383 search results - page 111 / 2677 » Abstractions from proofs |
166
click to vote
WOLLIC
2010
Springer
15 years 3 months ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
128
click to vote
FOCS
1992
IEEE
15 years 9 months ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
138
click to vote
STOC
1994
ACM
15 years 9 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 ...
135
click to vote
ITP
2010
15 years 9 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...
161
click to vote
CORR
2007
Springer
15 years 5 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...