IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
Counter-Example Based Predicate Discovery in Predicate Abstraction
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Verifying Safety Properties of a Class of Infinite-State Distributed Algorithms
Proceedings of the 7th International Conference on Computer Aided Verification
On the Verification of Broadcast Protocols
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Symbolic invariant verification for systems with dynamic structural adaptation
Proceedings of the 28th international conference on Software engineering
Static Analysis of Dynamic Communication Systems by Partner Abstraction
SAS '07 Proceedings of the 14th international Symposium on Static Analysis
Regular model checking without transducers (on efficient verification of parameterized systems)
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Counterexample-Guided abstraction refinement for the analysis of graph transformation systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model checking dynamic states in GROOVE
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
A Modal-Logic Based Graph Abstraction
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Proceedings of the the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering
Automatic Verification of Directory-Based Consistency Protocols
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Parameterized verification of ad hoc networks
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Automating cut-off for multi-parameterized systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
The edge of graph transformation: graphs for behavioural specification
Graph transformations and model-driven engineering
On the power of cliques in the parameterized verification of Ad Hoc networks
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
On the verification of timed ad hoc networks
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Petruchio: from dynamic networks to nets
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Sound and complete abstract graph transformation
SBMF'11 Proceedings of the 14th Brazilian conference on Formal Methods: foundations and Applications
Verification of ad hoc networks with node and communication failures
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
A rigorous analysis of AODV and its variants
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Pattern-based graph abstraction
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Finding security vulnerabilities in a network protocol using parameterized systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
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.