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 条
  • [21] Non-Termination of Cycle Rewriting by Finite Automata
    Endrullis, Joerg
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (225): : 2 - 4
  • [22] A practical analysis of non-termination in large logic programs
    Liang, Senlin
    Kifer, Michael
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2013, 13 : 705 - 719
  • [23] Non-Termination Analysis of Linear Loop Programs with Conditionals
    Bi, Zhongqin
    Shan, Meijing
    Wu, Bin
    PROCEEDINGS OF THE 2008 ADVANCED SOFTWARE ENGINEERING & ITS APPLICATIONS, 2008, : 159 - 164
  • [24] HipTNT plus : A Termination and Non-termination Analyzer by Second-Order Abduction
    Le, Ton Chanh
    Ta, Quang-Trung
    Chin, Wei-Ngan
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2017, PT II, 2017, 10206 : 370 - 374
  • [25] Research Summary: Non-termination Analysis of Logic Programs
    Voets, Dean
    LOGIC PROGRAMMING, 2009, 5649 : 553 - 554
  • [26] Experiments with Non-Termination Analysis for Java']Java Bytecode
    Payet, Etienne
    Spoto, Fausto
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 253 (05) : 83 - 96
  • [27] Non-termination analysis of logic programs with integer arithmetics
    Voets, Dean
    De Schreye, Danny
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2011, 11 : 521 - 536
  • [28] A non-termination criterion for binary constraint logic programs
    Payet, Etienne
    Mesnard, Fred
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2009, 9 : 145 - 164
  • [29] Non-determinism, Non-termination and the Strong Normalization of System T
    Aschieri, Federico
    Zorzi, Margherita
    TYPED LAMBDA CALCULI AND APPLICATIONS, TLCA 2013, 2013, 7941 : 31 - 47
  • [30] AProVE: Non-Termination Witnesses for C Programs (Competition Contribution)
    Hensel, Jera
    Mensendiek, Constantin
    Giesl, Jurgen
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2022, PT II, 2022, 13244 : 403 - 407