{"related_material":{"record":[{"relation":"later_version","id":"1437","status":"public"},{"id":"5441","status":"public","relation":"later_version"},{"relation":"later_version","id":"6009","status":"public"}]},"title":"Algorithms for algebraic path properties in concurrent systems of constant treewidth components","alternative_title":["IST Austria Technical Report"],"scopus_import":1,"author":[{"first_name":"1","full_name":"Anonymous, 1","last_name":"Anonymous"},{"last_name":"Anonymous","full_name":"Anonymous, 2","first_name":"2"},{"last_name":"Anonymous","full_name":"Anonymous, 3","first_name":"3"},{"last_name":"Anonymous","first_name":"4","full_name":"Anonymous, 4"}],"_id":"5442","abstract":[{"text":"We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural properties that arise in program analysis.\r\nWe consider that each component of the concurrent system is a graph with constant treewidth, and it is known that the controlflow graphs of most programs have constant treewidth. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis problems (e.g., alias analysis). The study of multiple queries allows us to consider the tradeoff between the resource usage of the \\emph{one-time} preprocessing and for \\emph{each individual} query. The traditional approaches construct the product graph of all components and apply the best-known graph algorithm on the product. In the traditional approach, even the answer to a single query requires the transitive closure computation (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time.\r\n\r\nOur main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, \r\neach subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results that show that the worst-case running times of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (such as improving \r\nthe worst-case bounds for the shortest path problem in general graphs whose current best-known bound has not been improved in five decades). Finally, we provide a prototype implementation of our algorithms which significantly outperforms the existing algorithmic methods on several benchmarks.","lang":"eng"}],"oa_version":"Published Version","publication_status":"published","type":"technical_report","has_accepted_license":"1","date_updated":"2023-09-19T14:36:19Z","language":[{"iso":"eng"}],"pubrep_id":"344","publication_identifier":{"issn":["2664-1690"]},"file":[{"content_type":"application/pdf","file_size":658747,"access_level":"open_access","relation":"main_file","file_name":"IST-2015-343-v2+1_main.pdf","date_created":"2018-12-12T11:53:37Z","checksum":"98fd936102f3e057fc321ef6d316001d","file_id":"5498","creator":"system","date_updated":"2020-07-14T12:46:57Z"},{"checksum":"b31d09b1241b59c75e1f42dadf09d258","date_created":"2019-04-16T12:36:08Z","file_name":"IST-2015-343-v2+2_anonymous.txt","relation":"main_file","access_level":"closed","date_updated":"2020-07-14T12:46:57Z","file_id":"6316","creator":"dernst","content_type":"text/plain","file_size":139}],"day":"14","page":"22","publisher":"IST Austria","status":"public","year":"2015","file_date_updated":"2020-07-14T12:46:57Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2015-07-14T00:00:00Z","ddc":["000"],"date_created":"2018-12-12T11:39:21Z","month":"07","citation":{"ieee":"1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria, 2015.","short":"1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components, IST Austria, 2015.","mla":"Anonymous, 1, et al. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015.","ama":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria; 2015.","apa":"Anonymous, 1, Anonymous, 2, Anonymous, 3, &#38; Anonymous, 4. (2015). <i>Algorithms for algebraic path properties in concurrent systems of constant treewidth components</i>. IST Austria.","ista":"Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2015. Algorithms for algebraic path properties in concurrent systems of constant treewidth components, IST Austria, 22p.","chicago":"Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. <i>Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components</i>. IST Austria, 2015."}}