Filters








1,668 Hits in 2.9 sec

Fault Model-Driven Test Derivation from Finite State Models: Annotated Bibliography [chapter]

Alexandre Petrenko
2001 Lecture Notes in Computer Science  
.: Distinguishing Tests for Nondeterministic and Probabilistic Machines.  ...  The fault domain usually re ects test assumptions, as an example, it can be the universe of all possible I/O FSMs with a given number of states, a classical fault domain in FSM-based testing.  ...  .: Nondeterministic State Machines in Protocol Conformance Testing. In: Proceedings of IFIP Fifth International Workshop on Protocol Test Systems, 1993.  ... 
doi:10.1007/3-540-45510-8_10 fatcat:u3v5e4762bctznu4zcvfm5t7e4

Selecting Test Sequences for Partially-Specified Nondeterministic Finite State Machines [chapter]

Gang Luo, Alexandre Petrenko, Gregor Bochmann
1995 Protocol Test Systems  
We study in this paper test generation for the fmite state machines that could be both partially-specified and nondeterministic, guided by pre-defmed conformance relations.  ...  A conformance relation for partially-specified nondeterministic finite state machines (PNFSM's) was first presented in [28] , which was also explained in [35] .  ...  Comparison with the work on test generation for labeled transition systems One of important issues in protocol conformance testing is to test communication protocols specified in LOTOS [3, 5] .  ... 
doi:10.1007/978-0-387-34883-4_6 fatcat:3tgstdktrnei5a4paro2aelsvu

Testing and Checking of Finite State Systems [chapter]

Mihalis Yannakakis
2002 Lecture Notes in Computer Science  
In this talk we will review some of the theory and algorithms on basic testing problems for systems modeled by different types of finite state machines.  ...  Finite state machines have been used to model a wide variety of systems, including sequential circuits, communication protocols, and other types of reactive systems, i.e., systems that interact with their  ...  In this talk we will review some of the theory and algorithms on basic testing problems for systems modeled by different types of finite state machines.  ... 
doi:10.1007/3-540-45995-2_6 fatcat:fyhdzbklzfhffda2agb77qhzte

On fault coverage of tests for finite state specifications

A. Petrenko, G.v. Bochmann, M. Yao
1996 Computer networks and ISDN systems  
In this paper, we analyze basic ideas underlying the techniques for fault coverage analysis and assurance mainly developed in the context of protocol conformance testing based on finite state models.  ...  Testing is a trade-off between increased confidence in the correctness of the implementation under test and constraints on the amount of time and effort that can be spent in testing.  ...  Acknowledgments This research was supported by the Hewlett-Packard-NSERC-CITI Industrial Research Chair on Communication Protocols at the Université de Montréal and an NSERC strategic research grant.  ... 
doi:10.1016/s0169-7552(96)00019-0 fatcat:eksw4yzu2ncdpkdk6fq7bbgkqa

An approach to dynamic protocol testing [chapter]

Sangjo Yoo, Myungchul Kim, Deukyoon Kang
1997 Testing of Communicating Systems  
Protocol conformance testing aims at checking if a protocol implementation conforms to the standard (or specification) it is supposed to support.  ...  In reality, the conventional protocol test procedure may give wrong local verdicts in the initial stages of testing because the procedure uses predetermined test sequence.  ...  ~¥ t §¥ ¤¥~¥ Figure 9 Test results comparison with ideal tester EXTENDING TO NONDETERMINISTIC FSM In each state of the machine, if only one transition rule is executable, the machine moves to a new  ... 
doi:10.1007/978-0-387-35198-8_12 fatcat:mfm6qi5cnfcwlo2vkkew7sdtma

A GSM-MAP Protocol Experiment Using Passive Testing [chapter]

Marine Tabourier, Ana Cavalli, Melania Ionescu
1999 Lecture Notes in Computer Science  
The specification has in general the form of a finite state machine (FSM).  ...  In this paper, we present an extension of the existing algorithms to consider the specification as an extended finite state machine (EFSM).  ...  Passive Testing for Nondeterministic Machines In the case of a nondeterministic specification, the machine can have several possible behaviours for a same input in a given state.  ... 
doi:10.1007/3-540-48119-2_50 fatcat:suwl4obgd5bj5frjwnnnpjvzzq

Protocol testing

Gregor V. Bochmann, Alexandre Petrenko
1994 Proceedings of the 1994 international symposium on Software testing and analysis - ISSTA '94  
Finally, we review the practice of protocol conformance testing and state our conclusions. 1.1.  ...  We review the major results in the area of protocol testing and discuss in which way these methods may also be relevant in the more general context of software testing. servation and synchronization problems  ...  Acknowledgments: This research was supported by the IDACOM-NSERC-CWARC Industrial Research Chair on Communication Protocols at the University of Montreal. The authors wish to  ... 
doi:10.1145/186258.187153 dblp:conf/issta/BochmannP94 fatcat:cidcy7q36nfhte7sthilvgbw3y

Coping with Nondeterminism in Network Protocol Testing [chapter]

R. E. Miller, D. -L. Chen, D. Lee, R. Hao
2005 Lecture Notes in Computer Science  
Given a nondeterministic protocol specification, we want to determine the deterministic implementation under test with a conformance of trace inclusion in the specification.  ...  In the third case, the implementation machine is a derived machine of the k-way expansion of the specification machine. The fourth case deals with the general case of nondeterministic machines.  ...  In practice, the nondeterminism is more restricted, as seen from the case studies of PPP, RIP and TCP.  ... 
doi:10.1007/11430230_10 fatcat:dtb54sm22ngybj22gymvivnoai

A Formal Approach to Robustness Testing of Network Protocol [chapter]

Chuanming Jing, Zhiliang Wang, Xia Yin, Jianping Wu
2008 Lecture Notes in Computer Science  
Robustness testing of network protocol aims to detect vulnerabilities of protocol specifications and implementations under critical conditions.  ...  Our method and test system can effectively discover vulnerabilities of protocol implementations as well as their inconsistencies with specifications.  ...  So, we build a model for protocol robustness testing using NPEFSM (Nondeterministic Parameterized Extended Finite State Machine).  ... 
doi:10.1007/978-3-540-88140-7_3 fatcat:32d57iglcra5tdxsyrdkkzrghi

A formal approach to robustness testing of network protocol with time constraints

Xia Yin, Zhiliang Wang, Chuanming Jing, Jianping Wu
2010 Security and Communication Networks  
For test generation, we propose timed anomalous test case in which only state under test is characterized by time sampling and this method can simplify test sequences largely without compromising test  ...  In order to test delay transitions, Grid Timed NPEFSM is proposed which can be generated by state characterization of Timed NPEFSM using time sampling.  ...  So we build a model for protocol robustness testing using NPEFSM (Nondeterministic Parameterized Extended Finite State Machine) in our previous work [5] .  ... 
doi:10.1002/sec.193 fatcat:haeaoxd32namdhppenyilrp2aa

A Formal Approach to Robustness Testing of Network Protocol with Time Constraints

Chuanming Jing, Xia Yin, Zhiliang Wang, Jianping Wu
2008 2008 The 9th International Conference for Young Computer Scientists  
For test generation, we propose timed anomalous test case in which only state under test is characterized by time sampling and this method can simplify test sequences largely without compromising test  ...  In order to test delay transitions, Grid Timed NPEFSM is proposed which can be generated by state characterization of Timed NPEFSM using time sampling.  ...  So we build a model for protocol robustness testing using NPEFSM (Nondeterministic Parameterized Extended Finite State Machine) in our previous work [5] .  ... 
doi:10.1109/icycs.2008.401 dblp:conf/icycs/JingYWW08 fatcat:m4vpyejf4fajtauhli56pkgcnm

Testing deterministic implementations from nondeterministic FSM specifications [chapter]

A. Petrenko, N. Yevtushenko, G. Bochmann
1996 Testing of Communicating Systems  
In this paper, conformance testing of protocols specified as nondeterministic finite state machines is considered. Protocol implementations are assumed to be deterministic.  ...  In this testing scenario, the conformance relation becomes a preorder, so-called reduction relation between FSMs.  ...  Most existing protocols allow these options. The nondeterministic machine paradigm is also useful for embedded testing.  ... 
doi:10.1007/978-0-387-35062-2_10 fatcat:7uvin2gaorgdffhhbzegovyzze

Low-end uniform hardness vs. randomness tradeoffs for AM

Ronen Shaltiel, Christopher Umans
2007 Proceedings of the thirty-ninth annual ACM symposium on Theory of computing - STOC '07  
As a consequence we obtain gap theorems for AM (and AM ∩ coAM) that state, roughly, that either AM (or AM ∩ coAM) protocols running in time t(n) can simulate all of EXP ("Arthur-Merlin games are powerful  ...  machine with small slowdown?  ...  Ω( ) (the high-end) the nondeterministic machine runs in polynomial time in the length of its input.  ... 
doi:10.1145/1250790.1250854 dblp:conf/stoc/ShaltielU07 fatcat:rubsqhu67najncnqaetyywxj44

Low-End Uniform Hardness versus Randomness Tradeoffs for AM

Ronen Shaltiel, Christopher Umans
2009 SIAM journal on computing (Print)  
As a consequence we obtain gap theorems for AM (and AM ∩ coAM) that state, roughly, that either AM (or AM ∩ coAM) protocols running in time t(n) can simulate all of EXP ("Arthur-Merlin games are powerful  ...  ") or else all of AM (or AM ∩ coAM) can be simulated in nondeterministic time s(n) ("Arthur-Merlin games can be derandomized") for a near-optimal relationship between t(n) and s(n).  ...  We accept if all of the simulated runs of the protocol accept. Note that M is indeed a nondeterministic machine that runs in time exponential in . The reduction.  ... 
doi:10.1137/070698348 fatcat:gtkmwelujzflxjiv55sav4rbee

Testing of concurrent programs based on message sequence charts

In Sang Chung, Hyeon Soo Kim, hyun Seop Bae, Yong Rae Kwon, Byung Sun Lee
1999 Proceedings International Symposium on Software Engineering for Parallel and Distributed Systems PDSE-99  
In this paper, we present a new specification-based approach to testing concurrent programs againist Message Sequence Charts(MSCs) with partial and nondeterministic semantics.  ...  New conformance relations, named behavioral conformance and nondeterminacy conformance, are defined and the details of the proposed testing methodology based on the conformance relations are given.  ...  Since communication protocols have a reactive nature, specifications are generally written in such state machine-like models as Estelle, LOTOS, and SDL.  ... 
doi:10.1109/pdse.1999.779740 dblp:conf/pdse/ChungKBKL99 fatcat:g4iujlbd4ngsjdir4puzgi7zdy
« Previous Showing results 1 — 15 out of 1,668 results