Filters








172 Hits in 1.8 sec

The Treewidth of Java Programs [chapter]

Jens Gustedt, Ole A. Mæhle, Jan Arne Telle
2002 Lecture Notes in Computer Science  
For Java programs lacking these labelled constructs Thorup's result for C still holds, and in the second part of the paper we analyze the treewidth of label-free Java programs empirically.  ...  We report on experiments running the parser on several of the Java API packages, and the results tell us that on average the treewidth of the control-flow graph of these Java programs is no more than 2.5  ...  Treewidth of Java Application Programs Next we analyze the treewidth of ordinary Java applications. The programs were mostly found on the internet via search engines like Google (www.google.com).  ... 
doi:10.1007/3-540-45643-0_7 fatcat:pesn3cuoazdjzito4jmaqlgwyq

ToTo: An open database for computation, storage and retrieval of tree decompositions

Rim van Wersch, Steven Kelk
2017 Discrete Applied Mathematics  
Many NP-hard problems on graphs become tractable on graphs of low treewidth, but the corresponding algorithms require access to a tree decomposition of the graph of low (ideally, minimum) width.  ...  We hope that the database will become both a central repository for important graphs and benchmark datasets and extend the use of treewidth beyond the usual communities: the database and associated algorithms  ...  as Java.  ... 
doi:10.1016/j.dam.2016.09.023 fatcat:6jly4pw3kzfwpkqkboscxcjd64

Pushdown reachability with constant treewidth

Krishnendu Chatterjee, Georg Osang
2017 Information Processing Letters  
We consider the problem of reachability in pushdown graphs. We study the problem for pushdown graphs with constant treewidth.  ...  Even for pushdown graphs with treewidth 1, for the reachability problem we establish the following: (i) the problem is PTIME-complete, and (ii) any subcubic algorithm for the problem would contradict the  ...  The research was partially supported by the Austrian Science Fund (FWF): P23499-N23, S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games).  ... 
doi:10.1016/j.ipl.2017.02.003 fatcat:pmborpyf7jhdfjrok7wqiuu45a

A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions [chapter]

Thomas Bosman
2015 Lecture Notes in Computer Science  
of much larger treewidth than would be tractable to solve exactly.  ...  For a large class of sparse benchmark instances the algorithm is able to find small width tree decompositions on the union of generated solutions.  ...  Dynamic Programming A recent implementation of dynamic programming for the STP was introduced in [4] .  ... 
doi:10.1007/978-3-319-20086-6_30 fatcat:tz5a22p5zze6tp64g5wjoimcti

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
2015 Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL '15  
We thank anonymous reviewers for helpful comments to improve the presentation of the paper.  ...  The most important example is that the control flow graph for goto-free programs for many programming languages are of constant treewidth [42] , and it was also shown in [24] that typically all Java  ...  This theoretical result was subsequently followed up in several practical approaches, and it was shown in [24] that though in theory Java programs might not have constant treewidth, in practice Java  ... 
doi:10.1145/2676726.2676979 dblp:conf/popl/ChatterjeeIPG15 fatcat:zh63zfdwafdajm4touu2uhzga4

Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth [article]

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal
2014 arXiv   pre-print
The second aspect that we consider is that the control flow graphs for most programs have constant treewidth.  ...  Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc.  ...  We thank anonymous reviewers for helpful comments to improve the presentation of the paper.  ... 
arXiv:1410.7724v2 fatcat:y2xp2pmulbfknhkthoh2kbo7xe

Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions [article]

Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof
2013 arXiv   pre-print
Dynamic programming on tree decompositions is a frequently used approach to solve otherwise intractable problems on instances of small treewidth.  ...  A comparison of the classic dynamic programming algorithm and the improved dynamic programming algorithm that employs the table reduction shows that the new approach gives significant improvements on the  ...  by the treewidth of a graph.  ... 
arXiv:1305.7448v1 fatcat:grirwmdku5eajasanacjpaflii

Optimal Dyck Reachability for Data-Dependence and Alias Analysis [article]

Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis
2019 arXiv   pre-print
We also show that the same hardness holds for graphs of constant treewidth.  ...  Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites.  ...  ACKNOWLEDGMENTS The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).  ... 
arXiv:1910.00241v1 fatcat:vrfq5fpegff65ku44tbcqt6roq

Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis [chapter]

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2020 Lecture Notes in Computer Science  
We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query  ...  On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts.  ...  The low treewidth of flow graphs has also been confirmed experimentally for programs written in Java [34] , C [38] , Ada [12] and Solidity [15] .  ... 
doi:10.1007/978-3-030-44914-8_5 fatcat:a5jbi3gbordb3pxgpddbtr34ba

Optimal Dyck reachability for data-dependence and alias analysis

Krishnendu Chatterjee, Bhavya Choudhary, Andreas Pavlogiannis
2017 Proceedings of the ACM on Programming Languages  
We also show that the same hardness holds for graphs of constant treewidth. Finally, we provide a prototype implementation of our algorithms for both alias analysis and data-dependence analysis.  ...  Our algorithm preprocesses libraries in almost linear time, after which the contribution of the library in the complexity of the client analysis is only linear, and only wrt the number of call sites.  ...  ACKNOWLEDGMENTS The research was partly supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Start grant (279307: Graph Games).  ... 
doi:10.1145/3158118 dblp:journals/pacmpl/ChatterjeeCP18 fatcat:kwhhai2bdjhffly72uskiburwu

Faster Algorithms for Quantitative Analysis of Markov Chains and Markov Decision Processes with Small Treewidth [article]

Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis
2020 arXiv   pre-print
Finally, we make an experimental evaluation of our new algorithms on low-treewidth MCs and MDPs obtained from the DaCapo benchmark suite.  ...  Our results also imply a bound of O(κ· (n+m)· t^2) for each objective on MDPs, where κ is the number of strategy-iteration refinements required for the given input and objective.  ...  The low treewidth of flow graphs has also been confirmed experimentally for programs written in Java [48] , C [62] , Ada [19] and Solidity [21] .  ... 
arXiv:2004.08828v1 fatcat:6chxbu5odfchbfuxizn2nfw2re

A heuristic use of dynamic programming to upperbound treewidth [article]

Hisao Tamaki
2019 arXiv   pre-print
Bouchitté and Todinca observed in 2001 that (G, Π(G)) is exactly the treewidth of G and developed a dynamic programming algorithm to compute it.  ...  For a graph G, let Π(G) denote the set of all potential maximal cliques of G.  ...  Acknowledgments This work was done while the author was on leave at Utrecht University. He thanks the Department of Information and Computing Sciences and Hans Bodlaender for hospitality.  ... 
arXiv:1909.07647v2 fatcat:r7nj7vtzljemfnecsehvw6q3ya

Heuristic computation of exact treewidth [article]

Hisao Tamaki
2022 arXiv   pre-print
The upper bound algorithm extends and simplifies Tamaki's unpublished work on a heuristic use of the dynamic programming algorithm for deciding treewidth due to Bouchitté and Todinca.  ...  We are interested in computing the treewidth (G) of a given graph G.  ...  Acknowledgment I thank Holger Dell for posing the challenging bonus instances, which have kept defying my "great ideas", showing how they fail, and pointing to yet greater ideas.  ... 
arXiv:2202.07793v1 fatcat:ekbalmhpzbbyvdgslfn3x26goq

Benchmarking treewidth as a practical component of tensor-network--based quantum simulation [article]

Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan, Andrew L. Wright
2018 PLoS ONE   pre-print
We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density  ...  While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from  ...  DE-AC05-00OR22725 with the U.S. Department of Energy.  ... 
doi:10.1371/journal.pone.0207827 pmid:30562341 pmcid:PMC6298732 arXiv:1807.04599v1 fatcat:iyr23dlkjbehdmr4lhdeltz5qu

Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis [article]

Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis
2020 arXiv   pre-print
We exploit the fact that flow graphs of programs have low treewidth to develop faster algorithms that are space and time optimal for many common data-flow analyses, in both the preprocessing and the query  ...  On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts.  ...  The low treewidth of flow graphs has also been confirmed experimentally for programs written in Java [33] , C [37] , Ada [12] and Solidity [15] .  ... 
arXiv:2001.11070v2 fatcat:7l5at2mhtbc6xc2raj62pyoky4
« Previous Showing results 1 — 15 out of 172 results