%% *** Introduce problem

%% **** Container types common in programs

A common requirement when programming is the need to keep a collection of data together, for example in a list.
Often, programmers will have some requirements they want to impose on this collection, such as not storing duplicate elements, or storing the items in sorted order.

%% **** Functionally identical implementations
However, implementing these collection types manually is usually a waste of time, as is fine-tuning their implementation to perform better.
Most programmers will simply use one or two collection types provided by their language.

%% **** Large difference in performance
Often, this is not the best choice.
The underlying implementation of container types which function the same can have a drastic effect on performance (\cite{l_liu_perflint_2009}, \cite{jung_brainy_2011}).

%% *** Motivate w/ effectiveness claims
We propose a system, Candelabra, for the automatic selection of container implementations, based on both user-specified requirements and inferred requirements for performance.
From our testing, we are able to select the best performing containers for a program, in significantly less time than brute force.

%% *** Overview of aims & approach
%% **** Ease of adding new container types
We have designed our system with flexibility in mind --- adding new container implementations requires little effort.
%% **** Ease of integration into existing projects
It is easy to adopt our system incrementally, and we integrate with existing tools to making doing so easy.
%% **** Scalability to larger projects
The time it takes to select containers scales roughly linearly, even in complex cases, allowing our tool to be used even on larger projects.

%% **** Flexibility of selection
Our system is also able to suggest adaptive containers --- containers which switch underlying implementation as they grow.

%% *** Overview of results
\todo{Overview of results}