一句话：研究 Linux 内核中 C 泛型双向链表的利弊，并提出列表类型推断与可视化工具，可辅助理解并发现缺陷。
Linux 内核长期依赖大量维护者协作，理解复杂数据结构是维护中的关键难题。内核用 C 编写，可通过类型转换和指针运算定义信息量极低的数据类型，双向链表尤其典型。本文分析这种泛型链表在表达力、代码理解与可靠性方面的优缺点，并基于观察开发了一套工具集，包括描述性列表类型推断和列表可视化工具。工具在近期 Linux 内核版本中识别出超过 10,000 个列表字段和变量，并成功为其中 90% 推断类型。作者进一步展示这些工具可用于发现此前已修复的缺陷，并新识别出 6 个缺陷。
The increasing adoption of the Linux kernel has been sustained by a large and constant maintenance effort, performed by a wide and heterogeneous base of contributors. One important problem that maintainers face in any code base is the rapid understanding of complex data structures. The Linux kernel is written in the C language, which enables the definition of arbitrarily uninformative datatypes, via the use of casts and pointer arithmetic, of which doubly linked lists are a prominent example. In this paper, we explore the advantages and disadvantages of such lists, for expressivity, for code understanding, and for code reliability. Based on our observations, we have developed a toolset that includes inference of descriptive list types and a tool for list visualization. Our tools identify more than 10,000 list fields and variables in recent Linux kernel releases and succeeds in typing 90%. We show how these tools could have been used to detect previously fixed bugs and identify 6 new ones.