التفاصيل البيبلوغرافية
العنوان: |
Efficient Bytecode Verification using Immediate Postdominators in Control Flow Graphs |
المؤلفون: |
BERNARDESCHI, CINZIA, DE FRANCESCO, NICOLETTA, MARTINI L. |
المساهمون: |
Meersman, R, Tari, Z, Bernardeschi, Cinzia, DE FRANCESCO, Nicoletta, Martini, L. |
بيانات النشر: |
Springer Berlin Heidelberg |
سنة النشر: |
2003 |
المجموعة: |
ARPI - Archivio della Ricerca dell'Università di Pisa |
الوصف: |
Java Virtual Machine (JVM) code (also called bytecode) [11] can be downloaded by untrusted sources and executed directly. A component of the Java security model is the Java bytecode Verifier, which makes sure that the bytecode is safe by static analysis at loading time and prior to execution. The bytecode Verifier checks type correctness, stack overflow or underflow, code containment, registers and objects initialization, access control. The first bytecode verification algorithm is due to Gosling and Yellin. Most JVM instructions are typed and the algorithm is based on an abstract interpreter for the instructions that operates over types instead of values. Almost all existing Verifiers implement this algorithm [4,11,12]. |
نوع الوثيقة: |
conference object |
وصف الملف: |
STAMPA |
اللغة: |
English |
Relation: |
info:eu-repo/semantics/altIdentifier/wos/WOS:000188513300048; ispartofbook:ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2003: OTM 2003 WORKSHOPS; Workshop on Java Technologies for Real Time and Embedded Systems; volume:LNCS 2889; firstpage:425; lastpage:436; numberofpages:12; journal:LECTURE NOTES IN COMPUTER SCIENCE; alleditors:Meersman, R; Tari, Z; http://hdl.handle.net/11568/78639; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-0242543344 |
الاتاحة: |
http://hdl.handle.net/11568/78639 |
رقم الانضمام: |
edsbas.2A35AC4D |
قاعدة البيانات: |
BASE |