Open Access   Article Go Back

A BRIEF SURVEY ON SYMBOLIC EXECUTION TEST-SELECTION TECHNIQUES

K.K. Nivethithaa1 , V. Krishnapriya2

Section:Survey Paper, Product Type: Journal Paper
Volume-06 , Issue-08 , Page no. 81-85, Oct-2018

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v6si8.8185

Online published on Oct 31, 2018

Copyright © K.K. Nivethithaa, V. Krishnapriya . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

IEEE Style Citation: K.K. Nivethithaa, V. Krishnapriya, “A BRIEF SURVEY ON SYMBOLIC EXECUTION TEST-SELECTION TECHNIQUES,” International Journal of Computer Sciences and Engineering, Vol.06, Issue.08, pp.81-85, 2018.

MLA Style Citation: K.K. Nivethithaa, V. Krishnapriya "A BRIEF SURVEY ON SYMBOLIC EXECUTION TEST-SELECTION TECHNIQUES." International Journal of Computer Sciences and Engineering 06.08 (2018): 81-85.

APA Style Citation: K.K. Nivethithaa, V. Krishnapriya, (2018). A BRIEF SURVEY ON SYMBOLIC EXECUTION TEST-SELECTION TECHNIQUES. International Journal of Computer Sciences and Engineering, 06(08), 81-85.

BibTex Style Citation:
@article{Nivethithaa_2018,
author = {K.K. Nivethithaa, V. Krishnapriya},
title = {A BRIEF SURVEY ON SYMBOLIC EXECUTION TEST-SELECTION TECHNIQUES},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {10 2018},
volume = {06},
Issue = {08},
month = {10},
year = {2018},
issn = {2347-2693},
pages = {81-85},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=480},
doi = {https://doi.org/10.26438/ijcse/v6i8.8185}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v6i8.8185}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=480
TI - A BRIEF SURVEY ON SYMBOLIC EXECUTION TEST-SELECTION TECHNIQUES
T2 - International Journal of Computer Sciences and Engineering
AU - K.K. Nivethithaa, V. Krishnapriya
PY - 2018
DA - 2018/10/31
PB - IJCSE, Indore, INDIA
SP - 81-85
IS - 08
VL - 06
SN - 2347-2693
ER -

           

Abstract

Symbolic execution techniques decrease the cost of path redundancy by choosing a separation of an existing test suite to use in retesting a customized program. Over the history, Eliminating Path Redundancy via Postconditioned Symbolic Execution techniques has been described in the literature. This paper aims to present a brief survey on symbolic executions in black-box and white-box regression testing under the Software testing and learning techniques that are in use in today`s software engineering of verification and validation tasks. Number of comparative study has been performed to evaluate the performance of predictive accuracy on the test cases and the outcome discloses that Bidirectional Symbolic Analysis for Effective Branch Testing method outperforms having better performance other predictive methods are not performing well.

Key-Words / Index Term

Symbolic execution, testing and debugging, Parallel symbolic execution, AEG

References

[1] J.Jaar, A. E. Santosa, and R. Voicu. An interpolation method for clp traversal. In CP, 2009.
[2] K. L. McMillan. Lazy annotation for program testing and verification. In CAV, 2010.
[3] CADAR, C., DUNBAR, D., AND ENGLER, D. KLEE: Unassisted and automatic generation of high-coverage tests for complex sys tems programs. In Proc. of Symp. on Operating Systems Design and Impl (OSDI) (2008).
[4] M. Staats and C. S. Pasareanu, “Parallel symbolic execution for structural test generation,” in Proc. Int. Symp. Softw. Testing Anal., 2010, pp. 183–194.
[5] T. Avgerinos, S. K. Cha, B. L. T. Hao, and D. Brumley, “AEG: Automatic exploit generation,” in Proc. USENIX Symp. Netw. Distrib. Syst. Secur., Feb. 2011, pp. 283–300.
[6] D.-H. Chu and J. Jaffar, “A complete method for symmetry reduction in safety verification,” in Proc. Int. Conf. Comput. Aided Verification, 2012, pp. 616–633.
[7] E. Bounimova, P. Godefroid, and D. A. Molnar, “Billions and billions of constraints: Whitebox fuzz testing in production,” in Proc. 35th Int. Conf. Softw. Eng., 2013, pp. 122–131.
[8] D. Chu, J. Jaffar, and V. Murali, “Lazy symbolic execution for enhanced learning,” in Proc. 5th Int. Conf. Runtime Verification, 2014, pp. 323–339.
[9] D. A. Ramos and D. R. Engler, “Under-constrained symbolic execution: Correctness checking for real code,” in Proc. 24th USENIX Secur. Symp., 2015, pp. 49–64.
[10] M. Baluda, G. Denaro, and M. Pezze, “Bidirectional symbolic analysis for effective branch testing,” IEEE Trans. Softw. Eng., vol. 42, no. 5, pp. 403–426, May 2016.