Bytecode verification on Java smart cards
From MaRDI portal
Publication:4791013
Recommendations
Cited in
(15)- Instruction-level security analysis for information flow in stack-based assembly languages
- scientific article; zbMATH DE number 1798185 (Why is no real title available?)
- A B model for ensuring soundness of a large subset of the Java card virtual machine
- scientific article; zbMATH DE number 2088502 (Why is no real title available?)
- scientific article; zbMATH DE number 2030038 (Why is no real title available?)
- A program logic for resources
- A verifiable low-level concurrent programming model based on colored Petri nets
- Using abstract interpretation to add type checking for interfaces in Java bytecode verification
- A certified lightweight non-interference Java bytecode verifier
- Java bytecode verification: Algorithms and formalizations
- Programming Languages and Systems
- Using postdomination to reduce space requirements of data flow analysis
- scientific article; zbMATH DE number 1950608 (Why is no real title available?)
- scientific article; zbMATH DE number 1857507 (Why is no real title available?)
- scientific article; zbMATH DE number 1980953 (Why is no real title available?)
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)