第9回 SATSS（セキュアシステムのためのソフトウェア、アーキテクチャ、理論に関するワークショップ）参加募集

[Taro Sekiyama]

皆様 (複数お受け取りの場合はご容赦ください)

国立情報学研究所の関山です。

8月21日(木)に開催される「第9回セキュアシステムのためのソフトウェア、アーキテクチャ、理論に関するワークショップ 」(SATSS) の参加募集のご案内です。
今回は Gustavo A. R. Silva 氏 (The Linux Foundation)、Keita Suzuki 氏 (Keio University) の二名をお迎えし、セキュアなシステムソフトウェアを実現するための取り組みについて講演いただく予定です。

ワークショップサイト：https://sc-sys.github.io/
日時：8月21日 15:00～17:00 (開場 14:30)
会場：一橋講堂 特別会議室101-103 (アクセス：https://www.hit-u.ac.jp/hall/accessjp.html)
リモート参加：SATSS の slack workspace にて参加方法をご連絡いたします。Slack には以下の URL よりご参加ください。

  https://join.slack.com/t/satss/shared_invite/zt-39t7ge2af-gusWS~jXcL3FlHOkSNNG7A

講演1

--
講演者：Gustavo A. R. Silva (The Linux Foundation)
タイトル：Enhancing spatial safety: Better array-bounds checking in C (and Linux)
概要：
The C language has historically suffered from a lack of proper bounds-checking on all kinds of arrays. The Linux Kernel Self-Protection Project has been addressing this issue for several years. In this presentation, we will learn about the most recent hardening efforts to resolve the problem of bounds-checking, particularly for fixed-size and flexible arrays. We will explore the different mechanisms being used to harden key APIs like memcpy() against buffer overflows, which includes the use of some interesting built-in compiler functions. We will also talk about a couple of recent compiler options like -fstrict-flex-arrays and -Wflex-array-member-not-at-end, as well as the new counted_by attribute released in Clang 18 and GCC 15, which helps us gain run-time bounds-checking coverage on flexible arrays. Overall, we will discuss how various challenges have been overcome, and highlight the innovations developed to solve the problem of array bounds-checking in both C and the Linux kernel once and for all.

講演2

--

講演者：Keita Suzuki (Keio University)
タイトル：Balancing Analysis Time and Bug Detection: Daily Development-friendly Bug Detection in Linux
概要：
Linux, a battle-tested codebase, is known to suffer from many bugs despite its extensive testing mechanisms. While many of these bugs require domain-specific knowledge for detection, a significant portion matches well-known bug patterns. Even though these bugs can be found with existing tools, our simple check of Linux kernel patches suggests that these tools are not used much in the developer's daily workflow. The lack of usage is probably due to the well-known trade-off between analysis time and bug detection capabilities: tools typically employ complex analysis to effectively and comprehensively find bugs in return for a long analysis time, or focus on a short analysis time by only employing elementary analyses and thus can only find a very limited number of bugs. Ideally, developers expect the tools to incur short analysis time, while still finding many bugs to use them in daily development. This paper explores an approach that balances this trade-off by focusing on bugs that can be found with less computationally-complex analysis methods, and limiting the scope to each source code. To achieve this, we propose a combination of computationally lightweight analyses and demonstrate our claim by designing FiTx, a framework for generating daily development-friendly bug checkers that focus on well-known patterns. Despite its simplicity, FiTx successfully identified 47 new bugs in the Linux kernel version 5.15 within 2.5 hours, outperforming Clang Static Analyzer and CppCheck in both speed and bug detection. It demonstrates that focusing on less complex bug patterns can still significantly contribute to the improvement of codebase health. FiTx can be embedded into the daily development routine, enabling early bug detection without sacrificing developers' time.

ワークショップについて：
本ワークショップ「セキュアシステムのためのソフトウェア、アーキテクチャ、理論に関するワークショップ (SATSS)」は、新しい（特にセキュアな）
計算機システムに関する原理を理論研究と共に計算機ハードウェアからソフトウェアのレイヤまで研究・開発するために必要な知識の獲得と議論の場を
提供することを目的として開催しています。また議論を大事にするという観点から、現地参加を推奨しています。

それでは皆様のご参加をお待ち申し上げます。
またお知り合いの方でご興味のある方がいらっしゃいましたらお声がけいただけますと幸いです。

--
関山 太朗
国立情報学研究所
seki...@nii.ac.jp