Automata-based approach for kernel trace analysis
Gabriel Matni, Michel Dagenais
Abstract
Gabriel Matni, Michel Dagenais
Abstract
This paper presents an automata-based approach for analyzing traces generated by the kernel of an operating system. We identified a list of typical patterns of problematic behavior, to look for in a trace, and selected an appropriate state machine language to describe them. These patterns were then fed into an off-line analyzer which efficiently and simultaneously checks for their occurrences even in traces of several gigabytes. The checker achieves a linear performance with respect to the trace size. The remaining factors impacting its performance are discussed.
OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper presents an automata-based approach for analyzing traces generated by the kernel of an operating system. We identified a list of typical patterns of problematic behavior, to look for in a trace, and selected an appropriate state machine language to describe them. These patterns were then fed into an off-line analyzer which efficiently and simultaneously checks for their occurrences even in traces of several gigabytes. The checker achieves a linear performance with respect to the trace size. The remaining factors impacting its performance are discussed.
Key concepts: TRACE (psycholinguistics), Computer science, Automaton, Kernel (algebra), Spectrum analyzer, Finite-state machine, Programming language, Theoretical computer science