Article

Free access

Testing finite state machines

Author:

Mihalis Yannakakis Editor:

David LeeAuthors Info & Claims

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

Pages 476 - 485

https://doi.org/10.1145/103418.103468

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

Agrawal, V. D. and Seth, S. C. {1988}. Test Generation for VLSI Chips, Computer Society Press, Washington, DC.

Google Scholar

[2]

Aho, A. V., Dabhura, A. T., Lee, D. and Uyar, M. U. {1988}. An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours, to appear in IEEE Trans. on Communication, an early version published in Proc. IFIP WG 6.1 Eighth Intl. Syrup. on Protocol Specification, Testing and Verification, pp. 75-86, Atlantic City, N.J.

Google Scholar

[3]

Aho, A. V., Sethi, R., and Ullmart, L D. {1986}. Compilers: Principles, Techniques, and Tools, Addison-Wesley.

Digital Library

Google Scholar

[4]

Aleliunas, R., Karp, R. M., Lipton, R. J., Lovasz, L., and Rackoff, C. {1979}. Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems, in Proc. 20th Ann. Syrup. on Foundations of Computer Science, pp. 218-223.

Google Scholar

[5]

Angluin, D. {1987}. Learning Regular Sets from Queries and Counterexamples, in Information and Computation, 75, pp. 87-106.

Digital Library

Google Scholar

[6]

Chan, W. Y. L., Vuong S. T., and Ito, M. R. {1989}. An Improved Protocol Test Generation Procedure Based on UIOs, in Proc. SIGCOM89, pp. 283-294.

Digital Library

Google Scholar

[7]

Chow, T. S. {1978}. Testing Software Design Modeled by Finite-State Machines, in IEEE Trans. on Software Engineering, Vol. SE-4, No. 3, pp. 178-187.

Google Scholar

[8]

Friedman, A. D. and Menon, P, R. {1971}. Fault Detection in Digital Circuits, Prentice-Hall, Inc., Englewood Cliffs, New Jersey.

Google Scholar

[9]

Gill, A. {1961}. State-Identification Experiments in Finite Automata, in Information and Control, Vol. 4, pp. 132-154.

Crossref

Google Scholar

[10]

Gill, A. {1962}. Introduction to the Theory of Finitestate Machines, McGraw-Hill Book Company, New Yore

Google Scholar

[11]

Gobershtein, S. M. {1974}. Check Words for the States of a Finite Automaton, in Kibernetika, No. 1, pp. 46-49.

Google Scholar

[12]

Hennie, F. C. {1964}. Fault Detecting Experiments for Sequential Circuits, in Proc. Fifth Ann. Syrup. Switching Circuit Theory and Logical Design, pp. 95-110, Princeton, N. J.

Google Scholar

[13]

Holzmann, G. J. {1990}. Design and Validation of Protocols, Prentice-Hall, inc., Englewood Cliffs, New Jersey.

Digital Library

Google Scholar

[14]

Hopcroft, J. E. {1971}. An n log n,Mgorithm for Minimizing States in a Finite Automaton, in Theory of Machines and Computations, Z. Kohavi and A. Paz (eds.), pp. 189-196, Academic Press, New York.

Google Scholar

[15]

Hsieh, E. P. {1971}. Checking Experiments for Sequential Machines, in IEEE Trar#. .on Computer, Vol. C-20, No. 10, pp. 1152-1166.

Google Scholar

[16]

Huffrnaxt, D. A. {1964}. Canonica#l Forms for Information-Lossless Finite-State Logical Machines, in Sequential Machines: Selected Papers, E. F. Moore, ed., Addison-Wesley, Reading Mass.

Google Scholar

[17]

Kohavi, I. and Kohavi, Z. {1968}. Variable-Length Distinguishing Sequences and Their Application to the Design of Fault-Detection Experiments, in IEEE Trans. on Computer, Vol. C-17, pp. 792.-795.

Google Scholar

[18]

Kohavi, Z. {1978}. Switching and Finite Automata Theory. Second Edition, McGraw-Hi#t Book company, New York.

Digital Library

Google Scholar

[19]

Lee, D. and Yarmakakis, M. {1990}. An Algorithm for Minimizing Extended Finite State Machines, in preparation.

Google Scholar

[20]

Logical Link Control {1989}. International Standard ISO 8802-2, IEEE Std. 802.2, The Institute of Electrical and Electronics Engineers, Inc.

Google Scholar

[21]

Moore, E. F. {1956}. Gedanken-experiments on Sequential Machines, in Automata Studies, Annals of Mathematics Studies, No. 34, pp. 129-153, Princeton University Press, Princeton, N. J.

Google Scholar

[22]

Naito, S. and Tsunoyama, M. {1981}. Fault Detection for Sequential Machines by Transitions Tours, in Proc. IEEE Fault Tolerant Comput. Syrup., IEEE Computer Society Press, pp. 238-243.

Google Scholar

[23]

Nisan, N. {1990}. Pseudorandom Generators for ' Space-Bounded Computations, in Proc. 22nd Ann. ACM Syrup. on Theory of Computing, pp.204-212.

Digital Library

Google Scholar

[24]

Rivest, R. L. and Schapire, R. E. { 1989}. inference of Finite Automata Using Homing Sequences, in STOC89.

Digital Library

Google Scholar

[25]

Sabnani, K. K. and Dahbura, A. T. {1988}. A Protocol Test Generation Procedure, in Computer Networks and ISDN Systems, Vol. 15, No. 4, pp. 285-297.

Digital Library

Google Scholar

[26]

Seitz, C. L. {1971}. An Approach Ix> Designing Checking Experiments Based on a Dynamic Model, in Theory of Machines and Computatior#, Z. Kohavi and A. Paz eds., Academic Press, New York.

Google Scholar

[27]

Shen, Y. N., Lombardi, F. and Dahbura, A. T. {1989}. Protocol Conformance Testing Using Multiple UIO Sequences, in Proc. Ninth IFIP Syrup. on Protocol Specification, Testing and Verification, Twente, Holland.

Digital Library

Google Scholar

[28]

Sidhu, D. P. and Leung, T.-K. {1989}. Formal Methods for Protocol Testing: A Detailed Study, in IEEE Trans. Soft. Eng., Vol. 15, No. 3, pp. 413-126.

Digital Library

Google Scholar

[29]

Sokolovskii, M. N. {1971}. Diagnostic Experiments with Automata, in Kibernetika, No. 6, pp. 44-49.

Google Scholar

[30]

Vasilevskii, M. P. {1973}. Failure Diagnosis of Automata, in Kibernetika, No, 4, pp. 98-108,

Google Scholar

[31]

Yang, B. and Ural, H. {1990}. Protocol Conformance Test Generation Using Multiple UIO Sequences with Overlapping, in Proc. SIGCOM 90, pp. 118-125.

Digital Library

Google Scholar

Cited By

View all

Atlidakis VGodefroid PPolishchuk M(2020)Checking Security Properties of Cloud Service REST APIs2020 IEEE 13th International Conference on Software Testing, Validation and Verification (ICST)10.1109/ICST46399.2020.00046(387-397)Online publication date: Oct-2020
https://doi.org/10.1109/ICST46399.2020.00046
Pan RHu QXu GD'Antoni L(2019)Automatic repair of regular expressionsProceedings of the ACM on Programming Languages10.1145/33605653:OOPSLA(1-29)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360565
Atlidakis VGodefroid PPolishchuk MAtlee JBultan TWhittle J(2019)RESTlerProceedings of the 41st International Conference on Software Engineering10.1109/ICSE.2019.00083(748-758)Online publication date: 25-May-2019
https://dl.acm.org/doi/10.1109/ICSE.2019.00083
Show More Cited By

Index Terms

Testing finite state machines
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Mutation Analysis for Testing Finite State Machines
ISECS '09: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01

Mutation analysis is a program testing method which seeds a fault in a program and tries to identify it with test data, thus promoting the test efficiency. The paper investigates the application of mutation analysis in model-based testing for the ...
Checking Completeness of Tests for Finite State Machines

In testing from a Finite State Machine (FSM), the generation of test suites which guarantee full fault detection, known as complete test suites, has been a long-standing research topic. In this paper, we present conditions that are sufficient for a test ...
Exhaustive property oriented model-based testing with symbolic finite state machines
Abstract
We advocate a fusion of property-oriented testing (POT) and model-based testing (MBT). The existence of a symbolic finite state machine (SFSM) model fulfilling the properties of interest is exploited for property-directed test data generation and ...
Highlights
- We present a test suite generation procedure for model-based property-oriented testing. Properties are specified in LTL.
- Passing a test suite implies that the implementation fulfils every safety property over a given set of atomic ...

Comments

Information & Contributors

Information

Published In

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

January 1991

572 pages

ISBN:0897913973

DOI:10.1145/103418

Chairmen:
Cris Koutsougeras
Tulane Univ., New Orleans, LA
,
Jeff Vitter
Brown Univ., Providence, RI

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC91

Sponsor:

SIGACT

STOC91: 23rd Annual ACM Symposium on Theory of Computing

May 5 - 8, 1991

Louisiana, New Orleans, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
1,517
Total Downloads

Downloads (Last 12 months)137
Downloads (Last 6 weeks)8

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Atlidakis VGodefroid PPolishchuk M(2020)Checking Security Properties of Cloud Service REST APIs2020 IEEE 13th International Conference on Software Testing, Validation and Verification (ICST)10.1109/ICST46399.2020.00046(387-397)Online publication date: Oct-2020
https://doi.org/10.1109/ICST46399.2020.00046
Pan RHu QXu GD'Antoni L(2019)Automatic repair of regular expressionsProceedings of the ACM on Programming Languages10.1145/33605653:OOPSLA(1-29)Online publication date: 10-Oct-2019
https://dl.acm.org/doi/10.1145/3360565
Atlidakis VGodefroid PPolishchuk MAtlee JBultan TWhittle J(2019)RESTlerProceedings of the 41st International Conference on Software Engineering10.1109/ICSE.2019.00083(748-758)Online publication date: 25-May-2019
https://dl.acm.org/doi/10.1109/ICSE.2019.00083
Lalanne FMaag S(2009)From the IMS PoC service monitoring to its formal conformance testingProceedings of the 6th International Conference on Mobile Technology, Application & Systems10.1145/1710035.1710043(1-8)Online publication date: 2-Sep-2009
https://dl.acm.org/doi/10.1145/1710035.1710043
Li LLiu LWang ZTang Y(2008)Research on Interface Automata TestingProceedings of the 2008 International Conference on Computer Science and Software Engineering - Volume 0210.1109/CSSE.2008.850(743-746)Online publication date: 12-Dec-2008
https://dl.acm.org/doi/10.1109/CSSE.2008.850
Longuet DAiguier M(2007)Specification-based testing for COCASL'S modal specificationsProceedings of the 2nd international conference on Algebra and coalgebra in computer science10.5555/1770730.1770756(356-371)Online publication date: 20-Aug-2007
https://dl.acm.org/doi/10.5555/1770730.1770756
Ševčíková HBorning ASocha DBleek WPollock LPezzè M(2006)Automated testing of stochastic systemsProceedings of the 2006 international symposium on Software testing and analysis10.1145/1146238.1146263(215-224)Online publication date: 21-Jul-2006
https://dl.acm.org/doi/10.1145/1146238.1146263
Briones LBrinksma EStoelinga M(2006)A semantic framework for test coverageProceedings of the 4th international conference on Automated Technology for Verification and Analysis10.1007/11901914_30(399-414)Online publication date: 23-Oct-2006
https://dl.acm.org/doi/10.1007/11901914_30
El-Fakih KPetrenko AYevtushenko N(2006)FSM test translation through contextProceedings of the 18th IFIP TC6/WG6.1 international conference on Testing of Communicating Systems10.1007/11754008_16(245-258)Online publication date: 16-May-2006
https://dl.acm.org/doi/10.1007/11754008_16
Rodrigues MUral H(2006)Lower bounds for the length of test sequences using UIOsNetworks10.1002/net.323025010525:1(31-39)Online publication date: 11-Oct-2006
https://doi.org/10.1002/net.3230250105
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Mutation Analysis for Testing Finite State Machines

Checking Completeness of Tests for Finite State Machines

Exhaustive property oriented model-based testing with symbolic finite state machines

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Mutation Analysis for Testing Finite State Machines

Checking Completeness of Tests for Finite State Machines

Exhaustive property oriented model-based testing with symbolic finite state machines

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations