Justification logic as a foundation for certifying mobile computation

Detalles Bibliográficos
Autor Principal: Bonelli, Eduardo
Otros autores o Colaboradores: Feller, Federico
Formato: Capítulo de libro
Lengua:inglés
Temas:
Acceso en línea:http://dx.doi.org/10.1016/j.apal.2011.09.007
Consultar en el Cátalogo
Resumen: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.
Notas:Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
Descripción Física:1 archivo (322,0 kB)
DOI:10.1016/j.apal.2011.09.007