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...
Saved in:
Main Authors: | CHEN, Fuxiang, GUNAWAN, Aldy, LO, David, KIM, Sunghun |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Efficient detection and exploitation of infeasible paths for software timing analysis
by: Suhendra, V., et al.
Published: (2013) -
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
by: Zhou, G., et al.
Published: (2014) -
An iterated local search algorithm for solving the Orienteering Problem with Time Windows
by: GUNAWAN, Aldy, et al.
Published: (2015) -
Mining patterns of unsatisfiable constraints to detect infeasible paths
by: DING, Sun, et al.
Published: (2015) -
A polynomial-time inexact primal-dual infeasible path-following algorithm for convex quadratic SDP
by: Li, L., et al.
Published: (2014)