<?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%">Nicoletta De Francesco</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%">Decomposing bytecode verification by abstract interpretation</style></title><secondary-title><style face="normal" font="default" size="100%">ACM Transactions on Programming Languages and Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><volume><style face="normal" font="default" size="100%">31</style></volume><pages><style face="normal" font="default" size="100%">1-63</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Bytecode verification is a key point in the security chain of the Java platform. This feature is only optional in many embedded devices since the memory requirements of the verification process are too high. In this article we propose an approach that significantly reduces the use of memory by a serial/parallel decomposition of the verification into multiple specialized passes. The algorithm reduces the type encoding space by operating on different abstractions of the domain of types. The results of our evaluation show that this bytecode verification can be performed directly on small memory systems. The method is formalized in the framework of abstract interpretation.&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">1</style></issue></record></records></xml>