Greedy pebbling for proof space compression
Automated reasoning tools for the verification and synthesis of software often produce proofs to allow independent certification of the correctness of the produced solutions. As proofs can be large, this paper considers the problem of compressing proofs with respect to their space, which is approximately proportional to the memory necessary to check them. Proof checking with a small amount of available memory is analogous to playing a pebbling game with a small number of pebbles. This paper...[Show more]
|Collections||ANU Research Publications|
|Source:||International Journal on Software Tools for Technology Transfer|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.