Efficiently Adapting Stateless Model Checking for C11/C++11 to Mixed-Size Accesses
Stateless model checking (SMC) is crucial for productivity in concurrent programming, and its recent developments for C/C++ and weak memory models are remarkable. The state-of-the-art SMC for C, GenMC, efficiently verifies C programs based on C11 atomics and Pthreads. However, it does not support mixed-size access, which is access to the same memory region with different-sized types and ubiquitous, particularly in memory management. As a result, GenMC does not work for C/C++ programs containing memory management. To resolve this problem, we develop a method of adapting GenMC to mixed-size accesses preserving its optimality. We experimentally evaluate the efficiency of our extended implementation of GenMC and its efficacy for memory management programs.
Thu 24 OctDisplayed time zone: Osaka, Sapporo, Tokyo change
16:00 - 17:00 | |||
16:00 30mTalk | Efficiently Adapting Stateless Model Checking for C11/C++11 to Mixed-Size Accesses Research Papers Shigeyuki Sato The University of Electro-Communications, Taiyo Mizuhashi The University of Tokyo, Genki Kimura The University of Tokyo, Kenjiro Taura The University of Tokyo | ||
16:30 30mTalk | OBRA: Oracle-based, relational, algorithmic type verification Research Papers Lisa Vasilenko IMDEA Software Institute and HSE University, Gilles Barthe MPI-SP; IMDEA Software Institute, Niki Vazou IMDEA Software Institute |