Executable EFSM-based data flow and control flow protocol test sequence generation using reachability analysis

This paper presents an executable Extended-Finite-State-Machine (EFSM)-based protocol test sequence generation method with specified variable bound. The proposed method overlaps data flow and control flow tests. In the data flow part, the transition paths that contain definition uses and output uses...

Full description

Saved in:
Bibliographic Details
Published inJournal of the Chinese Institute of Engineers Vol. 22; no. 5; pp. 593 - 615
Main Authors Huang, Chung-Ming, Jang, Ming-Yuhe, Lin, Yuan-Chuen
Format Journal Article
LanguageEnglish
Published Taylor & Francis Group 01.09.1999
Subjects
Online AccessGet full text
ISSN0253-3839
2158-7299
DOI10.1080/02533839.1999.9670497

Cover

Loading…
Abstract This paper presents an executable Extended-Finite-State-Machine (EFSM)-based protocol test sequence generation method with specified variable bound. The proposed method overlaps data flow and control flow tests. In the data flow part, the transition paths that contain definition uses and output uses of variables in the protocol specifications need to be detected and tested. An executable data flow test path, which is called an EDO-path, contains two parts: (1) a switching transition sequence that directs to a transition T containing a definition use of a variable V, and (2) a transition sequence originated from T, such that its head transition has a definition use of V and its tail transition contains either (i) an output use of V, or (ii) an output use of another variable which is affected by this definition use of V. In the control flow part, each transition must be tested as to whether it conforms to the original specification or not. An executable control flow test path, which is called an EC-path, for a transition T contains (1) a switching sequence that directs to the head state of T, (2) the transition T itself, and (3) the Unique Input/Output sequence of T's tail state, which verifies whether the tail state of T is correct or not. To shorten the length of the total test sequences, the proposed method overlaps the control flow test sequences with the data flow test sequences. That is, a test sequence may combine both control flow and data flow tests. The overlap is achieved as follows: when of searching EDO-paths, EC-paths are also searched in the same executable transition exploration sequences. If not all of the EC-paths are overlapped with EDO-paths, the remaining EC-paths are searched individually. Additionally, to provide flexible protocol conformance testing, protocol testers can specify some variable bound for their specific test purposes. That is, protocol testers can run tests they are interested in by specifying the associated variable bound in the protocol specification.
AbstractList This paper presents an executable Extended-Finite-State-Machine (EFSM)-based protocol test sequence generation method with specified variable bound. The proposed method overlaps data flow and control flow tests. In the data flow part, the transition paths that contain definition uses and output uses of variables in the protocol specifications need to be detected and tested. An executable data flow test path, which is called an EDO-path, contains two parts: (1) a switching transition sequence that directs to a transition T containing a definition use of a variable V, and (2) a transition sequence originated from T, such that its head transition has a definition use of V and its tail transition contains either (i) an output use of V, or (ii) an output use of another variable which is affected by this definition use of V. In the control flow part, each transition must be tested as to whether it conforms to the original specification or not. An executable control flow test path, which is called an EC-path, for a transition T contains (1) a switching sequence that directs to the head state of T, (2) the transition T itself, and (3) the Unique Input/Output sequence of T's tail state, which verifies whether the tail state of T is correct or not. To shorten the length of the total test sequences, the proposed method overlaps the control flow test sequences with the data flow test sequences. That is, a test sequence may combine both control flow and data flow tests. The overlap is achieved as follows: when of searching EDO-paths, EC-paths are also searched in the same executable transition exploration sequences. If not all of the EC-paths are overlapped with EDO-paths, the remaining EC-paths are searched individually. Additionally, to provide flexible protocol conformance testing, protocol testers can specify some variable bound for their specific test purposes. That is, protocol testers can run tests they are interested in by specifying the associated variable bound in the protocol specification.
This paper presents an executable Extended-Finite-State-Machine (EFSM)-based protocol test sequence generation method with specified variable bound. The proposed method overlaps data flow and control flow tests. In the data flow part, the transition paths that contain definition uses and output uses of variables in the protocol specifications need to be detected and tested. An executable data flow test path, which is called an EDO-path, contains two parts: (1) a switching transition sequence that directs to a transition T containing a definition use of a variable V, and (2) a transition sequence originated from T, such that its head transition has a definition use of V and its tail transition contains either (i) an output use of V, or (ii) an output use of another variable which is affected by this definition use of V. In the control flow part, each transition must be tested as to whether it conforms to the original specification or not. An executable control flow test path, which is called an EC-path, for a transition T contains (1) a switching sequence that directs to the head state of T, (2) the transition T itself, and (3) the Unique Input/Output sequence of T's tail state, which verifies whether the tail state of T is correct or not. To shorten the length of the total test sequences, the proposed method overlaps the control flow test sequences with the data flow test sequences. That is, a test sequence may combine both control flow and data flow tests. The overlap is achieved as follows: when searching EDO-paths, EC-paths are also searched in the same executable transition exploration sequences. If not all of the EC-paths are overlapped with EDO-paths, the remaining EC-paths are searched individually. (Author)
Author Jang, Ming-Yuhe
Lin, Yuan-Chuen
Huang, Chung-Ming
Author_xml – sequence: 1
  givenname: Chung-Ming
  surname: Huang
  fullname: Huang, Chung-Ming
  organization: Department of Computer Science and Information Engineering , National Cheng Kung University
– sequence: 2
  givenname: Ming-Yuhe
  surname: Jang
  fullname: Jang, Ming-Yuhe
  organization: Department of Computer Science and Information Engineering , National Cheng Kung University
– sequence: 3
  givenname: Yuan-Chuen
  surname: Lin
  fullname: Lin, Yuan-Chuen
  organization: Department of Computer Science and Information Engineering , National Cheng Kung University
BookMark eNqFkMtOHDEQRa0IpAyQT4jkFbse3Ha73RabRGh4SKAsIGur2l0mjjw2sT2C-fv0MGTDIqzqoXuvqs4ROYgpIiFfW7Zs2cDOGJdCDEIvW631UveKdVp9IgveyqFRXOsDsthpmp3oMzkq5TdjvJe8XZC4ekG7qTAGpKvL-7tmhIITnaACdSE9U4gTtSnWnMJ-8ZRTTXaeKpZKC_7ZYLRIHzFihupTpJvi4yPNCPYXjD74up1TIGyLLyfk0EEo-OWtHpOfl6uHi-vm9sfVzcX328YKoWuDzKFmXa-t6uSoYVLCDUwNrRJM2k7O7YgT2s5Zp1g_CN7pTveTBHSynbg4Jqf73Pna-cBSzdoXiyFAxLQphivOtOjlLDzfC21OpWR0xvr6-kbN4INpmdkxNv8Ymx1j88Z4dst37qfs15C3H_q-7X0-upTX8JxymEyFbUjZZYjWFyP-H_EXQgaXKQ
CitedBy_id crossref_primary_10_1016_j_infsof_2022_107114
crossref_primary_10_1016_j_infsof_2021_106557
crossref_primary_10_1016_j_eswa_2024_124768
crossref_primary_10_1109_ACCESS_2021_3053163
crossref_primary_10_1016_j_ins_2016_07_059
crossref_primary_10_1142_S0218194015300018
Cites_doi 10.1109/TSE.1978.231496
10.1007/BF01976186
10.1109/26.81739
10.1007/978-0-387-34883-4_15
10.1109/INFCOM.1993.253243
10.1016/B978-0-444-89874-6.50008-8
10.1109/TSE.1985.232226
10.1109/26.111442
10.1109/12.272431
10.1016/B978-0-444-89874-6.50009-X
10.1145/99517.99543
10.1109/TSE.1987.233197
10.1109/90.649519
10.1109/90.234857
10.1109/32.87284
10.1016/0169-7552(88)90064-5
10.1109/INFCOM.1996.493058
ContentType Journal Article
Copyright Copyright Taylor & Francis Group, LLC 1999
Copyright_xml – notice: Copyright Taylor & Francis Group, LLC 1999
DBID AAYXX
CITATION
8FD
H8D
L7M
DOI 10.1080/02533839.1999.9670497
DatabaseName CrossRef
Technology Research Database
Aerospace Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Aerospace Database
Advanced Technologies Database with Aerospace
DatabaseTitleList
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2158-7299
EndPage 615
ExternalDocumentID 10_1080_02533839_1999_9670497
9670497
GroupedDBID -~X
.7F
.QJ
0BK
0R~
30N
4.4
5GY
AAENE
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABLIJ
ABPAQ
ABPEM
ABTAI
ABXUL
ABXYU
ACGFS
ACTIO
ACTTO
ADCVX
ADGTB
AEISY
AENEX
AEOZL
AFBWG
AFION
AGDLA
AGMYJ
AGVKY
AGWUF
AHDZW
AIJEM
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
ALRRR
AQRUH
AVBZW
BLEHA
BWMZZ
CCCUG
CYRSC
DAOYK
DGEBU
DKSSO
EBS
EJD
E~A
E~B
FRP
GTTXZ
H13
HZ~
KYCEM
M4Z
NA5
NX~
O9-
OPCYK
RNANH
ROSJB
RTWRZ
S-T
SNACF
TAJZE
TBQAZ
TDBHL
TEN
TFL
TFT
TFW
TTHFI
TUROJ
UT5
UU3
ZGOLN
~S~
07I
8RM
AAGDL
AAHIA
AAYXX
ADMLS
ADUMR
ADXEU
ADYSH
AEHZU
AEZBV
AFRVT
AIYEW
AKHJE
AKMBP
ALXIB
AMPGV
BGSSV
C0-
CITATION
DEXXA
FETWF
HF~
H~P
IFELN
J.P
LJTGL
RIG
UB6
8FD
H8D
L7M
TASJS
ID FETCH-LOGICAL-c339t-e0fe90469c745b9ad73f807817305c45078bedec4fcf70683249496d5aef51d23
ISSN 0253-3839
IngestDate Fri Sep 05 07:25:23 EDT 2025
Sun Jul 06 05:05:20 EDT 2025
Thu Apr 24 23:06:49 EDT 2025
Wed Dec 25 09:05:36 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c339t-e0fe90469c745b9ad73f807817305c45078bedec4fcf70683249496d5aef51d23
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 27209365
PQPubID 23500
PageCount 23
ParticipantIDs proquest_miscellaneous_27209365
crossref_citationtrail_10_1080_02533839_1999_9670497
crossref_primary_10_1080_02533839_1999_9670497
informaworld_taylorfrancis_310_1080_02533839_1999_9670497
PublicationCentury 1900
PublicationDate 1999-09-01
PublicationDateYYYYMMDD 1999-09-01
PublicationDate_xml – month: 09
  year: 1999
  text: 1999-09-01
  day: 01
PublicationDecade 1990
PublicationTitle Journal of the Chinese Institute of Engineers
PublicationYear 1999
Publisher Taylor & Francis Group
Publisher_xml – name: Taylor & Francis Group
References CIT0010
CIT0020
CIT0001
CIT0012
CIT0023
CIT0011
CIT0022
Uyar M.U. (CIT0021) 1986
CIT0003
CIT0014
CIT0002
CIT0013
CIT0024
CIT0005
CIT0016
CIT0004
CIT0015
Huang C.M. (CIT0006) 1995
CIT0007
CIT0018
CIT0017
CIT0009
CIT0008
CIT0019
References_xml – ident: CIT0003
  doi: 10.1109/TSE.1978.231496
– start-page: 68
  year: 1986
  ident: CIT0021
  publication-title: Proc. of IEEE GlobeCOM
– ident: CIT0005
  doi: 10.1007/BF01976186
– start-page: 29
  year: 1995
  ident: CIT0006
  publication-title: IFIP Transactions C: Communication Systems ‐ protocol Test Systems
– ident: CIT0014
– ident: CIT0013
– ident: CIT0010
– ident: CIT0019
  doi: 10.1109/26.81739
– ident: CIT0009
  doi: 10.1007/978-0-387-34883-4_15
– ident: CIT0002
  doi: 10.1109/INFCOM.1993.253243
– ident: CIT0011
  doi: 10.1016/B978-0-444-89874-6.50008-8
– ident: CIT0016
  doi: 10.1109/TSE.1985.232226
– ident: CIT0001
  doi: 10.1109/26.111442
– ident: CIT0008
  doi: 10.1109/12.272431
– ident: CIT0022
  doi: 10.1016/B978-0-444-89874-6.50009-X
– ident: CIT0024
  doi: 10.1145/99517.99543
– ident: CIT0018
  doi: 10.1109/TSE.1987.233197
– ident: CIT0007
– ident: CIT0012
  doi: 10.1109/90.649519
– ident: CIT0020
  doi: 10.1109/90.234857
– ident: CIT0023
– ident: CIT0004
  doi: 10.1109/32.87284
– ident: CIT0017
  doi: 10.1016/0169-7552(88)90064-5
– ident: CIT0015
  doi: 10.1109/INFCOM.1996.493058
SSID ssj0026521
ssj0001654702
ssib009799642
ssib007483796
ssib021433493
ssib042110807
ssib000592223
ssib023166941
ssib019564629
ssib008501881
ssib019759036
ssib023656839
ssib000992112
ssib005906577
Score 1.515179
Snippet This paper presents an executable Extended-Finite-State-Machine (EFSM)-based protocol test sequence generation method with specified variable bound. The...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 593
SubjectTerms control flow test
data flow test
extended finite state machines (EFSMs)
protocol test
Title Executable EFSM-based data flow and control flow protocol test sequence generation using reachability analysis
URI https://www.tandfonline.com/doi/abs/10.1080/02533839.1999.9670497
https://www.proquest.com/docview/27209365
Volume 22
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9swDBay9LIdhj2x7qnDboECv2RZx6JLEQzLLkuxdhfDliX0UDhDY2NF_8z-6khJfgTp0D0uhkFDFiJ-JimF_EjI-ypOhFAqYCozsEGplGJFpgqmyqqUaZgW0vaMXH1Ol6fJxzN-Npn8HGUttU05Vze31pX8i1ZBBnrFKtm_0Gz_UhDAPegXrqBhuP6RjhfXWrWNLX5anHxZMXRJ1QyTPmfmcvPD16y5XHQrQFaGDah-BgFmM-vSqLGNsvZIaO3ZwRXmWDoGb-Rncrwlv4ljMXLFLtx6q3dTDzqqw-0AHX84fXwBJoatOq9pS_3dE5Sx8_aih9snx3FwDkMZDPOFa5Wv2xvysByw1nsdQ0aHa87cRTxmsF92BlRbGcQjGTbblWN7HUUjXPKR8eWu16L346krE91zET6nEmbDybBaU85lKmCnJAaf2Gcq-if3yEEE-5BgSg6Olh--fR2O8bB5c9AzlkUpt6V-_Y_pisaQzv22KXfCoR2y3L3gwEY860fkoVcxPXK4e0wmun5CHowILJ-SekAgHRBIEYEUAUcBgdQj0Ak6BFJEIO0QSAcEUotAOkYg7RD4jJyeLNbHS-Y7eDAVx7JhOjBa4gmMEgkvZVGJ2GCDgxD8ClcJ7EWyUldaJUYZEaTgXZAsKa14oQ0Pqyh-Tqb1ptYvCJUiM3FZCJ6EGQSdRVkU3IRax1pVgof6kCTdQubK09tjl5XLPOxYcP3657j-uV__QzLvh313_C53DZBjLeWNBbZxmM7jO8a-61SagxXHv-aKWm_abY7ZEDJO-cv_ePsrcn_48F6TaXPV6jcQMTflW4_aXwohvf0
linkProvider Library Specific Holdings
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwELZ4DMDAG_HGA2tKguO4HhFqVR7tAkhslnO2GahSBKl4_Hp8cQIFhBjYoki-yM75HvZ33xFyaFgqBEAcQdv5BMUARLoNOoLc5DJLMi2rnpH9Qda7Sc9v-e1ELQzCKjGHdoEoorLVuLnxMLqBxB15P42ZlcRSO9mSmfBhrpgmsxwfsYwjHnyes2B33fiDUuo441UtFoqIUEZT1fOb2C_-6gub6Q_rXbmk7hKBZjIBiXLfGpd5C96-8Tz-b7bLZLGOWOlJULEVMmWLVbIwwWO4RorOi4VxiVVYtNO96kfoGw1F9Cl1w9Ez9R-nNSg-vEB6iJHXQeoj3ZI2eG56V5Fgo65QBOTf0UcEewYq8VcvJRCorJObbuf6tBfVjRwiYEyWkY2dlZiIg0h5LrURzCHPfeLNC4fUh6Tt3BoLqQMn4swbGeTMyQzX1vHEHLMNMlOMCrtJqE96Hcu14KlPTROuc625S6xlFozgid0iafO7FNQs59hsY6iShgy1Xk6Fy6nq5dwirY9hD4Hm468BclIXVFmdr7jQDEWxP8YeNIqj_GbGGxpd2NH4SeGluGQZ3_6H9AMy17vuX6rLs8HFDpkPNBOIidslM-Xj2O75IKrM96td8g55jw5L
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JS8QwFA4uIHpwF3dz8NqxNU0yOYrO4DoIKngLWT0oHZnp4PLrzWtaV8SD10JeSPryluR730No15Kcc2PSxLR9SFCsMYlqG5UYbbVgGVOi6hl50WPHN_npLW3QhMMaVgk5tI9EEZWthsP9aH2DiNsLbhoSKwGVdqIlGA9RLh9HkyyEJ6DYJO19XLNAc930nVFqn9GqFAtEJCCjKer5TewXd_WFzPSH8a48UncO6WYtEYhy3xqVumVev9E8_mux82i2jlfxQVSwBTTmikU084nFcAkVnWdnRiXUYOFO9-oiAc9oMWBPsX_oP-EwN64h8fEDkEP0gwbiEOeWuEFz47uKAhs0BQMc_w4PAOoZicRfgpRIn7KMbrqd68PjpG7jkBhCRJm41DsBabjhOdVCWU48sNxnwbhQk4eAtK2ddSb3xvOUBRMDjDnMUuU8zew-WUETRb9wqwiHlNcTrTjNQ2KaUaWVoj5zjjhjOc3cGsqbvyVNzXEOrTYeZNZQodbbKWE7Zb2da6j1Puwxknz8NUB8VgVZVrcrPrZCkeSPsTuN3shwlOF9RhWuPxpKeBIXhNH1f0jfQVOXR115ftI720DTkWMCAHGbaKIcjNxWiKBKvV2dkTcwoAz4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Executable+EFSM-based+data+flow+and+control+flow+protocol+test+sequence+generation+using+reachability+analysis&rft.jtitle=Journal+of+the+Chinese+Institute+of+Engineers&rft.au=Huang%2C+Chung-Ming&rft.au=Jang%2C+Ming-Yuhe&rft.au=Lin%2C+Yuan-Chuen&rft.date=1999-09-01&rft.pub=Taylor+%26+Francis+Group&rft.issn=0253-3839&rft.eissn=2158-7299&rft.volume=22&rft.issue=5&rft.spage=593&rft.epage=615&rft_id=info:doi/10.1080%2F02533839.1999.9670497&rft.externalDocID=9670497
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0253-3839&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0253-3839&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0253-3839&client=summon