JTDec: A tool for tree decompositions in soot Conference Paper

Author(s): Chatterjee, Krishnendu; Kafshdar Goharshady, Amir; Pavlogiannis, Andreas
Title: JTDec: A tool for tree decompositions in soot
Title Series: LNCS
Affiliation IST Austria
Conference Title: ATVA: Automated Technology for Verification and Analysis
Volume: 10482
Conference Dates: October 3 - 6, 2017
Conference Location: Pune, India
Publisher: Springer  
Date Published: 2017-01-01
Start Page: 59
End Page: 66
Copyright Statement: The notion of treewidth of graphs has been exploited for faster algorithms for several problems arising in verification and program analysis. Moreover, various notions of balanced tree decompositions have been used for improved algorithms supporting dynamic updates and analysis of concurrent programs. In this work, we present a tool for constructing tree-decompositions of CFGs obtained from Java meth- ods, which is implemented as an extension to the widely used Soot framework. The experimental results show that our implementation on real-world Java benchmarks is very efficient. Our tool also provides the first implementation for balancing tree- decompositions. In summary, we present the first tool support for exploiting treewidth in the static analysis problems on Java programs.
Sponsor: Vienna Science and Technology Fund (WWTF) ICT15-003, Austrian Science Fund (FWF) NFN Grant No. S11407-N23 (RiSE/SHiNE) and ERC Start grant (279307: Graph Games)
DOI: 10.1007/978-3-319-68167-2_4
Open access: yes (repository)
IST Austria Authors