Bytecode verification on Java smart cards

DOI10.1002/SPE.438zbMATH Open1009.68891OpenAlexW2012470235MaRDI QIDQ4791013FDOQ4791013

Authors: Xavier Leroy 

Publication date: 4 February 2003

Published in: Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/spe.438

Recommendations

• scientific article; zbMATH DE number 1857507
• scientific article; zbMATH DE number 2030038
• scientific article; zbMATH DE number 1798185
• Java bytecode verification: Algorithms and formalizations
• Lightweight bytecode verification

zbMATH Keywords

securityJavaJava Cardsmart cardsbytecode verificationapplets

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Data encryption (aspects in computer science) (68P25)

Cites Work

• Title not available (Why is that?)

Cited In (15)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A B model for ensuring soundness of a large subset of the Java card virtual machine
• Programming Languages and Systems
• Using abstract interpretation to add type checking for interfaces in Java bytecode verification
• Using postdomination to reduce space requirements of data flow analysis
• Title not available (Why is that?)
• Java bytecode verification: Algorithms and formalizations
• Title not available (Why is that?)
• Title not available (Why is that?)
• A program logic for resources
• Instruction-level security analysis for information flow in stack-based assembly languages
• A verifiable low-level concurrent programming model based on colored Petri nets
• Title not available (Why is that?)
• A certified lightweight non-interference Java bytecode verifier

This page was built for publication: Bytecode verification on Java smart cards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791013)