A Time Series Analysis of Assertions in the Linux Kernel

• URL: http://arxiv.org/abs/2412.19465v2
• Date: Tue, 16 Sep 2025 02:18:22 GMT
• Title: A Time Series Analysis of Assertions in the Linux Kernel
• Abstract summary: The paper empirically examines the longitudinal evolution of assertion use in the Linux kernel.<n>The use of assertions that cause a kernel panic has slightly but not substantially decreased from the kernel's third to the sixth release series.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Assertions are a classical and typical software development technique. These are extensively used also in operating systems and their kernels, including the Linux kernel. The paper fills a gap in existing knowledge by empirically examining the longitudinal evolution of assertion use in the Linux kernel. According to the results, the use of assertions that cause a kernel panic has slightly but not substantially decreased from the kernel's third to the sixth release series. At the same time, the use of softer assertion variants has increased; these do not cause a panic by default but instead produce warnings. With these time series results, the paper contributes to the existing but limited empirical knowledge base about operating system kernels and their long-term evolution.

Related papers

• Correct but Slow: An Empirical Study of the GPU Kernel Evaluation Gap in Modern Domain-Specific Languages [9.908756853186018]
  A functionally valid kernel may still fall far below the throughput of the optimized library operator it is intended to replace.<n>We study this correctness-performance gap using 22 Triton and TileLang kernels from five operator categories on NVIDIA A100 and GH200 GPUs.
  arXiv  Detail & Related papers  (2026-07-05T18:33:12Z)
• Kernel Foundry: A Diagnosis-driven Evolutionary Kernel Optimizer with Multi-Experts [29.878782850560132]
  Kernel Foundry is a diagnosis-driven evolutionary framework for automatic GPU kernel optimization.<n> Experiments on KernelBench show that our method consistently improves both correctness and performance over strong baselines.
  arXiv  Detail & Related papers  (2026-05-08T03:41:54Z)
• Outrunning LLM Cutoffs: A Live Kernel Crash Resolution Benchmark for All [57.23434868678603]
  Live-kBench is an evaluation framework for self-evolving benchmarks that scrapes and evaluates agents on freshly discovered kernel bugs.<n> kEnv is an agent-agnostic crash-resolution environment for kernel compilation, execution, and feedback.<n>Using kEnv, we benchmark three state-of-the-art agents, showing that they resolve 74% of crashes on the first attempt.
  arXiv  Detail & Related papers  (2026-02-02T19:06:15Z)
• Linux Kernel Recency Matters, CVE Severity Doesn't, and History Fades [2.204918347869259]
  In 2024, the Linux kernel became its own Common Vulnerabilities and Exposures and Numbering Authority (CNA)<n>We analyze the anatomy and dynamics of kernel CVEs using metadata, associated commits, and patch latency to understand what drives patching.
  arXiv  Detail & Related papers  (2026-01-29T12:45:35Z)
• CrashFixer: A crash resolution agent for the Linux kernel [58.152358195983155]
  This work builds upon kGym, which shares a benchmark for system-level Linux kernel bugs and a platform to run experiments on the Linux kernel. This paper introduces CrashFixer, the first LLM-based software repair agent that is applicable to Linux kernel bugs.
  arXiv  Detail & Related papers  (2025-04-29T04:18:51Z)
• A Dictionary of Closed-Form Kernel Mean Embeddings [48.67713382782237]
  We provide a comprehensive dictionary of known kernel mean embeddings, along with practical tools for deriving new embeddings from known ones. We also provide a Python library that includes minimal implementations of the embeddings.
  arXiv  Detail & Related papers  (2025-04-26T07:33:30Z)
• Spectral Truncation Kernels: Noncommutativity in $C^*$-algebraic Kernel Machines [12.11705128358537]
  We propose a new class of positive definite kernels based on the spectral truncation. We show that the proposed kernels fill the gap between existing separable and commutative kernels. The flexibility of the proposed class of kernels allows us to go beyond previous separable and commutative kernels.
  arXiv  Detail & Related papers  (2024-05-28T04:47:12Z)
• KernelGPT: Enhanced Kernel Fuzzing via Large Language Models [8.77369393651381]
  We propose KernelGPT, the first approach to automatically synthesizing syscall specifications via Large Language Models (LLMs) Our results demonstrate that KernelGPT can generate more new and valid specifications and achieve higher coverage than state-of-the-art techniques.
  arXiv  Detail & Related papers  (2023-12-31T18:47:33Z)
• Geometric Learning with Positively Decomposable Kernels [6.5497574505866885]
  We propose the use of reproducing kernel Krein space (RKKS) based methods, which require only kernels that admit a positive decomposition. We show that one does not need to access this decomposition in order to learn in RKKS.
  arXiv  Detail & Related papers  (2023-10-20T21:18:04Z)
• Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited [4.30226515682283]
  We study walk-based node refinement methods and formally relate them to several widely-used techniques. We show that classical random walk kernels with only minor modifications regarding definition and computation are as expressive as the widely-used Weisfeiler-Leman subtree kernel. We verify experimentally that walk-based kernels reach or even surpass the accuracy of Weisfeiler-Leman kernels in real-world classification tasks.
  arXiv  Detail & Related papers  (2022-05-22T19:41:25Z)
• Meta-Learning Hypothesis Spaces for Sequential Decision-making [79.73213540203389]
  We propose to meta-learn a kernel from offline data (Meta-KeL) Under mild conditions, we guarantee that our estimated RKHS yields valid confidence sets. We also empirically evaluate the effectiveness of our approach on a Bayesian optimization task.
  arXiv  Detail & Related papers  (2022-02-01T17:46:51Z)
• Fast Sketching of Polynomial Kernels of Polynomial Degree [61.83993156683605]
  kernel is especially important as other kernels can often be approximated by the kernel via a Taylor series expansion. Recent techniques in sketching reduce the dependence in the running time on the degree oblivious $q$ of the kernel. We give a new sketch which greatly improves upon this running time, by removing the dependence on $q$ in the leading order term.
  arXiv  Detail & Related papers  (2021-08-21T02:14:55Z)
• Kernel Continual Learning [117.79080100313722]
  kernel continual learning is a simple but effective variant of continual learning to tackle catastrophic forgetting. episodic memory unit stores a subset of samples for each task to learn task-specific classifiers based on kernel ridge regression. variational random features to learn a data-driven kernel for each task.
  arXiv  Detail & Related papers  (2021-07-12T22:09:30Z)
• Kernel Identification Through Transformers [54.3795894579111]
  Kernel selection plays a central role in determining the performance of Gaussian Process (GP) models. This work addresses the challenge of constructing custom kernel functions for high-dimensional GP regression models. We introduce a novel approach named KITT: Kernel Identification Through Transformers.
  arXiv  Detail & Related papers  (2021-06-15T14:32:38Z)
• Isolation Distributional Kernel: A New Tool for Point & Group Anomaly Detection [76.1522587605852]
  Isolation Distributional Kernel (IDK) is a new way to measure the similarity between two distributions. We demonstrate IDK's efficacy and efficiency as a new tool for kernel based anomaly detection for both point and group anomalies.
  arXiv  Detail & Related papers  (2020-09-24T12:25:43Z)
• Multiple Video Frame Interpolation via Enhanced Deformable Separable Convolution [67.83074893311218]
  Kernel-based methods predict pixels with a single convolution process that convolves source frames with spatially adaptive local kernels. We propose enhanced deformable separable convolution (EDSC) to estimate not only adaptive kernels, but also offsets, masks and biases. We show that our method performs favorably against the state-of-the-art methods across a broad range of datasets.
  arXiv  Detail & Related papers  (2020-06-15T01:10:59Z)
• Kernels for time series with irregularly-spaced multivariate observations [0.0]
  We show that a "series kernel" that is general enough to represent irregularly-spaced time series may be built out of well-known "vector kernels" We demonstrate that our series kernel may be used for the more traditional setting of time series classification, where its performance is broadly in line with alternative methods.
  arXiv  Detail & Related papers  (2020-04-18T07:51:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.