Work

JVM Bytecode Verification Without Dataflow Analysis

Year: 2005

Type: article

Abstract: Bytecode verification algorithms are traditionally based on dataflow analysis. We present an alternative algorithm that first restructures the bytecode and then infers a type signature for each method in a manner typical of functional programming languages. We also give an operational semantics to an algebra of structured bytecode and thereby prove both that restructuring preserves semantics and that our type inference is sound.

Source: Electronic Notes in Theoretical Computer Science

DOI: 10.1016/j.entcs.2005.02.029

Authors: Ian Bayley, Sam Shiel

Institution: Oxford Brookes University

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W2078111647

FWCI:

Cites: 10

Cited by:

Related to: 10