Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12143
- Type
- D - Journal article
- DOI
-
10.1145/3210257
- Title of journal
- ACM Transactions on Programming Languages and Systems
- Article number
- 9
- First page
- 1
- Volume
- 40
- Issue
- 3
- ISSN
- 0164-0925
- Open access status
- Technical exception
- Month of publication
- July
- Year of publication
- 2018
- 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
-
3
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper with the same title appeared at POPL'16. The paper lowers the complexity of program analysis for concurrent systems with constant treewidth control flow graphs from O(n^6) to O(n^4), which is close to optimal. The JTDec tool allows these advances to be utilised in the context of Java programmes ("JTDec: A Tool for Tree Decompositions in Soot", ATVA'17).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -