Mining Quantified Temporal Rules: Formalism, Algorithms, and Evaluation

Free registration required

Executive Summary

Libraries usually impose constraints on how clients should use them. Often these constraints are not well-documented. In this paper, the authors address the problem of recovering such constraints automatically, a problem referred to as specification mining. Given some client programs that use a given library, they identify constraints on the library usage that are (almost) satisfied by the given set of clients. The class of rules they target for mining combines simple binary temporal operators with state predicates (involving equality constraints) and quantification. This is a simple yet expressive subclass of temporal properties that allows one to capture many common API usage rules.

  • Format: PDF
  • Size: 402.2 KB