Brockschmidt, M. and Emmes, F. and Falke, S. and Fuhs, Carsten and Giesl, J. (2014) Alternating runtime and size complexity analysis of integer programs. In: Ábrahám, E. and Havelund, K. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science 8413. Berlin, Germany: Springer, pp. 140-155. ISBN 9783642548611.
|
Text
16256.pdf - Author's Accepted Manuscript Download (453kB) | Preview |
Abstract
We present a modular approach to automatic complexity analysis. Based on a novel alternation between finding symbolic time bounds for program parts and using these to infer size bounds on program variables, we can restrict each analysis step to a small part of the program while maintaining a high level of precision. Extensive experiments with the implementation of our method demonstrate its performance and power in comparison with other tools.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings - Series ISSN: 0302-9743 - The final publication is available at Springer via the link above. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Carsten Fuhs |
| Date Deposited: | 05 Oct 2016 16:27 |
| Last Modified: | 15 Apr 2025 03:39 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/16256 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
