The store language of an automaton is a language-theoretic encoding of the contents of every data store that can appear at any point in an accepting computation. While this is an older concept, it is not a particularly well-studied one. In this talk, previous results regarding store languages from the literature are reviewed, and the store languages of many existing types of automata from the literature are described. Several applications of store languages are then presented, including towards verification, to help with decision problems, and with closure properties.