×

Reducing the memory complexity of type-inference algorithms. (English) Zbl 1023.68563

Deng, Robert (ed.) et al., Information and communications security. 4th international conference, ICICS 2002, Singapore, December 9-12, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2513, 109-121 (2002).
Summary: In the Java Virtual Machine, the byte-code verifier checks low-level security properties that ensure that the downloaded code cannot bypass the virtual machine’s security mechanisms. One of the statically ensured properties is type safety. The type-inference phase is the overwhelming resource-consuming part of the verification process.
This paper addresses the RAM bottleneck met while verifying mobile code in memory-constrained environments such as smart-cards. We propose to modify the algorithm in a way that significantly reduces memory consumption.
For the entire collection see [Zbl 1007.00072].

MSC:

68P25 Data encryption (aspects in computer science)
94A60 Cryptography
PDFBibTeX XMLCite
Full Text: Link