Using Multiple Adaptive Distinguishing Sequences for Checking Sequence Generation
暂无分享,去创建一个
[1] Nina Yevtushenko,et al. An Improved Conformance Testing Method , 2005, FORTE.
[2] Uraz Cengiz Türker,et al. Hardness and inapproximability of minimizing adaptive distinguishing sequences , 2014, Formal Methods Syst. Des..
[3] Marcello Balduccini,et al. Logic programming, knowledge representation, and nonmonotonic reasoning: essays dedicated to Michael Gelfond on the occasion of his 65th birthday , 2011 .
[4] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.
[5] Robert V. Binder,et al. Testing Object-Oriented Systems: Models, Patterns, and Tools , 1999 .
[6] Tsun S. Chow,et al. Testing Software Design Modeled by Finite-State Machines , 1978, IEEE Transactions on Software Engineering.
[7] Robert M. Hierons,et al. Eliminating Redundant Tests in a Checking Sequence , 2005, TestCom.
[8] Emre Mustafa Dinçtürk. A two phase approach for checking sequence generation , 2009 .
[9] Arthur D. Friedman,et al. Fault detection in digital circuits , 1971 .
[10] May Haydar,et al. Formal Verification of Web Applications Modeled by Communicating Automata , 2004, FORTE.
[11] Robert M. Hierons,et al. Optimizing the length of checking sequences , 2006, IEEE Transactions on Computers.
[12] Vladimir Lifschitz,et al. Answer Set Programming , 2019 .
[13] Krishan K. Sabnani,et al. Formal methods for generating protocol conformance test sequences , 1990, Proc. IEEE.
[14] Bruno Legeard,et al. A taxonomy of model‐based testing approaches , 2012, Softw. Test. Verification Reliab..
[15] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .
[16] Guney Gonenc,et al. A Method for the Design of Fault Detection Experiments , 1970, IEEE Transactions on Computers.
[17] David Lee,et al. Conformance testing of protocols specified as communicating finite state machines-a guided random walk based approach , 1996, IEEE Trans. Commun..
[18] Steven H. Low,et al. Probabilistic conformance testing of protocols with unobservable transitions , 1993, 1993 International Conference on Network Protocols.
[19] Tran Cao Son,et al. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.
[20] Deepinder P. Sidhu,et al. Formal Methods for Protocol Testing: A Detailed Study , 1989, IEEE Trans. Software Eng..
[21] Wolfgang Faber. Answer Set Programming , 2013, Reasoning Web.
[22] Canan Güniçen,et al. Checking sequence construction using multiple adaptive distinguishing sequences , 2015 .
[23] Alexandre Petrenko,et al. Generating Checking Sequences for Partial Reduced Finite State Machines , 2008, TestCom/FATES.
[24] A. Church. Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies , edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153. , 1958, Journal of Symbolic Logic.
[25] Krishan K. Sabnani,et al. A Protocol Test Generation Procedure , 1988, Comput. Networks.
[26] Robert M. Hierons,et al. Reduced Length Checking Sequences , 2002, IEEE Trans. Computers.
[27] Craig P. L Williams. Checking sequences for distributed test architectures , 2003 .
[28] Robert M. Hierons,et al. Using adaptive distinguishing sequences in checking sequence constructions , 2008, SAC '08.
[29] Wolfgang Grieskamp,et al. Model‐based quality assurance of protocol documentation: tools and methodology , 2011, Softw. Test. Verification Reliab..
[30] Hasan Ural,et al. Optimal length test sequence generation using distinguishing sequences , 1993, TNET.
[31] David Lee,et al. Testing Finite-State Machines: State Identification and Verification , 1994, IEEE Trans. Computers.
[32] Xiaolin Wu,et al. On Minimizing the Lengths of Checking Sequences , 1997, IEEE Trans. Computers.