{"alternative_title":["LNCS"],"doi":"10.1007/978-3-319-68167-2_4","quality_controlled":"1","_id":"949","year":"2017","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","editor":[{"full_name":"D'Souza, Deepak","last_name":"D'Souza","first_name":"Deepak"}],"has_accepted_license":"1","date_updated":"2024-04-18T22:30:33Z","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","last_name":"Goharshady","first_name":"Amir","full_name":"Goharshady, Amir"},{"full_name":"Pavlogiannis, Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","first_name":"Andreas"}],"external_id":{"isi":["000723567800004"]},"status":"public","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"8934"}]},"citation":{"ista":"Chatterjee K, Goharshady AK, Pavlogiannis A. 2017. JTDec: A tool for tree decompositions in soot. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 10482, 59–66.","mla":"Chatterjee, Krishnendu, et al. <i>JTDec: A Tool for Tree Decompositions in Soot</i>. Edited by Deepak D’Souza, vol. 10482, Springer, 2017, pp. 59–66, doi:<a href=\"https://doi.org/10.1007/978-3-319-68167-2_4\">10.1007/978-3-319-68167-2_4</a>.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Andreas Pavlogiannis. “JTDec: A Tool for Tree Decompositions in Soot.” edited by Deepak D’Souza, 10482:59–66. Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-68167-2_4\">https://doi.org/10.1007/978-3-319-68167-2_4</a>.","ama":"Chatterjee K, Goharshady AK, Pavlogiannis A. JTDec: A tool for tree decompositions in soot. In: D’Souza D, ed. Vol 10482. Springer; 2017:59-66. doi:<a href=\"https://doi.org/10.1007/978-3-319-68167-2_4\">10.1007/978-3-319-68167-2_4</a>","apa":"Chatterjee, K., Goharshady, A. K., &#38; Pavlogiannis, A. (2017). JTDec: A tool for tree decompositions in soot. In D. D’Souza (Ed.) (Vol. 10482, pp. 59–66). Presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India: Springer. <a href=\"https://doi.org/10.1007/978-3-319-68167-2_4\">https://doi.org/10.1007/978-3-319-68167-2_4</a>","ieee":"K. Chatterjee, A. K. Goharshady, and A. Pavlogiannis, “JTDec: A tool for tree decompositions in soot,” presented at the ATVA: Automated Technology for Verification and Analysis, Pune, India, 2017, vol. 10482, pp. 59–66.","short":"K. Chatterjee, A.K. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66."},"month":"01","scopus_import":"1","ddc":["005"],"volume":10482,"publication_status":"published","isi":1,"intvolume":"     10482","project":[{"call_identifier":"FWF","name":"Game Theory","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"}],"day":"01","page":"59 - 66","title":"JTDec: A tool for tree decompositions in soot","article_processing_charge":"No","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:49:22Z","publication_identifier":{"issn":["03029743"]},"file_date_updated":"2020-07-14T12:48:16Z","pubrep_id":"845","date_published":"2017-01-01T00:00:00Z","oa_version":"Submitted Version","conference":{"name":"ATVA: Automated Technology for Verification and Analysis","location":"Pune, India","end_date":"2017-10-06","start_date":"2017-10-03"},"abstract":[{"lang":"eng","text":"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 methods, 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."}],"ec_funded":1,"oa":1,"department":[{"_id":"KrCh"}],"publisher":"Springer","file":[{"date_created":"2018-12-12T10:10:45Z","file_size":948514,"date_updated":"2020-07-14T12:48:16Z","checksum":"a0d9f5f94dc594c4e71e78525c9942f1","creator":"system","relation":"main_file","file_name":"IST-2017-845-v1+1_2017_Chatterjee_JTDec.pdf","content_type":"application/pdf","file_id":"4835","access_level":"open_access"}],"publist_id":"6468","type":"conference"}