Chun-Shi Chang 0002

dblp:15/2920-2 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Software testing · 100%
Computer networks
2 papers
Network management and operations · 77% Internet architecture and protocols · 23%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing › specification-based testing › conformance testing
protocol conformance testing
0.011994
Probabilistic testing of OSI protocols · IEEE Trans. Commun. 1994
Network management and operations › network testing
protocol conformance testing
0.011989
Probabilistic Testing of Protocols · SIGCOMM 1989
Network management and operations › network testing › protocol conformance testing
test sequence generation
0.011989
Probabilistic Testing of Protocols · SIGCOMM 1989
Software testing
protocol testing
0.011989
Probabilistic Testing of Protocols · SIGCOMM 1989

Methods — techniques the papers use, named apart from their topics

probabilistic verification · 0.0fault coverage analysis · 0.0probabilistic testing · 0.0
YearPublicationVenuePosition
1994 Probabilistic testing of OSI protocols
abstract
Protocols are large and complex software systems. Complete conformance testing of an implementation against its standard may not be feasible in terms of the resources available. This paper discusses a new approach, the P-method, to the testing of meaningful subsets of communication protocols for an asynchronous model of communication. The approach is based on the probabilistic verification of protocols, which is carried out on the more probable part of the protocol first. The technique can be used for generating probabilistic test sequences for the conformance testing of communication protocols to standards. The proposed method yields meaningful protocol test sequences which test the most probable behaviors of a protocol when the testing of the complete protocol is not feasible. Probabilistic test sequences can be categorized into different classes. The higher the class a probabilistic test sequence is in, the larger the extent of the protocol it covers, and the better is the fault coverage. If the class of a test sequence is high enough, its fault coverage is comparable to the fault coverage of test sequences generated by other methods. Results from a study of the P-method, using alternating bit protocol (ABP) and a subset of NBS TP4 as examples, support the claims above. It can also be shown that if errors are introduced only to the more probable part of the protocol, the fault coverage of P-method is also comparable to other methods.>
Deepinder P. Sidhu, Anthony Chung, Chun-Shi Chang 0002
IEEE Trans. Commun.3
1989 Probabilistic Testing of Protocols
abstract
Test sequences are used for the conformance testing of communication protocols to standards. This paper discusses a new approach to generating test sequences. The approach is based on probabilistic concepts about protocol state transitions and communication channels. The novel feature of the test sequences generated by this technique is that the most probable states of a protocol will be tested more promptly.
Deepinder P. Sidhu, Chun-Shi Chang 0002
SIGCOMM2