Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols

DOI10.1007/978-3-540-78800-3_3MaRDI QIDQ5458318zbMATH OpenOpenAlexFDO

Authors Mayank Saksena, Oskar Wibling, Bengt Jonsson

Publication date 11 April 2008

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78800-3_3

Mathematics Subject Classification ID

Network protocols (68M12) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Modeling and verifying ad hoc routing protocols
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Modeling Routing Protocols in Adhoc Networks
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Query-Based Model Checking of Ad Hoc Network Protocols

Cites work

• 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
• scientific article; zbMATH DE number 1979541 (Why is no real title available?)
• 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

(15)

• Modeling and efficient verification of wireless ad hoc networks
• Liveness in broadcast networks
• Analysing routing protocols: four nodes topologies are sufficient
• The Edge of Graph Transformation — Graphs for Behavioural Specification
• Sound and complete abstract graph transformation
• On the Verification of Timed Ad Hoc Networks
• Formal verification of standards for distance vector routing protocols
• A mechanized proof of loop freedom of the (untimed) AODV routing protocol
• Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
• Automatic Verification of Directory-Based Consistency Protocols
• Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Formal methods for mobile ad hoc networks: a survey
• Well-structured graph transformation systems
• Parameterized verification of time-sensitive models of ad hoc network protocols

Describes a project that uses

Uses Software

• HOL/SPIN
• SPIN
• GROOVE

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)