Compiler Testing with Relaxed Memory Models

被引:0
|
作者
Geeson, Luke [1 ]
Smith, Lee [2 ]
机构
[1] UCL, London, England
[2] Arm Ltd, Cambridge, England
基金
英国工程与自然科学研究理事会;
关键词
D.1.3 Concurrent Programming; B.1.2.b Formal models; B.1.4.b Languages and compilers; D.2.5.r Testing tools; OPTIMIZATIONS; CONSISTENCY; C-11;
D O I
10.1109/CGO57630.2024.10444836
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Finding bugs is key to the correctness of compilers in wide use today. If the behaviour of a compiled program, as allowed by its architecture memory model, is not a behaviour of the source program under its source model, then there is a bug. This holds for all programs, but we focus on concurrency bugs that occur only with two or more threads of execution. We focus on testing techniques that detect such bugs in C/C++ compilers. We seek a testing technique that automatically covers concurrency bugs up to fixed bounds on program sizes and that scales to find bugs in compiled programs with many lines of code. Otherwise, a testing technique can miss bugs. Unfortunately, the state-of-the-art techniques are yet to satisfy all of these properties. We present the Telechat compiler testing tool for concurrent programs. Telechat compiles a concurrent C/C++ program and compares source and compiled program behaviours using source and architecture memory models. We make three claims: Tel echat improves the state-of-the-art at finding bugs in code generation for multi-threaded execution, it is the first public description of a compiler testing tool for concurrency that is deployed in industry, and it is the first tool that takes a significant step towards the desired properties. We provide experimental evidence suggesting Telechat finds bugs missed by other state-of-the-art techniques, case studies indicating that Telechat satisfies the properties, and reports of our experience deploying Telechat in industry regression testing.
引用
收藏
页码:334 / 348
页数:15
相关论文
共 50 条
  • [41] HRF-Relaxed: Adapting HRF to the Complexities of Industrial Heterogeneous Memory Models
    Gaster, Benedict R.
    Hower, Derek
    Howes, Lee
    ACM TRANSACTIONS ON ARCHITECTURE AND CODE OPTIMIZATION, 2015, 12 (01)
  • [42] An Automata-Based Symbolic Approach for Verifying Programs on Relaxed Memory Models
    Linden, Alexander
    Wolper, Pierre
    MODEL CHECKING SOFTWARE, 2010, 6349 : 212 - 226
  • [43] Maximally Stateless Model Checking for Concurrent Bugs under Relaxed Memory Models
    Huang, Alan
    2016 IEEE/ACM 38TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING COMPANION (ICSE-C), 2016, : 686 - 688
  • [44] Reducing State Explosion for Software Model Checking with Relaxed Memory Consistency Models
    Abe, Tatsuya
    Ugawa, Tomoharu
    Maeda, Toshiyuki
    Matsumoto, Kousuke
    DEPENDABLE SOFTWARE ENGINEERING: THEORIES, TOOLS, AND APPLICATIONS, 2016, 9984 : 118 - 135
  • [45] Learning to Accelerate Compiler Testing
    Chen, Junjie
    PROCEEDINGS 2018 IEEE/ACM 40TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING - COMPANION (ICSE-COMPANION, 2018, : 472 - 475
  • [46] Observation-Based Concurrent Program Logic for Relaxed Memory Consistency Models
    Abe, Tatsuya
    Maeda, Toshiyuki
    PROGRAMMING LANGUAGES AND SYSTEMS, APLAS 2016, 2016, 10017 : 63 - 84
  • [47] AN AUTOMATIC GENERATOR FOR COMPILER TESTING
    BAZZICHI, F
    SPADAFORA, I
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1982, 8 (04) : 343 - 353
  • [48] Survey of compiler testing methods
    Kossatchev A.S.
    Posypkin M.A.
    Programming and Computer Software, 2005, 31 (1) : 10 - 19
  • [49] Survey of compiler testing methods
    Kossatchev, AS
    Posypkin, MA
    PROGRAMMING AND COMPUTER SOFTWARE, 2005, 31 (01) : 10 - 19
  • [50] Survey of compiler testing methods
    A. S. Kossatchev
    M. A. Posypkin
    Programming and Computer Software, 2005, 31 : 10 - 19