<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cinzia Bernardeschi</style></author><author><style face="normal" font="default" size="100%">Giuseppe Lettieri</style></author><author><style face="normal" font="default" size="100%">Luca Martini</style></author><author><style face="normal" font="default" size="100%">Paolo Masci</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Space-Aware Bytecode Verifier for Java Cards</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Theoretical Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">141</style></volume><pages><style face="normal" font="default" size="100%">237–254</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The bytecode verification is a key point of the security chain of the Java Platform. This feature is optional in many embedded devices since the memory requirements of the verification process are too high. In this paper we propose a verification algorithm that remarkably reduces the use of the memory by performing the verification during multiple specialized passes. The algorithm reduces the type encoding space by operating on different abstractions of the domain of types. The results of the experiments show that this bytecode verification can be performed directly on small memory systems.&lt;/p&gt;
</style></abstract></record></records></xml>