Sound Control Flow Graph Extraction from Incomplete Java Bytecode Programs
2014 (English)In: Fundamental Approaches to Software Engineering: 17th International Conference, FASE 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings / [ed] Stefania Gnesi and Arend Rensink, Springer Berlin/Heidelberg, 2014, 215-229 p.Conference paper (Refereed)
The modular analysis of control flow of incompleteJava bytecode programs is challenging, mainly because of the complex semantics of the language,and the unknown inter-dependencies between the available and unavailable components.In this paper we describe a technique for incremental, modular extraction ofcontrol flow graphs that are provably sound w.r.t.~sequences of method invocations and exceptions.The extracted models are suitable for various program analyses,in particular model-checking of temporal control flow safety properties.Soundness comes at the price of over-approximation,potentially giving rise to false positives reports during verification.Still, our technique supports incremental refinement of the already extracted models,as more components code becomes available.The extraction has been implemented as the ConFlex tool, and test-cases show its utility and efficiency.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2014. 215-229 p.
, Lecture Notes in Computer Science, 8411
Incomplete Programs, Java Bytecode, Program Models, Formal Verification
Research subject Computer Science; Computer Science
IdentifiersURN: urn:nbn:se:kth:diva-154786DOI: 10.1007/978-3-642-54804-8_15ScopusID: 2-s2.0-84900555960ISBN: 978-3-642-54803-1OAI: oai:DiVA.org:kth-154786DiVA: diva2:758433
Fundamental Approaches to Software Engineering (FASE),
QC 201411172014-10-272014-10-272014-11-17Bibliographically approved