Reducing the Memory Complexity of Type-Inference Algorithms

Authors:
David Naccache;Alexei Tchoulkine;Christophe Tymen;Elena Trichina
Affiliations:
-;-;-;-
Venue:
ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Year:
2002

Citing 10
Cited 3

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Denotational semantics: a methodology for language development

Denotational semantics: a methodology for language development
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Advanced compiler design and implementation

Advanced compiler design and implementation
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Java Virtual Machine Specification

Java Virtual Machine Specification
Bytecode verification on Java smart cards

Software—Practice & Experience
On-Card Bytecode Verification for Java Card

E-SMART '01 Proceedings of the International Conference on Research in Smart Cards: Smart Card Programming and Security
The PACAP Prototype: A Tool for Detecting Java Card Illegal Flow

JavaCard '00 Revised Papers from the First International Workshop on Java on Smart Cards: Programming and Security
Java Bytecode Verification: An Overview

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification

Decomposing bytecode verification by abstract interpretation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Memory-efficient on-card byte code verification for Java cards

Proceedings of the First Workshop on Cryptography and Security in Computing Systems
Hardware-enforced Protection against Software Reverse-Engineering based on an Instruction Set Encoding

Proceedings of ACM SIGPLAN on Program Protection and Reverse Engineering Workshop 2014

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Java Virtual Machine, the byte-code verifier checks low-level security properties that ensure that the downloaded code cannot bypass the virtual machine's security mechanisms. One of the statically ensured properties is type safety. The type-inference phase is the overwhelming resource-consuming part of the verification process.This paper addresses the RAM bottleneck met while verifying mobile code in memory-constrained environments such as smart-cards. We propose to modify the algorithm in a way that significantly reduces memory consumption.