Concolic Testing of Functional Logic Programs

被引:1
作者
Tikovsky, Jan Rasmus [1 ]
机构
[1] CAU Kiel, Inst Informat, D-24098 Kiel, Germany
来源
DECLARATIVE PROGRAMMING AND KNOWLEDGE MANAGEMENT, DECLARE 2017 | 2018年 / 10997卷
关键词
D O I
10.1007/978-3-030-00801-7_11
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the last years, concolic testing, a technique combining concrete and symbolic execution for the automated generation of test cases, has gained increasing popularity. Concolic testing tools are initialized with expressions on concrete input data. But instead of just evaluating them, they additionally collect symbolic information along specific execution paths. This information can be used to systematically compute alternative inputs exploring yet unvisited paths. In this way, test cases can be generated covering all branches of a given program. The first concolic testing tools have been developed for imperative languages analyzing code at a very low level. Recently, there have been also some approaches investigating the concolic execution of declarative languages. In this work, we discuss the application of concolic testing to the functional logic language Curry. More precisely, we present ccti, a concolic interpreter which is adapted for the automated generation of test cases for both purely functional and non-deterministic programs.
引用
收藏
页码:169 / 186
页数:18
相关论文
共 18 条
  • [1] Operational semantics for declarative multi-paradigm languages
    Albert, E
    Hanus, M
    Huch, F
    Oliver, J
    Vidal, G
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2005, 40 (01) : 795 - 829
  • [2] Amaral C, 2014, LECT NOTES COMPUT SC, V8475, P1, DOI 10.1007/978-3-319-07151-0_1
  • [3] [Anonymous], 2015, TECHNICAL REPORT
  • [4] A needed narrowing strategy
    Antoy, S
    Echahed, R
    Hanus, M
    [J]. JOURNAL OF THE ACM, 2000, 47 (04) : 776 - 822
  • [5] QuickCheck: A lightweight tool for random testing of Haskell programs
    Claessen, K
    Hughes, J
    [J]. ACM SIGPLAN NOTICES, 2000, 35 (09) : 268 - 279
  • [6] Z3: An efficient SMT solver
    de Moura, Leonardo
    Bjorner, Nikolaj
    [J]. TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, 2008, 4963 : 337 - 340
  • [7] de Moura L, 2007, LECT NOTES COMPUT SC, V4590, P20
  • [8] A 1 Mbit SRAM test structure to analyze local mismatch beyond 5 sigma variation
    Fischer, Thomas
    Otte, Christopher
    Schmitt-Landsiedel, Doris
    Amirante, Ettore
    Olbrich, Alexander
    Huber, Peter
    Ostermayr, Martin
    Nirschl, Thomas
    Einfeld, Jan
    [J]. 2007 IEEE INTERNATIONAL CONFERENCE ON MICROELECTRONIC TEST STRUCTURES, PROCEEDINGS, 2007, : 63 - +
  • [9] Giantsios A., 2015, P 17 INT S PRINC PRA
  • [10] Godefroid Patrice., 2005, P ACM SIGPLAN 2005 C