2009Unpublished venueRequires access

Automata-based approach for kernel trace analysis

Gabriel Matni, Michel Dagenais

Open publisher page 13 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: TRACE (psycholinguistics), Computer science, Automaton, Kernel (algebra), Spectrum analyzer, Finite-state machine, Programming language, Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Automata-based approach for kernel trace analysis — Research Paper | ScholarLens