Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

C. Basaran

dblp:177/8745 · DBLP profile ↗
← Back
1ranked-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 · 1

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.

Computer networks
1 paper
Network management and operations · 100%
Software engineering, system software, and programming languages
1 paper
Software testing · 100%
Theoretical computer science
1 paper
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Network management and operations › network testing
protocol conformance testing
0.011994
Automated generation of protocol test sequences from formal specifications · ICNP 1994
Network management and operations › network testing › protocol conformance testing
test sequence generation
0.011994
Automated generation of protocol test sequences from formal specifications · ICNP 1994
Software testing
test generation
0.011994
Automated generation of protocol test sequences from formal specifications · ICNP 1994
Automata and formal languages
finite automata
0.011994
Automated generation of protocol test sequences from formal specifications · ICNP 1994
Automata and formal languages
protocol specification
0.011994
Automated generation of protocol test sequences from formal specifications · ICNP 1994

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

path enumeration · 0.0formal specification · 0.0
YearPublicationVenuePosition
1994 Automated generation of protocol test sequences from formal specifications
abstract
A program which takes as input the formal specification of a protocol using the formal model systems of communicating machines, and outputs a sequence of tests for an implementation of the protocol is discussed. The protocol is specified formally as a finite state machine with local and shared variables. The test program, called TESTGEN, finds all paths which may be taken through the FSM and generates a sequence of tests to check all these paths. Certain possible error conditions or difficult to test conditions are also detected by the program, and the test designer receives a warning message. The program is applied to a formal specification of the CSMA/CD and FDDI protocols, generating a test sequence for both of these protocols.>
Gilbert M. Lundy, C. Basaran
ICNP2