Definite expression aliasing analysis for Java bytecode

DOI10.1007/978-3-642-32943-2_6MaRDI QIDQ2915100zbMATH OpenOpenAlexFDO

Authors Đurica Nikolić, Fausto Spoto

Publication date 21 September 2012

Published in Theoretical Aspects of Computing – ICTAC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32943-2_6

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Reachability analysis of program variables
• Alias analysis in Java with reference-set representation for high-performance computing
• Expression-Based Aliasing for OO–languages
• Magic-sets for localised analysis of Java bytecode
• scientific article; zbMATH DE number 1617324

Cited in

(5)

• Reachability analysis of program variables
• Alias analysis in Java with reference-set representation for high-performance computing
• Theorem Proving in Higher Order Logics
• Magic-sets for localised analysis of Java bytecode
• Inferring complete initialization of arrays

This page was built for publication: Definite expression aliasing analysis for Java bytecode

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