Towards an automatic complexity analysis for generic programs

Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performance guarantees. It is left as a nontrivial task to the library user to choose appropriate algorithms and data types for a particular problem. In the present paper, we describe an automatic analysis to aid library users in selecting types for use in generic programs. The analysis is based on manipulation and comparison of symbolic complexity ons, constructed using cost-bound functions and abstract interpretation of program behaviour. Our analysis serves to detect and rectify "performance bugs" by recommending type selections that will improve performance. Categories and Subject Descriptors D.3.3 [Programming LanLanguages Constructs and Features--Abstract data types; D.3.3 [Programming Languages]: Language Constructs and Features--Polymorphim; F.2.2 [Analysis of Algorithms and Problem Complexity]: Non...

• Type: Conference
• Year: 2006
• Where: ICFP
• Authors: Kyle D. Ross
• Keywords: Data Types, ICFP 2006, Keywords Generic Programming, Programming Languages, Symbolic Complexity Ons