Treffer: Alternating Runtime and Size Complexity Analysis of Integer Programs.

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. [ABSTRACT FROM AUTHOR]

Copyright of Tools & Algorithms for the Construction & Analysis of Systems: 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory & Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings is the property of Springer eBooks and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)