research-article

On the completeness of test suites

Authors:

Adilson Luiz Bonifacio,

Arnaldo Vieira MouraAuthors Info & Claims

SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied Computing

Pages 1287 - 1292

https://doi.org/10.1145/2554850.2554968

Published: 24 March 2014 Publication History

Abstract

Test suite generation for Finite State Machines (FSMs) has been largely investigated. Here, we describe necessary and sufficient conditions for m-completeness of test suites when the specification and implementation are modeled as FSMs. Many earlier works imposed several conditions upon the specification or on the implementation models. We impose weak a priori restrictions on the models. In particular, we do not require reduced models nor complete specifications.

References

[1]

Adilson Luiz Bonifacio, Arnaldo Vieira Moura, and Adenilso da Silva Simão. Model partitions and compact test case suites. Int. J. Found. Comput. Sci., 23(1): 147--172, 2012.

[2]

T. S. Chow. Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, 4(3): 178--187, 1978.

Digital Library

[3]

A. S da Silva and A. Petrenko. Checking completeness of tests for finite state machines. IEEE Trans. Computers, 59(8): 1023--1032, 2010.

Digital Library

[4]

Rita Dorofeeva, Khaled El-Fakih, and Nina Yevtushenko. An improved conformance testing method. In FORTE, pages 204--218, 2005.

Digital Library

[5]

N. V. Evtushenko and A. F. Petrenko. Synthesis of test experiments in some classes of automata. Autom. Control Comput. Sci., 24(4): 50--55, April 1991.

Digital Library

[6]

S. Fujiwara, G. V. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi. Test selection based on finite state models. IEEE Transactions on Software Engineering, 17(6): 591--603, June 1991.

Digital Library

[7]

A. Gill. Introduction to the theory of finite-state machines. McGraw-Hill, New York, 1962.

[8]

G. Gonenc. A method for the design of fault detection experiments. IEEE Trans. Comput., 19(6): 551--558, 1970.

Digital Library

[9]

Sezer Gören and F. Joel Ferguson. On state reduction of incompletely specified finite state machines. Comput. Electr. Eng., 33(1): 58--69, January 2007.

Digital Library

[10]

F. C. Hennie. Fault detecting experiments for sequential circuits. In Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design, 11--13 November 1964, Princeton, New Jersey, USA, pages 95--110. IEEE, 1964.

Digital Library

[11]

Robert M. Hierons and Hasan Ural. Reduced length checking sequences. IEEE Trans. Comput., 51(9): 1111--1117, September 2002.

Digital Library

[12]

Robert M. Hierons and Hasan Ural. Optimizing the length of checking sequences. IEEE Trans. Comput., 55(5): 618--629, May 2006.

Digital Library

[13]

Gang Luo, G. von Bochmann, and A. Petrenko. Test selection based on communicating nondeterministic finite-state machines using a generalized wp-method. IEEE Trans. Softw. Eng., 20(2): 149--162, 1994.

Digital Library

[14]

Jorge M. Pena and Arlindo L. Oliveira. A new algorithm for the reduction of incompletely specified finite state machines. In In ICCAD, 482--489, pages 482--489. IEEE Computer Society Press, 1998.

Digital Library

[15]

A. Petrenko and G. V. Bochmann. On fault coverage of tests for finite state specifications. Computer Networks and ISDN Systems, 29: 81--106, 1996.

Digital Library

[16]

A. Petrenko and N. Yevtushenko. On test derivation from partial specifications. In In FORTE, pages 85--102, 2000.

Digital Library

[17]

Alexandre Petrenko and Gregor v. Bochmann. Selecting test sequences for partially-specified nondeterministic finite state machines. In Gang Luo, editor, IWPTS '94: 7th IFIP WG 6.1 international workshop on protocol test systems, pages 95--110, London, UK, 1995. Chapman & Hall, Ltd.

Digital Library

[18]

Alexandre Petrenko and Nina Yevtushenko. Testing from partial deterministic fsm specifications. IEEE Trans. Comput., 54(9): 1154--1165, September 2005.

Digital Library

[19]

Adenilso Simao, Alexandre Petrenko, and Nina Yevtushenko. On reducing test length for fsms with extra states. Softw. Test. Verif. Reliab., 22(6): 435--454, September 2012.

Digital Library

[20]

Hasan Ural, Xiaolin Wu, and Fan Zhang. On minimizing the lengths of checking sequences. IEEE Trans. Comput., 46(1): 93--99, January 1997.

Digital Library

[21]

Ming Yu Yao, Alexandre Petrenko, and Gregor von Bochmann. Fault coverage analysis in respect to an fsm specification. In INFOCOM, pages 768--775, 1994.

Cited By

Sachtleben R(2024)Unifying Frameworks for Complete Test StrategiesScience of Computer Programming10.1016/j.scico.2024.103135(103135)Online publication date: Apr-2024
https://doi.org/10.1016/j.scico.2024.103135
Rodríguez IRosa-Velardo FRubio F(2019)Introducing complexity to formal testingJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2019.100502(100502)Online publication date: Oct-2019
https://doi.org/10.1016/j.jlamp.2019.100502
Hierons RTürker U(2017)Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMsACM Transactions on Software Engineering and Methodology10.1145/305112126:1(1-34)Online publication date: 12-Jul-2017
https://dl.acm.org/doi/10.1145/3051121
Show More Cited By

Index Terms

On the completeness of test suites

Recommendations

Prioritizing random combinatorial test suites
SAC '17: Proceedings of the Symposium on Applied Computing

The behaviour of a system under test can be influenced by several factors, such as system configurations, user inputs, and so on. It has also been observed that many failures are caused by only a small number of factors. Combinatorial testing aims at ...
Comparing non-adequate test suites using coverage criteria
ISSTA 2013: Proceedings of the 2013 International Symposium on Software Testing and Analysis

A fundamental question in software testing research is how to compare test suites, often as a means for comparing test-generation techniques. Researchers frequently compare test suites by measuring their coverage. A coverage criterion C provides a set ...
Adaptive random prioritization for interaction test suites
SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied Computing

Combinatorial interaction testing (CIT), a black-box testing method, has been well studied in recent years. It aims at constructing an effective interaction test suites, so as to identify the faults that are caused by interactions among parameters. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '14: Proceedings of the 29th Annual ACM Symposium on Applied Computing

March 2014

1890 pages

ISBN:9781450324694

DOI:10.1145/2554850

Conference Chairs:
Yookun Cho
Seoul National University, Korea
,
Sung Y. Shin
South Dakota State University
,
Program Chairs:
Sangwook Kim
Kyungpook National University, Korea
,
Chih-Cheng Hung
Southern Polytechnic State University
,
Jiman Hong
Soongsil University, South Korea

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 March 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Funding Sources

Fundação de Amparo à Pesquisa do Estado de São Paulo

Conference

SAC 2014

Sponsor:

SIGAPP

SAC 2014: Symposium on Applied Computing

March 24 - 28, 2014

Gyeongju, Republic of Korea

Acceptance Rates

SAC '14 Paper Acceptance Rate 218 of 939 submissions, 23%;

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
80
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)1

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sachtleben R(2024)Unifying Frameworks for Complete Test StrategiesScience of Computer Programming10.1016/j.scico.2024.103135(103135)Online publication date: Apr-2024
https://doi.org/10.1016/j.scico.2024.103135
Rodríguez IRosa-Velardo FRubio F(2019)Introducing complexity to formal testingJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2019.100502(100502)Online publication date: Oct-2019
https://doi.org/10.1016/j.jlamp.2019.100502
Hierons RTürker U(2017)Parallel Algorithms for Generating Distinguishing Sequences for Observable Non-deterministic FSMsACM Transactions on Software Engineering and Methodology10.1145/305112126:1(1-34)Online publication date: 12-Jul-2017
https://dl.acm.org/doi/10.1145/3051121
Hierons R(2017)Testing from Partial Finite State Machines without Harmonised TracesIEEE Transactions on Software Engineering10.1109/TSE.2017.265245743:11(1033-1043)Online publication date: 1-Nov-2017
https://doi.org/10.1109/TSE.2017.2652457
Bonifacio AMoura ASimao A(2017)Experimental comparison of approaches for checking completeness of test suites from finite state machinesInformation and Software Technology10.1016/j.infsof.2017.07.01292(95-104)Online publication date: Dec-2017
https://doi.org/10.1016/j.infsof.2017.07.012
Bonifácio AMoura A(2017)Test suite completeness and black box testingSoftware Testing, Verification and Reliability10.1002/stvr.162627:1-2(e1626)Online publication date: 9-Jan-2017
https://doi.org/10.1002/stvr.1626
Hierons RTurker U(2016)Parallel Algorithms for Generating Harmonised State Identifiers and Characterising SetsIEEE Transactions on Computers10.1109/TC.2016.253286965:11(3370-3383)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1109/TC.2016.2532869
Bonifacio AMoura A(2014)Test Suite Completeness and Partial ModelsSoftware Engineering and Formal Methods10.1007/978-3-319-10431-7_8(96-110)Online publication date: 2014
https://doi.org/10.1007/978-3-319-10431-7_8

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents