Filters








59,555 Hits in 4.3 sec

Risk based Test Case Prioritization using UML State Machine Diagram

Gufran Ahmad Ansari, Wasiur Rhmann, Vipin Saxena
2016 International Journal of Applied Information Systems  
State machine diagram is transformed into WEFSM (Weighted Extended Finite State Machine) and a case study of ATM system is used to evaluate the proposed approach.  ...  Test cases are designed to find the bugs in the software. Prioritization of test cases is used to execute test cases earlier which are of high probability of finding bugs.  ...  Weighted Extended Finite State Machine (WEFSM) A WEFSM (Weighted Extended Finite State Machine) is in which nodes are used to represent states of the system and edges represent the transition between states  ... 
doi:10.5120/ijais2016451624 fatcat:po3hor42ufhevjwgf25vevowoq

Automata-Based Software Reliability Model: The Key to Reliable Software

Ritika Wason, P. Ahmed, M. Qasim Rafiq
2013 International Journal of Software Engineering and Its Applications  
Section 5 traces the different extensions and applications of finite state machine (FSM) models in designing and testing reliable software systems.  ...  Section 3 introduces the formal finite state machine model and discusses its applications in software systems.  ...  We argue that as software in execution is a Finite State Machine (FSM) or Finite State Automata (FSA), we should use a finite state machine representation of an executable software system to accurately  ... 
doi:10.14257/ijseia.2013.7.6.10 fatcat:n7wb6wadmrh3vnosuctyvsassi

A brief history of A-MOST Special Issue containing selected papers from A-MOST 2008

Lars Frantzen, Mercedes G. Merayo, Manuel Núñez
2009 The Journal of Logic and Algebraic Programming  
This special issue contains the revised and extended versions of three papers presented in the 4th Workshop on Advances in Model-Based Testing (A-MOST 2008).  ...  In addition to an executive summary of these three papers, this preface briefly reviews the papers published in the four editions of the A-MOST workshop.  ...  [39] discussed shortest distinguishing sequences generated from a class of extended finite state machines.  ... 
doi:10.1016/j.jlap.2009.02.010 fatcat:o4gguzoctfhu7grrhtofsb73da

Test Sequence Generation for Distributed Software System

Shuai Wang, Yindong Ji, Shiyuan Yang
2011 Journal of Software  
Index Terms-Distributed software, finite state machine net, output identifying sequence, extended unique input/output sequence, test case generation  ...  Applying the single finite state machine (FSM) test approach to distributed software, we will suffer from some problems: 1) the state combinatorial explosion problem; 2) some unexecutable test cases may  ...  set of component finite state machines; 2) , { : , } ij C c i j n i j     is the set of finite channel finite state machine, and , ij c is the channel FSM between software component  ... 
doi:10.4304/jsw.6.2.175-183 fatcat:rqtys7xzonexfle4rahd6zxi6q

Construction of global finite state machine for testing task interactions written in message sequence charts

Nam Hee Lee, Tai Hyo Kim, Sung Deok Cha
2002 Proceedings of the 14th international conference on Software engineering and knowledge engineering - SEKE '02  
Integration testing of embedded software is difficult because such software tends to be large and complex; it is often structured as a set of tasks whose interaction patterns can be arbitrary and nondeterministic  ...  In order to conduct integration testing in a cost-effective manner, it is essential that requirements are captured in precise notation and that test cases are automatically generated and executed whenever  ...  In this paper, we demonstrate how to generate test cases from a set of Message Sequence Charts (MSCs) by constructing a semantically equivalent global finite state machine (GFSM).  ... 
doi:10.1145/568823.568825 fatcat:jryf6el5n5bllkxtlfuauwfhgy

Construction of global finite state machine for testing task interactions written in message sequence charts

Nam Hee Lee, Tai Hyo Kim, Sung Deok Cha
2002 Proceedings of the 14th international conference on Software engineering and knowledge engineering - SEKE '02  
Integration testing of embedded software is difficult because such software tends to be large and complex; it is often structured as a set of tasks whose interaction patterns can be arbitrary and nondeterministic  ...  In order to conduct integration testing in a cost-effective manner, it is essential that requirements are captured in precise notation and that test cases are automatically generated and executed whenever  ...  In this paper, we demonstrate how to generate test cases from a set of Message Sequence Charts (MSCs) by constructing a semantically equivalent global finite state machine (GFSM).  ... 
doi:10.1145/568760.568825 dblp:conf/seke/LeeKC02 fatcat:c4ae2atan5gldegkp4ywfefeki

Adaptation Of State/Transition-Based Methods For Embedded System Testing

Abdelaziz Guerrouat, Harald Richter
2007 Zenodo  
In this paper test generation methods and appropriate fault models for testing and analysis of embedded systems described as (extended) finite state machines ((E)FSMs) are presented.  ...  in the design of hardware and software systems.  ...  In this paper, we present a testing approach and potential test generation methods that could be reused for embedded systems modelled as 'extended' finite state machines.  ... 
doi:10.5281/zenodo.1076155 fatcat:hd2aslimf5boxggf6aphtwvagu

A component-based specification approach for embedded systems using FDTs

Abdelaziz Guerrouat, Harald Richter
2006 Software engineering notes  
FDTs such as Estelle and SDL are based on EFSMs (Extended finite State Machines) and have been widely used in the automation of the development process of protocols and communicating systems, i.e. for  ...  This paper presents a framework for specification and testing of component-based embedded systems using formal description techniques (FDTs).  ...  Figure 1 . 1 Main components of an embedded system Definition 1 A 1 predicated extended finite state machine (p-EFSM) is an 8-tuple <S, C, I, P, O, T, s 0 , c 0 > where S is a nonempty set of main states  ... 
doi:10.1145/1118537.1123073 fatcat:qmfxxfsqnfbqfnoz6i77iomh3u

Learning Parameterized State Machine Model for Integration Testing

Muzammil Shahbaz, Keqin Li, Roland Groz
2007 Computer Software and Applications Conference (COMPSAC) Proceedings of the IEEE International  
Our model is an extension of finite state machines that incorporates the notions of predicates and parameters on transitions.  ...  We have been able to extend polynomial learning algorithms to extract such models in an incremental testing approach. In turn, the models can be used to derive tests or for component documentation.  ...  It is hard to obtain fully accurate models in the form of, e.g., EFSM (Extended Finite State Machines) [16, 15] and ASM (Abstract State Machines) [5] , from a black box component.  ... 
doi:10.1109/compsac.2007.134 dblp:conf/compsac/ShahbazLG07 fatcat:no3vhetupre4ngfib6igzy6nie

A component-based specification approach for embedded systems using FDTs

Abdelaziz Guerrouat, Harald Richter
2005 Proceedings of the 2005 conference on Specification and verification of component-based systems - SAVCBS '05  
FDTs such as Estelle and SDL are based on EFSMs (Extended finite State Machines) and have been widely used in the automation of the development process of protocols and communicating systems, i.e. for  ...  This paper presents a framework for specification and testing of component-based embedded systems using formal description techniques (FDTs).  ...  Figure 1 . 1 Main components of an embedded system Definition 1 A 1 predicated extended finite state machine (p-EFSM) is an 8-tuple <S, C, I, P, O, T, s 0 , c 0 > where S is a nonempty set of main states  ... 
doi:10.1145/1123058.1123073 fatcat:6xxhp3m2eff7tpo5jcfn6xo3m4

Automatic generation of software behavioral models

Davide Lorenzoli, Leonardo Mariani, Mauro Pezzè
2008 Proceedings of the 13th international conference on Software engineering - ICSE '08  
usually in the form of finite state machines.  ...  In this paper, we focus on the generation of models of relations between data values and component interactions, and we present GK-tail, a technique to automatically generate extended finite state machines  ...  EXTENDED FINITE STATE MACHINES In this section, we introduce models for interaction traces and extended finite state machines.  ... 
doi:10.1145/1368088.1368157 dblp:conf/icse/LorenzoliMP08 fatcat:vl63xwxyfjcyjg4un5nrmdwiru

Extending Stream X-machines with Probability Intervals to Test Web Software

Qian Zhongsheng
2016 International Journal of Hybrid Information Technology  
The essential purpose of testing is to detect and remove faults in the implementation of a system.  ...  The PSXM, which is an extended SXM with the transitions enhanced with probability intervals, is capable of describing both the data and the control aspects of a given system.  ...  Introduction Web softwares [1] [2] [3] are sophisticated, interactive systems with complicated GUIs and numerous backend software components that are integrated in fire-new and unusual ways.  ... 
doi:10.14257/ijhit.2016.9.4.22 fatcat:jfqz33scpndyzezib3r6qcyx2u

Generating test sequences from a set of MSCs

Nam Hee Lee, Sung Deok Cha
2003 Computer Networks  
We propose an approach to generate test cases from a set of Message Sequence Charts (MSCs) by constructing a semantically equivalent finite state machine for testing reactive and embedded software.  ...  Test cases are expressed as a sequence of messages to be exchanged among various system entities.  ...  We propose an approach to construct a global system behavior (Global Finite State Machine--GFSM) from a set of MSCs, and generate test sequences from the GFSM using two test selection criteria.  ... 
doi:10.1016/s1389-1286(03)00250-0 fatcat:aguy6hqwsfbthloornvzvzage4

Method of analysing extended finite-state machine specifications

Behçet Sarikaya, Vassilios Koukoulidis, Gregor V Bochmann
1990 Computer Communications  
The technique is first applied to the specifications in a nondeterministic finite-state machine model and then applied to an extended finite-state machine model for which two standard formal description  ...  develop a technique for self-consistency analysis of complex protocol/service specifications Formal specifications are the basis for automated verification and implementation in communication software.  ...  This research was supported in part by the Natural Sciences and Engineering Research Council of Canada.  ... 
doi:10.1016/0140-3664(90)90175-g fatcat:l754tuprkvceljx5eofrxaewci

Towards testable communication software [chapter]

R. Dssouli, K. Karoui, A. Petrenko, O. Rafiq
1996 Protocol Test Systems VIII  
In the second part, we address one particular problem of DFT, the problem of analyzing the testability of a given module specified as a finite state machine.  ...  Design For Testability (DFT) is understood as the process of introducing some features into a communication software that facilitate the testing process of protocol implementations.  ...  In particular, consider the partially specified finite state machine (PFSM) model, and a testing strategy based on state identification.  ... 
doi:10.1007/978-0-387-34988-6_15 fatcat:mq5gfl2l3rcurkg4geqyblansy
« Previous Showing results 1 — 15 out of 59,555 results