989 search results - page 10 / 198 » Pebbling and Proofs of Work |
APAL
1999
13 years 8 months ago
1999
This article surveys R. Parikh's work on feasibility, bounded arithmetic and the complexity of proofs. We discuss in depth two of Parikh's papers on these subjects and s...
CSL
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
ENTCS
2006
13 years 9 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
CLEIEJ
2007
13 years 9 months ago
2007
This work presents proof rules for termination and non-termination for a subset of a C-like language that consists of the statements : assignation, composition, if, skip and while...
AOSD
2012
ACM
12 years 4 months ago
2012
ACM
In this work we consider specification and compositional verification for interference detection when several aspects are woven together under joint-weaving semantics without re...