Open Access   Article Go Back

Boundary Analysis for Equivalent Class Partitioning by using Binary Search

Sandeep Chopra1 , Lata Nautiyal2 , M.K. Sharma3

Section:Survey Paper, Product Type: Journal Paper
Volume-7 , Issue-2 , Page no. 601-605, Feb-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7i2.601605

Online published on Feb 28, 2019

Copyright © Sandeep Chopra, Lata Nautiyal, M.K. Sharma . 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

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Sandeep Chopra, Lata Nautiyal, M.K. Sharma, “Boundary Analysis for Equivalent Class Partitioning by using Binary Search,” International Journal of Computer Sciences and Engineering, Vol.7, Issue.2, pp.601-605, 2019.

MLA Style Citation: Sandeep Chopra, Lata Nautiyal, M.K. Sharma "Boundary Analysis for Equivalent Class Partitioning by using Binary Search." International Journal of Computer Sciences and Engineering 7.2 (2019): 601-605.

APA Style Citation: Sandeep Chopra, Lata Nautiyal, M.K. Sharma, (2019). Boundary Analysis for Equivalent Class Partitioning by using Binary Search. International Journal of Computer Sciences and Engineering, 7(2), 601-605.

BibTex Style Citation:
@article{Chopra_2019,
author = {Sandeep Chopra, Lata Nautiyal, M.K. Sharma},
title = {Boundary Analysis for Equivalent Class Partitioning by using Binary Search},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {2 2019},
volume = {7},
Issue = {2},
month = {2},
year = {2019},
issn = {2347-2693},
pages = {601-605},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=3711},
doi = {https://doi.org/10.26438/ijcse/v7i2.601605}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i2.601605}
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=3711
TI - Boundary Analysis for Equivalent Class Partitioning by using Binary Search
T2 - International Journal of Computer Sciences and Engineering
AU - Sandeep Chopra, Lata Nautiyal, M.K. Sharma
PY - 2019
DA - 2019/02/28
PB - IJCSE, Indore, INDIA
SP - 601-605
IS - 2
VL - 7
SN - 2347-2693
ER -

VIEWS PDF XML
298 225 downloads 100 downloads
  
  
           

Abstract

Testing of Software is an indispensible phase of software development. It helps us to improve functional and non-functional characteristics. To implement functional test scenario black box testing process is used, and the test bases are the functional requirement. Nonfunctional requirement does not describe the function, but the attribute of the function i.e function quality, usability, efficiency and reliability. To implement testing, the most difficult part is to design test cases. There are numerous processes available which can help us to design test cases. This paper will present the novel algorithm of Equivalence class partitioning. Here the input is partitioned by using a strategy that is inspired by binary search. Based on the input data, the complete range is divided into two sub ranges, and this partition continues until a threshold is reached. The proposed novel algorithm of testing will increase the reliability of the software product.

Key-Words / Index Term

Software testing, functional testing, black box testing, binary search, class partitioning

References

[1]. B. Meyer. “The grand challenge of trusted components,” In Proc. ICSE
[2]. 2003, pages 660–667. IEEE Computer Society Press, 2003,
[3]. Bertrand Meyer et al. “Providing Trusted Component to the Industry ,”
[4]. vol 31,no 5,pp104-105. IEEE, May 1998
[5]. C. Szyperski, Component Oriented Programming: Beyond Object
[6]. Oriented. Reading, MA: Pearson Education, 1999.
[7]. G. J. Myers, The art of software testing, 2nd ed. United States: John
[8]. Wiley & Sons, 2004.
[9]. Sandeep Chopra, M.K.Sharma, LataNautiyali, “Analogous Study of
[10]. Component-Based Software Engineering Models”,IJARCSSE, Vol.7
[11]. ,Issue 6, pp. 597-603, 2017
[12]. M. Sitariman and B. Weide, „Component-based software using
[13]. RESOLVE‟, ACM SIGSOFT Software Engineering Notes, vol. 19, no.
[14]. 4, pp. 21–22, Oct. 1994
[15]. Sandeep Chopra etal“Elena – A Novel Component Based Life Cycle
[16]. Model”, European Journal of Advances in Engineering and
[17]. Technology 2017, 4(12): 932-940
[18]. IEEE “Standard Glossary of Software Engineering Terminology‟, IEEE
[19]. Standards Board, Sep. 1990.
[20]. IanSommerville . Software Engineering . 9thedition.Addison Wesley
[21]. March 2010
[22]. LataNautiyal,Preeti, “A Novel Approach of Equivalent Class
[23]. Partitioning for Numerical Input”,ACM SIGSOFT ,Vol41, Number 1,
[24]. Jan 2016
[25]. LataNautiyal,etal, “A Novel Approach to Component Based Software
[26]. Testing”,ACM SIGSOFT ,Vol 39, Number 6, Nov 2014
[27]. J.MVoas ,” A dynamic testing complexity metric” Software Quality
[28]. Journal, vol 1 issue 2, pp 101-114 , june 1992
[29]. C.Ramamoorthyetal,” On the automated generation of program test
[30]. data”, IEEE Transaction on Software Engineering ,2(4): 293-300, april
[31]. 1976
[32]. J. Voas and J. Payne, „Dependability certification of software
[33]. components‟, Journal of Systems and Software, vol. 52, no. 2–3, pp.
[34]. 165–172, Jun. 2000.
[35]. J. Voas, J. Payne, R. Mills, and J. McManus, “Software testability‟,
[36]. Proceedings of the 1995 Symposium on Software reusability - SSR ’95,
[37]. April. 1995.
[38]. E.J. Weyukar. More experience with data flow testing ,IEEE
[39]. Transaction on Software Engineering ,19(9), : 912- 919 , 1993
[40]. Beatriz Pérez Lamancha, Pedro Reales Mateo, Ignacio Rodríguez de
[41]. Guzmán, Macario Polo Usaola, and Mario Piattini Velthius, “Automated
[42]. model-based testing using the UML testing profile and QVT,”
[43]. Proceedings of the 6th International Workshop on Model-Driven
[44]. Engineering, Verification and Validation (MoDeVVa 2009),Denver,
[45]. Colorado, USA, 05 Oct 2009. ACM International Conference
[46]. Proceedings Series, vol. 413, ACM Press, 2009.
[47]. Brown, Alan W., Wallnau, Kurt C. (1998): The Current State of CBSE.
[48]. IEEE Software Journal, September/October 1998, pp. 37-46.
[49]. Han, Jun (1998): Characterization of Components. In proceedings of
[50]. International Workshop on Component- Based Software Engineering,
[51]. 1998.
[52]. Hong Zhu, Patrick A. V. Hall and John H. R. May, “Software Unit Test
[53]. Coverage and Adequacy,” ACM Computing Survey, vol. 29, no. 4, pp.
[54]. 366–427, Dec 1997.
[55]. Paul Baker, Zhen Ru Dai, Jens Grabowski, Øystein Haugen, Ina
[56]. Schieferdecker, and Clay Williams, Model-Driven Testing Using the
[57]. UML Testing Profile. Springer, 08 Nov 2007.
[58]. 22 . A. Bertolino and E. Marchetti. 2005. Introducing a Reasonably
[59]. Complete and Coherent Approach for Model-based Testing. Electronic
[60]. Notes in Theoretical Computer Science, Elsevier, 116, 85–97
[61]. Leonardo Mariani and Mauro Pezz`e. 2005. A Technique for Verifying
[62]. Component-Based Software, Electronic Notes in Theoretical Computer
[63]. Science, Elsevier, 116, 17–30.
[64]. Bin Lei, Zhiming Liu, Charles Morisset and Xuandong Li, 2010. State
[65]. Based Robustness Testing for Components. Electronic Notes in
[66]. Theoretical Computer Science, Elsevier. 260, 173– 188.
[67]. Arnaud Gotlieb and Matthieu Petit. 2006. Path Oriented random testing.
[68]. Proceedings of the First International Workshop on Random Testing,
[69]. July 20, 2006, Portland, ME, USA Copyright ACM.
[70]. A. Jain, S. Sharma, S. Sharma and D. Juneja. 2010. Boundary value
[71]. analysis for non-numerical variables: Strings, Oriental Journal of
[72]. Computer Science & Technology, Vol. 3(2), 323-330.