Demo Data from SIGIR 2026 / reviewers in the wild / expert
T. Ramalingom
dblp:18/5893
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 2 first-authorSystems, architecture and hardware · 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
2 papers |
Network management and operations · 82% Internet architecture and protocols · 18% | |
| Theoretical computer science
2 papers |
Combinatorics and discrete mathematics · 46% Mathematical optimization · 46% Automata and formal languages · 8% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network management and operations › network testing › protocol conformance testing
test sequence generation |
0.0 | 2 | 2000 | A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols · IEEE Trans. Computers 2000 Context Independent Unique Sequences Generation for Protocol Testing · INFOCOM 1996 |
Network management and operations › network testing
protocol conformance testing |
0.0 | 1 | 2000 | A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols · IEEE Trans. Computers 2000 |
Mathematical optimization › combinatorial optimization › matroid constraint › matroid optimization
matroid intersection |
0.0 | 1 | 2000 | A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols · IEEE Trans. Computers 2000 |
Combinatorics and discrete mathematics
matroid theory |
0.0 | 1 | 2000 | A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication Protocols · IEEE Trans. Computers 2000 |
Internet architecture and protocols › protocol engineering
protocol testing |
0.0 | 1 | 1996 | Context Independent Unique Sequences Generation for Protocol Testing · INFOCOM 1996 |
Automata and formal languages › finite automata
extended finite state machines |
0.0 | 1 | 1996 | Context Independent Unique Sequences Generation for Protocol Testing · INFOCOM 1996 |
Methods — techniques the papers use, named apart from their topics
state identification · 0.0data flow testing · 0.0control flow testing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Context independent unique state identification sequences for testing communication protocols modelled as extended finite state machines
T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das |
Comput. Commun. | 1 |
| 2000 | A Matroid-Theoretic Solution to an Assignment Problem in the Conformance Testing of Communication ProtocolsabstractThe minimum length test sequence generation method proposed previously (1988) for conformance testing of a protocol uses Unique Input Sequences (UIS) for state identification. This method, called the U-method, requires that the test graph, a graph derived from the protocol, be connected. This requirement also needs to be satisfied in the case of the MU-method, which assumes that the multiple UISs are available for each state. Thus, the U-method and the MU-method may not provide minimum length test sequences in cases where the test graph is not connected. Nevertheless, these methods generate minimum length test sequences with high fault coverage whenever the test graph is connected. This raises an important problem: Does there exist an assignment of UISs to the transitions such that the resulting test graph is connected? In this paper, we formulate this problem as a maximum cardinality two matroid intersection problem and discuss an efficient algorithmic solution. We also point out the role of the work in the minimum length test sequence generation problem. T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das |
IEEE Trans. Computers | 1 |
| 1996 | Context Independent Unique Sequences Generation for Protocol TestingabstractA number of test sequence generation methods proposed for protocols represented as extended finite state machines (EFSMs) use state identification sequences for checking the states. However, neither a formal definition nor a method of computation of these sequences for an EFSM state is known. We define a new type of state identification sequence, called context independent unique sequence (CIUS) and present an algorithm for computing it. A unified method based on CIUSes is developed for automatically generating executable test cases for both control flow and data flow aspects of an EFSM. In control flow testing, CIUSes are very useful in confirming the tail state of the transitions. In data flow testing, CIUSes improve the observability of the test cases for the def-use associations of different variables used in the EFSM. Unlike general state identification sequences, the use of CIUSes does not increase the complexity of the already intractable feasibility problem in the test case generation. T. Ramalingom, Krishnaiyan Thulasiraman, Anindya Das |
INFOCOM | 1 |