Milojkovic, Nevena (July 2014). Towards cheap, accurate polymorphism detection. In: Zaytsev, Vadim (ed.) SATToSE'14: Pre-Proceedings of the 7th International Seminar Series on Advanced Techniques & Tools for Software Evolution. L’Aquila, Italy. 09.07.-11.07.2014.
![[img]](https://boris.unibe.ch/style/images/fileicons/text.png) |
Text
Milo14a.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (113kB) |
Polymorphism, along with inheritance, is one of the most important features in object-oriented languages, but it is also one of the biggest obstacles to source code comprehension. Depending on the run-time type of the receiver of a message, any one of a number of possible methods may be invoked. Several algorithms for creating accurate call-graphs using static analysis already exist, however, they consume significant time and memory resources. We propose an approach that will combine static and dynamic analysis and yield the best possible precision with a minimal trade-off between used resources and accuracy.
Item Type: |
Conference or Workshop Item (Paper) |
|---|---|
Division/Institute: |
08 Faculty of Science > Institute of Computer Science (INF) 08 Faculty of Science > Institute of Computer Science (INF) > Software Composition Group (SCG) [discontinued] |
UniBE Contributor: |
Lazarevic, Nevena |
Subjects: |
000 Computer science, knowledge & systems 500 Science > 510 Mathematics |
Language: |
English |
Submitter: |
Oscar Nierstrasz |
Date Deposited: |
23 Apr 2015 08:28 |
Last Modified: |
02 Mar 2023 23:26 |
Uncontrolled Keywords: |
scg-pub snf-asa missing-doi dynamic analysis scg14 jb14 |
BORIS DOI: |
10.7892/boris.67049 |
URI: |
https://boris.unibe.ch/id/eprint/67049 |
Actions (login required)
 |
Edit item |