Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
From MaRDI portal
Publication:5458318
Recommendations
Cites work
- scientific article; zbMATH DE number 1979541 (Why is no real title available?)
- Algorithmic analysis of programs with well quasi-ordered domains.
- Formal verification of standards for distance vector routing protocols
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Static Analysis of Dynamic Communication Systems by Partner Abstraction
- Tools and Algorithms for the Construction and Analysis of Systems
- Verifying programs with unreliable channels
Cited in
(14)- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
- On the Verification of Timed Ad Hoc Networks
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Sound and complete abstract graph transformation
- Analysing routing protocols: four nodes topologies are sufficient
- Liveness in broadcast networks
- A mechanized proof of loop freedom of the (untimed) AODV routing protocol
- Parameterized verification of time-sensitive models of ad hoc network protocols
- The Edge of Graph Transformation — Graphs for Behavioural Specification
- Well-structured graph transformation systems
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Formal verification of standards for distance vector routing protocols
- Automatic Verification of Directory-Based Consistency Protocols
- Modeling and efficient verification of wireless ad hoc networks
This page was built for publication: Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458318)