FuzzNT : Checking for Program Non-termination

被引:2
|
作者
Karmarkar, Hrishikesh [1 ]
Medicherla, Raveendra Kumar [1 ]
Metta, Ravindra [1 ]
Yeduru, Prasanth [1 ]
机构
[1] TCS Res, Chennai, Tamil Nadu, India
关键词
non termination; abstract interpretation; fuzzing; verification; testing; software maintenance; C PROGRAMS;
D O I
10.1109/ICSME55016.2022.00049
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Unintended non-termination of programs could lead to attacks such as Denial-of-Service(DoS). Current testing techniques are not geared to detect such errors. Towards this, we present FuzzNT, a hybrid testing technique to check non-termination of C programs by combining Coverage Guided Fuzzing (CGF) and abstract interpretation based static analysis. Given a program P and the coverage test inputs generated using CGF, P is transformed into a set of specialized programs, each of which under-approximates P. Abstract interpretation is then used to check each of these smaller programs for non-termination. The key advantage of this approach for checking non-termination is that it reuses the test case corpus created during software development and maintenance. Our preliminary experimental evaluation of FuzzNT shows highly promising results.
引用
收藏
页码:409 / 413
页数:5
相关论文
共 50 条
  • [31] A calculus for modular loop acceleration and non-termination proofs
    Frohn, Florian
    Fuhs, Carsten
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2022, 24 (05) : 691 - 715
  • [32] A New Approach to Non-termination Analysis of Logic Programs
    Voets, Dean
    De Schreye, Danny
    LOGIC PROGRAMMING, 2009, 5649 : 220 - 234
  • [33] A calculus for modular loop acceleration and non-termination proofs
    Florian Frohn
    Carsten Fuhs
    International Journal on Software Tools for Technology Transfer, 2022, 24 : 691 - 715
  • [34] Proving Non-termination Using Max-SMT
    Larraz, Daniel
    Nimkar, Kaustubh
    Oliveras, Albert
    Rodriguez-Carbonell, Enric
    Rubio, Albert
    COMPUTER AIDED VERIFICATION, CAV 2014, 2014, 8559 : 779 - 796
  • [35] On the non-termination of MDG-based abstract state enumeration
    Mohamed, OA
    Song, XY
    Cerny, E
    THEORETICAL COMPUTER SCIENCE, 2003, 300 (1-3) : 161 - 179
  • [36] A SIMPLE NON-TERMINATION TEST FOR THE KNUTH-BENDIX METHOD
    PLAISTED, DA
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 79 - 88
  • [37] Non-termination of sickness behavior as precipitating factor for mental disorders
    Viljoen, M
    Panzer, A
    MEDICAL HYPOTHESES, 2005, 65 (02) : 316 - 329
  • [38] 2LS: Memory Safety and Non-termination (Competition Contribution)
    Malik, Viktor
    Marticek, Stefan
    Schrammel, Peter
    Srivas, Mandayam
    Vojnar, Tomas
    Wahlang, Johanan
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2018, PT II, 2018, 10806 : 417 - 421
  • [39] Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
    Frohn, Florian
    Giesl, Juergen
    AUTOMATED REASONING, IJCAR 2022, 2022, 13385 : 712 - 722
  • [40] Detecting non-termination of term rewriting systems using an unfolding operator
    Payet, Etienne
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2007, 4407 : 194 - 209