Compact Proof Certificates for Linear Logic
Linear logic is increasingly being used as a tool for communicating reasoning agents in domains such as authorization, access control, electronic voting, etc., where proof certificates represent evidence that must be verified by proof consumers as part of higher protocols. Controlling the size of these certificates is critical. We assume that the proof consumer is allowed to do some search to reconstruct details of the full proof that are omitted from the certificates. Because the decision problem for linear logic is unsolvable, the certificate must contain at least enough information to bound the search: we show how to use the sequence of contractions in the sequent proof for this bound. The remaining content of the proof, in particular the information about resource divisions, can then be omitted from the certificate. We also describe a technique for giving a variable amount of additional search hints to the proof consumer to limit its non-determinism.
Unable to display preview. Download preview PDF.
- 2.Boespflug, M.: Conception d’un noyau de vérification de preuves pour le λΠ-calcul modulo. PhD thesis, Ecole Polytechnique (2011)Google Scholar
- 4.Chaudhuri, K.: The Focused Inverse Method for Linear Logic. PhD thesis, Carnegie Mellon University, Technical report CMU-CS-06-162 (December 2006)Google Scholar
- 7.Chaudhuri, K., Guenot, N., Straßburger, L.: The Focused Calculus of Structures. In: Computer Science Logic: 20th Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), pp. 159–173. Schloss Dagstuhl–Leibniz-Zentrum für Informatik (September 2011)Google Scholar
- 11.Hodas, J., Watkins, K., Tamura, N., Kang, K.-S.: Efficient implementation of a linear logic programming language. In: Jaffar, J. (ed.) Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, pp. 145–159 (1998)Google Scholar
- 12.Laurent, O.: Etude de la polarisation en logique. PhD thesis, Université Aix-Marseille II (March 2002)Google Scholar
- 13.Laurent, O.: A proof of the focalization property of linear logic (May 2004) (unpublished note)Google Scholar
- 18.Necula, G.C.: Proof-carrying code. In: Conference Record of the 24th Symposium on Principles of Programming Languages 1997, Paris, France, pp. 106–119. ACM Press (1997)Google Scholar
- 19.Straßburger, L.: Linear Logic and Noncommutativity in the Calculus of Structures. PhD thesis, Technische Universität Dresden (2003)Google Scholar