Much work has been published on extracting various kinds of models from logs that document the execution of running systems. In many cases, however, for example in the context of evolution, testing, or malware analysis, engineers are interested not only in a single log but in a set of several logs, each of which originated from a different set of runs of the system at hand. Then, the difference between the logs is the main target of interest.
In this work we investigate the use of finite-state models for log differencing. Rather than comparing the logs directly, we generate concise models to describe and highlight their differences. Specifically, we present two algorithms based on the classic k-Tails algorithm: 2KDiff, which computes and highlights simple traces containing sequences of k events that belong to one log but not the other, and nKDiff, which extends k-Tails from one to many logs, and distinguishes the sequences of length k that are common to all logs from the ones found in only some of them, all on top of a single, rich model. Both algorithms are sound and complete modulo the abstraction defined by the use of k-Tails.
We implemented both algorithms and evaluated their performance on mutated logs that we generated based on models from the literature. We conducted a user study including 60 participants demonstrating the effectiveness of the approach in log differencing tasks. We have further performed a case study to examine the use of our approach in malware analysis. Finally, we have made our work available in a prototype web-application, for experiments.
Tue 6 Nov Times are displayed in time zone: Guadalajara, Mexico City, Monterrey change
|10:30 - 10:52|
Mehran Hassani, Weiyi ShangConcordia University, Canada, Emad ShihabConcordia University, Nikolaos TsantalisConcordia University, CanadaDOI
|10:52 - 11:15|
Lingfeng Bao Zhejiang University City College, Zhenchang XingAustralia National University, Xin XiaMonash University, David LoSingapore Management UniversityDOI
|11:15 - 11:37|
|11:37 - 12:00|