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.
? Tutorial for this page

Pradeep Jain

dblp:00/2041 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 1991
0000-0001-7962-8199ORCID · corroborated

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

Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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
3 papers
Internet architecture and protocols · 37% Wireless networking · 35% Network management and operations · 28%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 50% Electronic design automation · 50%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking
multiple access protocols
0.021988
Specification and verification of collusion-free broadcast networks · SIGCOMM 1988
Modeling and Verification of Real-Time Protocols for Broadcast Networks · IEEE Trans. Software Eng. 1987
Internet architecture and protocols
protocol specification
0.011991
Specification of Real-Time Broadcast Networks · IEEE Trans. Computers 1991
Network management and operations
protocol verification
0.021991
Specification and verification of collusion-free broadcast networks · SIGCOMM 1988
Specification of Real-Time Broadcast Networks · IEEE Trans. Computers 1991
Internet architecture and protocols › local area network
bus network
0.011991
Specification of Real-Time Broadcast Networks · IEEE Trans. Computers 1991
Logic in computer science
formal methods
0.011988
Specification and verification of collusion-free broadcast networks · SIGCOMM 1988
Electronic design automation
formal methods
0.011987
Modeling and Verification of Real-Time Protocols for Broadcast Networks · IEEE Trans. Software Eng. 1987
Distributed systems › distributed system verification
protocol verification
0.011987
Modeling and Verification of Real-Time Protocols for Broadcast Networks · IEEE Trans. Software Eng. 1987

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

formal specification and verification · 0.0formal verification · 0.0
YearPublicationVenuePosition
1991 Specification of Real-Time Broadcast Networks
abstract
The authors present a model for specifying real-time protocols that execute on broadcast bus networks. Protocol entities interact by sending and receiving binary signals on buses. The actual propagation of these signals is captured in the proposed model by a set of channel axioms. Protocol entities are specified by sequential programs. The semantics of a set of programming constructs, including two level wait constructs, are defined. To illustrate the model and verification method, the authors present a specification of the Expressnet protocol which was designed for collision-free access to a unidirectional bus. A scenario in which collisions can occur in the original Expressnet was discovered. To guarantee collision-freedom, a modification to the protocol is given. The modified protocol is shown to be collision-free. A bound for its access delay is also derived.>
Pradeep Jain, Simon S. Lam
IEEE Trans. Computers1
1988 Specification and verification of collusion-free broadcast networks
abstract
For high-speed local area networks that offer integrated services for data, voice, and image traffic, a class of demand-assigned multiple-access protocols have been presented in the literature. These protocols exploit the directionality of signal propagation and enforce time constraints to achieve collision-freedom. A correct implementation of such a protocol requires a careful analysis of time-dependent interactions of event occurrences using a formal method. To date, most protocol verification methods are intended for the analysis of asynchronous communication over point-to-point channels.
Pradeep Jain, Simon S. Lam
SIGCOMM1
1987 Modeling and Verification of Real-Time Protocols for Broadcast Networks
abstract
A class of demand-assigned multiple-access (DAMA) protocols have been proposed for high-speed local area networks (LAN's) that offer integrated services for data, voice, video, and facsimile traffic. These protocols exploit the directionality of signal propagation and implement stringent real-time constraints to achieve collision-freedom. Correct implementation of DAMA protocols will require a very careful analysis of time-dependent interactions using a formal method. To date, most verification methods have been focused on asynchronous communication over point-to-point links.
Pradeep Jain, Simon S. Lam
IEEE Trans. Software Eng.1