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
来源
2022 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE AND EVOLUTION (ICSME 2022) | 2022年
关键词
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
相关论文
共 41 条
  • [31] Change-aware model checking for evolving concurrent programs based on Program Dependence Net
    Li, Shuo
    Chen, Cheng
    Huang, Zheng
    Ding, Zhijun
    JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS, 2023, 36 (06)
  • [32] Parametric Model Checking Timed Automata Under Non-Zenoness Assumption
    Andre, Etienne
    Nguyen, Hoang Gia
    Petrucci, Laure
    Sun, Jun
    NASA FORMAL METHODS (NFM 2017), 2017, 10227 : 35 - 51
  • [33] Disproving Termination of Non-erasing Sole Combinatory Calculus with Tree Automata
    Nakano, Keisuke
    Iwami, Munehiro
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024, 2024, 15015 : 261 - 275
  • [34] Distributed parametric model checking timed automata under non-Zenoness assumption
    Andre, Etienne
    Hoang Gia Nguyen
    Petrucci, Laure
    Sun, Jun
    FORMAL METHODS IN SYSTEM DESIGN, 2021, 59 (1-3) : 253 - 290
  • [35] A Systematic Study on Explicit-State Non-Zenoness Checking for Timed Automata
    Wang, Ting
    Sun, Jun
    Wang, Xinyu
    Liu, Yang
    Si, Yuanjie
    Dong, Jin Song
    Yang, Xiaohu
    Li, Xiaohong
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2015, 41 (01) : 3 - 18
  • [36] Non-standard semantics for program slicing
    Giacobazzi, Roberto
    Mastroeni, Isabella
    2003, Kluwer Academic Publishers (16) : 297 - 339
  • [37] EQBENCH: A Dataset of Equivalent and Non-equivalent Program Pairs
    Badihi, Sahar
    Li, Yi
    Rubin, Julia
    2021 IEEE/ACM 18TH INTERNATIONAL CONFERENCE ON MINING SOFTWARE REPOSITORIES (MSR 2021), 2021, : 610 - 614
  • [38] Enforcement FSMs - Specification and Verification of Non-Functional Properties of Program Executions on MPSoCs
    Esper, Khalil
    Wildermann, Stefan
    Teich, Juergen
    2021 19TH ACM-IEEE INTERNATIONAL CONFERENCE ON FORMAL METHODS AND MODELS FOR SYSTEM DESIGN (MEMOCODE), 2022, : 21 - 31
  • [39] Non-strict independence-based program parallelization using sharing and freeness information
    Gras, Daniel Cabeza
    Hermenegildo, Manuel V.
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (46) : 4704 - 4723
  • [40] Inductive Theorem Proving in Non-terminating Rewriting Systems and Its Application to Program Transformation
    Kikuchi, Kentaro
    Aoto, Takahito
    Sasano, Isao
    PROCEEDINGS OF THE 21ST INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING (PPDP 2019), 2019,