Certificate size reduction in abstraction-carrying code

Albert Albiol, Elvira, Arenas Sánchez, Purificación, Puebla Sánchez, Alvaro Germán and Hermenegildo, Manuel V. ORCID: https://orcid.org/0000-0002-7583-323X (2010). Certificate size reduction in abstraction-carrying code. "CoRR", v. abs/10 ;


Title: Certificate size reduction in abstraction-carrying code
Item Type: Article
Título de Revista/Publicación: CoRR
Date: 13 October 2010
Volume: abs/10
Freetext Keywords: Proof-carrying code, Abstraction-carrying code, Static analysis, Reduced certificates, Código con demostración, Análisis estático, Certificados reducidos.
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[thumbnail of HERME_NB_2010-1.pdf]
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (2MB) | Preview


Abstraction-Carrying Code (ACC) has recently been proposed as a framework for mobile code safety in which the code supplier provides a program together with an abstraction (or abstract model of the program) whose validity entails compliance with a predefined safety policy. The abstraction plays thus the role of safety certificate and its generation is carried out automatically by a fixpoint analyzer. The advantage of providing a (fixpoint) abstraction to the code consumer is that its validity is checked in a single pass (i.e., one iteration) of an abstract interpretation-based checker. A main challenge to make ACC useful in practice is to reduce the size of certificates as much as possible while at the same time not increasing checking time. The intuitive idea is to only include in the certificate information that the checker is unable to reproduce without iterating. We introduce the notion of reduced certificate which characterizes the subset of the abstraction which a checker needs in order to validate (and re-construct) the fall certificate in a single pass. Based on this notion, we instrument a generic analysis algorithm with the necessary extensions in order to identify the information relevant to the checker. Interestingly, the fact that the reduced certificate omits (parts of) the abstraction has implications in the design of the checker. We provide the sufficient conditions which allow us to ensure that 1) if the checker succeeds in validating the certificate, then the certificate is valid for the program (correctness) and 2) the checker will succeed for any reduced certificate which is valid (completeness). Our approach has been implemented and benchmarked within the CiaoPP system. The experimental results show t h a t our proposal is able to greatly reduce the size of certificates in practice. To appear in Theory and Practice of Logic Programming (TPLP).

More information

Item ID: 14826
DC Identifier: https://oa.upm.es/14826/
OAI Identifier: oai:oa.upm.es:14826
Official URL: http://arxiv.org/abs/1010.4533
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 11 Apr 2013 06:18
Last Modified: 27 Feb 2023 09:57
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM