InSPeCT: Iterated local search for solving path conditions
Automated test case generation is attractive as it can reduce developer workload. To generate test cases, many Symbolic Execution approaches first produce Path Conditions (PCs), a set of constraints, and pass them to a Satisfiability Modulo Theories (SMT) solver. Despite numerous prior studies, auto...
محفوظ في:
المؤلفون الرئيسيون: | CHEN, Fuxiang, GUNAWAN, Aldy, LO, David, KIM, Sunghun |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2019
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/4521 https://ink.library.smu.edu.sg/context/sis_research/article/5524/viewcontent/Inspect_CASE_2019_av.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Singapore Management University |
اللغة: | English |
مواد مشابهة
-
Efficient detection and exploitation of infeasible paths for software timing analysis
بواسطة: Suhendra, V., وآخرون
منشور في: (2013) -
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
بواسطة: Zhou, G., وآخرون
منشور في: (2014) -
An iterated local search algorithm for solving the Orienteering Problem with Time Windows
بواسطة: GUNAWAN, Aldy, وآخرون
منشور في: (2015) -
Mining patterns of unsatisfiable constraints to detect infeasible paths
بواسطة: DING, Sun, وآخرون
منشور في: (2015) -
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
بواسطة: Li, L., وآخرون
منشور في: (2014)