SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "id:"swepub:oai:DiVA.org:uu-15913" "

Search: id:"swepub:oai:DiVA.org:uu-15913"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Saksena, Mayank, et al. (author)
  • Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols : (Extended Version)
  • 2007
  • Reports (other academic/artistic)abstract
    • We present a technique for modeling and automatic verification of network protocols, based on graph transformation. It is suitable for protocols with a potentially unbounded number of nodes, in which the structure and topology of the network is a central aspect, such as routing protocols for ad hoc networks. Safety properties are specified as a set of undesirable global configurations. We verify that there is no undesirable configuration which is reachable from an initial configuration, by means of symbolic backward reachability analysis.In general, the reachability problem is undecidable. We implement the technique in a graph grammar analysis tool, and automatically verify several interesting nontrivial examples. Notably, we prove loop freedom for the DYMO ad hoc routing protocol. DYMO is currently on the IETF standards track, to potentially become an Internet standard.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
reports (1)
Type of content
other academic/artistic (1)
Author/Editor
Jonsson, Bengt (1)
Saksena, Mayank (1)
Wibling, Oskar (1)
University
Uppsala University (1)
Language
English (1)
Year
2007 (1)

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view