Verisim: Formal Analysis of Network Simulations

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
Verisim
formal analysis
network
simulation
testing
routing
NS
MaC
AODV
temporal logic
ad hoc networks
packet radio
tuning
population abstraction
packet-type abstraction
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Bhargavan, Karthikeyan
Gunter, Carl A.
Kim, Moonjoo
Obradovic, Davor
Viswanathan, Mahesh
Contributor
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 NS 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.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2002-02-01
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Copyright 2002 IEEE. Reprinted from <i>IEEE Transactions on Software Engineering</i>, Volume 28, Issue 2, February 2002, pages 129-145.<br> Publisher URL: <a href="http://ieeexplore.ieee.org/xpl/tocresult.jsp?isNumber=21282&puNumber=32" >http://ieeexplore.ieee.org/xpl/tocresult.jsp?isNumber=21282&puNumber=32</a> <br><br> This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.<br><br> An earlier, conference version of this paper may be found at <a href="http://repository.upenn.edu/cis_papers/84/" >http://repository.upenn.edu/cis_papers/84/</a>.
<br>Copyright 2002 IEEE. Reprinted from <i>IEEE Transactions on Software Engineering</i>, Volume 28, Issue 2, February 2002, pages 129-145.<br> Publisher URL: http://ieeexplore.ieee.org/xpl/tocresult.jsp?isNumber=21282&puNumber=32 <br><br> This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.<br><br> An earlier, conference version of this paper may be found at http://repository.upenn.edu/cis_papers/84/. <br><p>
Recommended citation
Collection