TFA: an efficient and precise virtual method call resolution for Java

DOI10.1007/S00165-020-00518-ZMaRDI QIDQ826353zbMATH OpenOpenAlexFDO

Authors Xilong Zhuo, Chenyi Zhang

Publication date 4 January 2021

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-020-00518-z

zbMATH Keywords

call-graph constructionstatic analysistype analysisvirtual method resolution

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1948396
• Programming Languages and Systems
• scientific article; zbMATH DE number 1617324
• scientific article; zbMATH DE number 2087559
• Type-safe method inlining

Cites work

• scientific article; zbMATH DE number 1956463 (Why is no real title available?)
• scientific article; zbMATH DE number 1407672 (Why is no real title available?)
• Pick your contexts well, understanding object-sensitivity

Cited in

(6)

• Type-safe method inlining
• scientific article; zbMATH DE number 2089398 (Why is no real title available?)
• scientific article; zbMATH DE number 1948396 (Why is no real title available?)
• scientific article; zbMATH DE number 1533444 (Why is no real title available?)
• scientific article; zbMATH DE number 2087559 (Why is no real title available?)
• Programming Languages and Systems

Describes a project that uses

Uses Software

• Soot
• Featherweight Java
• SPECjvm2008
• TFA

This page was built for publication: TFA: an efficient and precise virtual method call resolution for Java

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