Skip to main content
Conference ProceedingsOPEN ACCESS

Alternating runtime and size complexity analysis of integer programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8413 LNCS 140-155
DOI: 10.1007/978-3-642-54862-8_10
48Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2014 Springer-Verlag.

Cite

CITATION STYLE

APA

Brockschmidt, M., Emmes, F., Falke, S., Fuhs, C., & Giesl, J. (2014). Alternating runtime and size complexity analysis of integer programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8413 LNCS, pp. 140–155). Springer Verlag. https://doi.org/10.1007/978-3-642-54862-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free