Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 15776
- Type
- D - Journal article
- DOI
-
10.1145/3363525
- Title of journal
- ACM Transactions on Programming Languages and Systems
- Article number
- 23
- First page
- 1
- Volume
- 41
- Issue
- 4
- ISSN
- 0164-0925
- Open access status
- Not compliant
- Month of publication
- November
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This is the combined journal version of two conference papers: "Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth" (POPL'15) and "Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs" (ESA'16). The results have been leveraged in the JTDec tool for the analysis of Java programmes ("JTDec: A Tool for Tree Decompositions in Soot", ATVA'17), and extended to Markov Decision Processes ("Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth", AVTA'20).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
