Analyzing runtime and size complexity of integer programs
- Submitting institution
-
Birkbeck College
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 159
- Type
- D - Journal article
- DOI
-
10.1145/2866575
- Title of journal
- ACM Transactions on Programming Languages and Systems
- Article number
- -
- First page
- 1
- Volume
- 38
- Issue
- 4
- ISSN
- 0164-0925
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2016
- URL
-
http://eprints.bbk.ac.uk/id/eprint/16257/
- 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)
-
1 - Algorithms, Verification and Software
- Citation count
- 21
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper provides the basis of further publications for complexity analysis for Java programs (iFM'17, <https://doi.org/10.1007/978-3-319-66845-1_6>), term rewrite systems (FroCoS'17, <https://doi.org/10.1007/978-3-319-66167-4_8>), and programs on bitvectors (JLAMP'18, <https://doi.org/10.1016/j.jlamp.2018.02.004>). The earlier conference version of this paper (TACAS 2014) has 70+ additional citations on Google Scholar. The work resulted in an invitation to Fuhs to lecture on automated complexity analysis in the Advanced Track of the 12th International School on Rewriting, 2020.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -