Adopting Metamorphic Relations to Verify Non-Testable Graph theory Algorithms

Proceedings - 2015 2nd IEEE International Conference on Advances in Computing and Communication Engineering, ICACCE 2015

Volumn , Issue , 2015, Pages 673-678

  Aruna, Chittineni ^a   Prasad, R Siva Ram ^b  

^a KKR KSR Institute of Technology and Sciences   (India)

^b ACHARYA NAGARJUNA UNIVERSITY   (India)

Author keywords

Graph Theory relations; Metamorphic Relations; Metamorphic Testing; Test Oracle problem and Graph Theory algorithms

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; COMPLEX NETWORKS; COMPUTER GRAPHICS; LEARNING SYSTEMS; SOFTWARE TESTING; TREES (MATHEMATICS);

AUTOMATED SOFTWARE TESTING; COMBINATORIAL GRAPHS; GRAPH THEORY APPLICATIONS; METAMORPHIC RELATIONS; METAMORPHIC TESTING; MINIMAL SPANNING TREE; REAL-TIME APPLICATION; TEST ORACLES;

GRAPH THEORY;

EID: 84959059230     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICACCE.2015.138     Document Type: Conference Paper

References (15)

1. th Annual convocation of CSI - Volume II, Advances in intelligent systems and Computer, Apr-2014 cited by Springer.
2. Ch Aruna, Dr.R.Siva Ram Prasad "Metamorphic relations to improve the test accuracy of Multi Precision Arithmetic software applications" Advances in Computing, Communications and Informatics (ICACCI, 2014 International Conference on24-27 Sept. 2014 by IEEE, Delhi, India.pages 2244-2248
3. Ch Aruna, Dr.R.Siva Ram Prasad "Integration of Dynamic Symbolic Execution with Metamorphic Relations to Solve Complex Path Constraints"10.5176/2251-2195-CSEIT14 by GSTF digital library 2014.
4. Chen, T. Y., Cheung, S. C., and Yiu, S. M. Metamorphic testing: a new approach for generating next test cases, Technical Report HKUST-CS98-01, Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong, 1998.R. Nicole, "Title of paper with only first word capitalized," J. Name Stand. Abbrev., in press.
5. Martin D. Davis, Elaine J. Weyuker : Pseudo-oracles for non-testable programs, Proceeding ACM '81 Proceedings of the ACM '81 conference Pages 254-257, ISBN:0-89791-049-4.
6. E. W. Dijkstra.(1959) A Note on Two Problems in Connection with graphs. Numerische Mathematik,1.269-271.
7. T. Y. Chen, F.C. Kuo, T. H. Tse, and Z. Q. Zhou. Metamorphic testing and beyond. In Proc. of the International Workshop on Software Technology and Engineering Practice (STEP), pages 94-100, 2004.
8. Michal Nagal "Bounded Verification of an Optimized Shortest Path Implementation" thesis published by KIT - University of the State of Baden-Wuerttemberg and National Laboratory of the Helmholtz Association. March-2013.
9. "Introduction to Testing Graph Properties" by Oded Goldreich LNCC 6650 , springer, 2011. Available at http://www.wisdom.weizmann.ac.il/~oded/COL/.
10. K. Yessenov, "A lightweight specification language for bounded programverification," Master's thesis, Massachusetts Institute of Technology. Dept.of Electrical Engineering and Computer Science., 2009.
11. T. Liu, M. Nagel, and M. Taghdiri, "Bounded program verification using ansmt solver: A case study," in 5th International Conference on Software Testing, Verification and Validation (ICST), April 2012.
12. Chazelle, B. "A faster deterministic algorithm for minimum spanning trees" In Proceedings of the IEEE Symposium on Foundations of Computing Science. IEEE Computer Society Press, Los Alamitos, Calif., 22-31.2000.
13. Sven Dickinson, Pelillo, Ramin Zabih, "Introduction to the special section on graph algorithms in computer vision", IEEE on patternanalysis, Vol 23 No. 10, September 2001.
14. http://sanet.csis.u-tokyo.ac.jp/sub-en/about-sanet.html
15. Ken, Mariotte "Open Shortest Path First (OSPF) Conformance and Performance Testing" Ixia 2004. http://www.ixiacom.com/sites/default/files/resouces/whitepaper/ospf.pdf.