Open AccessConcurrency testing using symbolic path finder
Author(s) -
Bidush Kumar Sahoo,
Mitrabinda Ray
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.6.10782
Subject(s) - computer science , concurrency , nondeterministic algorithm , programming language , symbolic execution , synchronization (alternating current) , path (computing) , parallel computing , deadlock , algorithm , software , computer network , channel (broadcasting)
Concurrent programs have specific features such as italic communication, synchronization and nondeterministic behavior that make the testing activity complex. The objective is to find various types of concurrent defects. In this paper, we have used a model checking tool called Symbolic Path Finder (SPF) which is the upgradation of Java Path Finder (JPF) for concurrent testing. SPF is used for generating the test cases to check concurrent defects such as deadlock, race condition etc. SPF generates symbolic execution tree of the given code which is used as an input for test case generation. The execution is done for finding the test cases in concurrent program where number of threads is operating together with the concurrent defects. The test cases show the type of concurrent defects in the respective line number of the source code.