Using dynamic execution traces and program invariants to enhance behavioral model inference

Software behavioral models have proven useful for design, validation, verification, and maintenance. However, existing approaches for deriving such models sometimes overgeneralize what behavior is legal. We outline a novel approach that utilizes inferred likely program invariants and method invocation sequences to obtain an object-level model that describes legal execution sequences. The key insight is using program invariants to identify similar states in the sequences. We exemplify how our approach improves upon certain aspects of the state-of-the-art FSA-inference techniques. Categories and Subject Descriptors D.2 [Software Engineering]: Testing and Debugging General Terms Algorithms, Verification Keywords dynamic analysis, likely invariants, specification mining

• Type: Conference
• Year: 2010
• Where: ICSE
• Authors: Ivo Krka, Yuriy Brun, Daniel Popescu, Joshua Garcia, Nenad Medvidovic
• Keywords: ICSE 2010, Likely Program Invariants, Method Invocation Sequences, Program Invariants, Software Engineering