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. A simulation from public publication records: the people listed were not invited and did not agree to review.

Jadranka Alilovic-Curgus

dblp:38/2789 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Computer networks · 1 · 1 first-author

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
Internet architecture and protocols · 56% Network management and operations · 44%

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

TopicWeightPapersLastEvidence papers
Network management and operations › network testing
interoperability testing
0.011993
A framework for interoperability testing of network protocols · ICNP 1993
Internet architecture and protocols › protocol engineering
protocol testing
0.011993
A framework for interoperability testing of network protocols · ICNP 1993
Internet architecture and protocols
protocol specification
0.011993
A framework for interoperability testing of network protocols · ICNP 1993

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

labeled transition systems · 0.0formal specification · 0.0
YearPublicationVenuePosition
1993 A framework for interoperability testing of network protocols
abstract
The authors extend the testing theory based on formal specifications by formalizing testing for interoperability with a new relation, intop. Intuitively, P intop Q if, for every event offered by either P or Q, the concurrent execution of P and Q will be able to proceed with the traces in S, where S is their (common) specification. This theory is applicable to formal description methods that allow a semantic interpretation of specifications in terms of labeled transition systems. Some existing notions of implementation relations in protocol testing theory are placed in this framework and their discriminating power for identifying processes which will interoperate is examined. As an example, a subset of the ST-II protocol is formally specified and its possible implementations are shown to interoperate if each implementation satisfies the intop relation with respect to S, the specification of the ST-II protocol (subset).>
Jadranka Alilovic-Curgus, Son T. Vuong
ICNP1