Justification Logic as a foundation for certifying mobile computation

Autores
Bonelli, Eduardo Augusto; Feller, Federico
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We explore an intuitionistic fragment of Artëmov's . Justification Logic as a type system for a programming language for . mobile units. Such units consist of both a code and a certificate component. Our language, the . Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system . additionally ensures correct . certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.
Fil: Bonelli, Eduardo Augusto. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Feller, Federico. Universidad Nacional de La Plata. Facultad de Informática. Laboratorio de Investigación y Formación en Informática Avanzada; Argentina
Materia
CURRY-DE BRUIJN-HOWARD ISOMORPHISM
JUSTIFICATION LOGIC
MOBILE COMPUTATION
TYPED LAMBDA CALCULUS
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/195798
Acceder
id CONICETDig_13e70c2e74c1522404905d1159c8b7c7
oai_identifier_str oai:ri.conicet.gov.ar:11336/195798
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Justification Logic as a foundation for certifying mobile computationBonelli, Eduardo AugustoFeller, FedericoCURRY-DE BRUIJN-HOWARD ISOMORPHISMJUSTIFICATION LOGICMOBILE COMPUTATIONTYPED LAMBDA CALCULUShttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We explore an intuitionistic fragment of Artëmov's . Justification Logic as a type system for a programming language for . mobile units. Such units consist of both a code and a certificate component. Our language, the . Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system . additionally ensures correct . certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.Fil: Bonelli, Eduardo Augusto. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Feller, Federico. Universidad Nacional de La Plata. Facultad de Informática. Laboratorio de Investigación y Formación en Informática Avanzada; ArgentinaElsevier Science2012-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/195798Bonelli, Eduardo Augusto; Feller, Federico; Justification Logic as a foundation for certifying mobile computation; Elsevier Science; Annals Of Pure And Applied Logic; 163; 7; 7-2012; 935-9500168-0072CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0168007211001291info:eu-repo/semantics/altIdentifier/doi/10.1016/j.apal.2011.09.007info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T12:20:13Zoai:ri.conicet.gov.ar:11336/195798instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-22 12:20:14.216CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Justification Logic as a foundation for certifying mobile computation
title Justification Logic as a foundation for certifying mobile computation
spellingShingle Justification Logic as a foundation for certifying mobile computation
Bonelli, Eduardo Augusto
CURRY-DE BRUIJN-HOWARD ISOMORPHISM
JUSTIFICATION LOGIC
MOBILE COMPUTATION
TYPED LAMBDA CALCULUS
title_short Justification Logic as a foundation for certifying mobile computation
title_full Justification Logic as a foundation for certifying mobile computation
title_fullStr Justification Logic as a foundation for certifying mobile computation
title_full_unstemmed Justification Logic as a foundation for certifying mobile computation
title_sort Justification Logic as a foundation for certifying mobile computation
dc.creator.none.fl_str_mv Bonelli, Eduardo Augusto
Feller, Federico
author Bonelli, Eduardo Augusto
author_facet Bonelli, Eduardo Augusto
Feller, Federico
author_role author
author2 Feller, Federico
author2_role author
dc.subject.none.fl_str_mv CURRY-DE BRUIJN-HOWARD ISOMORPHISM
JUSTIFICATION LOGIC
MOBILE COMPUTATION
TYPED LAMBDA CALCULUS
topic CURRY-DE BRUIJN-HOWARD ISOMORPHISM
JUSTIFICATION LOGIC
MOBILE COMPUTATION
TYPED LAMBDA CALCULUS
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We explore an intuitionistic fragment of Artëmov's . Justification Logic as a type system for a programming language for . mobile units. Such units consist of both a code and a certificate component. Our language, the . Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system . additionally ensures correct . certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.
Fil: Bonelli, Eduardo Augusto. Universidad Nacional de Quilmes. Departamento de Ciencia y Tecnología; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina
Fil: Feller, Federico. Universidad Nacional de La Plata. Facultad de Informática. Laboratorio de Investigación y Formación en Informática Avanzada; Argentina
description We explore an intuitionistic fragment of Artëmov's . Justification Logic as a type system for a programming language for . mobile units. Such units consist of both a code and a certificate component. Our language, the . Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system . additionally ensures correct . certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.
publishDate 2012
dc.date.none.fl_str_mv 2012-07
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/195798
Bonelli, Eduardo Augusto; Feller, Federico; Justification Logic as a foundation for certifying mobile computation; Elsevier Science; Annals Of Pure And Applied Logic; 163; 7; 7-2012; 935-950
0168-0072
CONICET Digital
CONICET
url http://hdl.handle.net/11336/195798
identifier_str_mv Bonelli, Eduardo Augusto; Feller, Federico; Justification Logic as a foundation for certifying mobile computation; Elsevier Science; Annals Of Pure And Applied Logic; 163; 7; 7-2012; 935-950
0168-0072
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S0168007211001291
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.apal.2011.09.007
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier Science
publisher.none.fl_str_mv Elsevier Science
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846782647695572992
score 12.982451

Publicaciones similares