Information flow analysis for a typed assembly language with polymorphic stacks

Detalles Bibliográficos
Autor Principal: Bonelli, Eduardo
Otros autores o Colaboradores: Compagnoni, Adriana, Medel, Ricardo H.
Formato: Capítulo de libro
Lengua:inglés
Series:^p Datos electrónicos (1 archivo : 680 KB)
Temas:
Acceso en línea:www.springerlink.com/content/9229l051t8n37687/fulltext.pdf
Consultar en el Cátalogo
Resumen:We study secure information flow in a stack based Typed Assembly Language (TAL). We define a TAL with an execution stack and establish the soundness of its type system by proving non-interference. One of the problems of studying information flow for a low-level language is the absence of high-level control flow constructs that guide information flow analysis in high-level languages. Furthermore, in the presence of an execution stack, code that frees space on the stack must be constrained in order to avoid illegal flows. Finally, in the presence of stack polymorphism, we must ensure that type variables are instantiated without observable differences. These issues are addressed by introducing junction points into the type system, ensuring that they behave as ordered linear continuations, and that they interact safely with the execution stack. We also discuss several limitations of our approach and point out some remaining open issues.
Notas:Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.) -- Disponible también en línea vía suscripción BECyT (Cons. 10-03-2008)

MARC

LEADER 00000naa a2200000 a 4500
003 AR-LpUFIB
005 20250311170238.0
008 230201s2006 xx o 000 0 eng d
024 8 |a DIF-M2383  |b 2470  |z DIF002285 
040 |a AR-LpUFIB  |b spa  |c AR-LpUFIB 
100 1 |a Bonelli, Eduardo 
245 1 0 |a Information flow analysis for a typed assembly language with polymorphic stacks 
490 0 |a ^p Datos electrónicos (1 archivo : 680 KB) 
500 |a Formato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.) -- Disponible también en línea vía suscripción BECyT (Cons. 10-03-2008) 
520 |a We study secure information flow in a stack based Typed Assembly Language (TAL). We define a TAL with an execution stack and establish the soundness of its type system by proving non-interference. One of the problems of studying information flow for a low-level language is the absence of high-level control flow constructs that guide information flow analysis in high-level languages. Furthermore, in the presence of an execution stack, code that frees space on the stack must be constrained in order to avoid illegal flows. Finally, in the presence of stack polymorphism, we must ensure that type variables are instantiated without observable differences. These issues are addressed by introducing junction points into the type system, ensuring that they behave as ordered linear continuations, and that they interact safely with the execution stack. We also discuss several limitations of our approach and point out some remaining open issues. 
534 |a Workshop on Construction and Analysis of Safe, Secure and Interoperable Smart devices (CASSIS05).EN: G. Barthe et al. (Eds.): CASSIS 2005, LNCS 3956, pp. 37–56, 2006. Springer-Verlag, Berlin-Heidelberg, 2006. 
650 4 |a LENGUAJE ENSAMBLADOR 
650 4 |a CONTROL DE FLUJO DE INFORMACIÓN 
650 4 |a SISTEMAS OPERATIVOS 
650 4 |a SEGURIDAD Y PROTECCIÓN 
700 1 |a Compagnoni, Adriana 
700 1 |a Medel, Ricardo H. 
856 4 0 |u www.springerlink.com/content/9229l051t8n37687/fulltext.pdf 
942 |c CP 
952 |0 0  |1 0  |4 0  |6 A0050  |7 3  |8 BD  |9 76498  |a DIF  |b DIF  |d 2025-03-11  |l 0  |o A0050  |r 2025-03-11 17:02:38  |u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=52  |w 2025-03-11  |y CP 
999 |c 52181  |d 52181