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

Davor Obradovic

dblp:15/4435 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2002
—ORCID · none

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

Software engineering, systems software and programming languages · 2Computer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
4 papers
Routing and switching · 64% Network management and operations · 28% Network measurement and analytics · 7%
Software engineering, system software, and programming languages
3 papers
Program verification · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › inter-domain routing › BGP
BGP convergence
0.012002
Real-time Model and Convergence Time of BGP · INFOCOM 2002
Routing and switching › routing protocol
distance-vector routing
0.012002
Formal verification of standards for distance vector routing protocols · J. ACM 2002
Routing and switching
inter-domain routing
0.012002
Real-time Model and Convergence Time of BGP · INFOCOM 2002
Network management and operations
network verification
0.012002
Verisim: Formal Analysis of Network Simulations · IEEE Trans. Software Eng. 2002
Routing and switching
routing policy
0.012002
Real-time Model and Convergence Time of BGP · INFOCOM 2002
Network management and operations › protocol verification
routing protocol verification
0.012002
Formal verification of standards for distance vector routing protocols · J. ACM 2002
Program verification
model checking
0.012002
Formal verification of standards for distance vector routing protocols · J. ACM 2002
Program verification
proof assistants
0.012002
Formal verification of standards for distance vector routing protocols · J. ACM 2002
Program verification
temporal logic verification
0.012002
Verisim: Formal Analysis of Network Simulations · IEEE Trans. Software Eng. 2002
Performance modeling and evaluation › simulation › communication system simulation
network simulation
0.012000
Verisim: Formal analysis of network simulations · ISSTA 2000
Performance modeling and evaluation
simulation
0.012000
Verisim: Formal analysis of network simulations · ISSTA 2000
Routing and switching
ad hoc network routing
0.012002
Verisim: Formal Analysis of Network Simulations · IEEE Trans. Software Eng. 2002
Routing and switching › wireless routing
AODV
0.012002
Verisim: Formal Analysis of Network Simulations · IEEE Trans. Software Eng. 2002

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

simulation · 0.1formal analysis · 0.1simulation-based monitoring · 0.1model checking · 0.1linear temporal logic · 0.1interactive theorem proving · 0.1SPIN · 0.1HOL · 0.1real-time modeling · 0.0fixed-point analysis · 0.0
YearPublicationVenuePosition
2002 Real-time Model and Convergence Time of BGP
abstract
BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time model of BGP. We then state and prove a general theorem providing an upper bound on convergence time. Finally, we show how to the use the theorem to prove convergence and estimate convergence time in three case studies.
Davor Obradovic
INFOCOM1
2002 Formal verification of standards for distance vector routing protocols
abstract
We show how to use an interactive theorem prover, HOL, together with a model checker, SPIN, to prove key properties of distance vector routing protocols. We do three case studies: correctness of the RIP standard, a sharp real-time bound on RIP stability, and preservation of loop-freedom in AODV, a distance vector protocol for wireless networks. We develop verification techniques suited to routing protocols generally. These case studies show significant benefits from automated support in reduced verification workload and assistance in finding new insights and gaps for standard specifications.
Karthikeyan Bhargavan, Davor Obradovic, Carl A. Gunter
J. ACM2
2002 Verisim: Formal Analysis of Network Simulations
abstract
Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces in an extended form of linear temporal logic. Our technique uses the INS simulator together with a component of the MaC system to provide a uniform framework. We demonstrate its effectiveness by analyzing simulations of the ad hoc on-demand distance vector (AODV) routing protocol for packet radio networks. Our analysis finds violations of significant properties and we discuss the faults that cause them. Novel aspects of our approach include modest integration costs with other simulation objectives such as performance evaluation, greatly increased flexibility in specifying properties to be checked and techniques for analyzing complex traces of alarms raised by the monitoring software.
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim 0001, Insup Lee 0001, Davor Obradovic, Oleg Sokolsky, Mahesh Viswanathan 0001
IEEE Trans. Software Eng.5
2000 Verisim: Formal analysis of network simulations
abstract
Why are there so few successful "real-world" programming and testing tools based on academic research? This talk focuses on program analysis tools, and proposes a surprisingly simple explanation with interesting ramifications.
Karthikeyan Bhargavan, Carl A. Gunter, Moonjoo Kim 0001, Insup Lee 0001, Davor Obradovic, Oleg Sokolsky, Mahesh Viswanathan 0001
ISSTA5