Amanote Research

Amanote Research

    RegisterSign In

Magic-Sets for Localised Analysis of Java Bytecode

Higher-Order and Symbolic Computation
doi 10.1007/s10990-010-9063-7
Full Text
Open PDF
Abstract

Available in full text

Date

March 1, 2010

Authors
Fausto SpotoÉtienne Payet
Publisher

Springer Science and Business Media LLC


Related search

The Strengths and Behavioral Quirks of Java Bytecode Decompilers

2019English

Decompilation of Java Bytecode to Prolog by Partial Evaluation

Information and Software Technology
Computer Science ApplicationsInformation SystemsSoftware
2009English

Design and Implementation of Bytecode-Based Java Slicing System

English

A Simplified Java Bytecode Compilation System for Resource-Constrained Embedded Processors

2007English

Dynamic Instrumentation of Distributed Java Applications Using Bytecode Modifications

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Portable and Accurate Collection of Calling-Context-Sensitive Bytecode Metrics for the Java Virtual Machine

2011English

Constant Sum Partition of Sets Integers and Distance Magic Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Verified Lightweight Bytecode Verification

Concurrency Computation Practice and Experience
Computer NetworksCommunicationsComputer Science ApplicationsComputational TheoryMathematicsTheoretical Computer ScienceSoftware
2001English

Granularity of Constraint-Based Analysis for Java

2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy