|Title||Mining Specifications using Nested Words|
|Publication Type||Conference Paper|
|Year of Publication||2017|
|Authors||Narayan, A., N. Benann, and S. Fischmeister|
|Conference Name||Proceedings of the 6th International Workshop on Software Mining|
|Conference Location||Urbana-Champaign, USA|
Parameter mining of traces identifies formal properties that describe a program’s dynamic behaviour. These properties are useful for developers to understand programs, to identify defects, and, in general, to reason about them. The dynamic behavior of programs typically follows a distinct pattern of calls and returns. Prior work uses general logic to identify properties from a given set of templates. Consequently, either the properties are inadequate since the logic is not expressive enough, or the approach fails to scale due to the generality of the logic. This paper uses nested words and nested word automata that are especially well suited for describing the dynamic behaviour of a program. Specifically, these nested words can describe pre/post conditions and inter-procedural data-flow and have constant memory requirements.