Completing the temporal picture
Selected papers of the 16th international colloquium on Automata, languages, and programming
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
A stepwise refinement heuristic for protocol construction
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
Formal Methods in System Design
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Distributed directory service and message routing for mobile agents
Science of Computer Programming
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
OSPF: Anatomy of an Internet Routing Protocol
OSPF: Anatomy of an Internet Routing Protocol
Distributed Algorithms
Computer Networks
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
CMC: a pragmatic approach to model checking real code
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Refinement, Decomposition, and Instantiation of Discrete Models: Application to Event-B
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
An open extensible tool environment for event-b
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Formal derivation of a distributed program in event B
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Reasoning about liveness properties in event-B
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Formal development of wireless sensor-actor networks
Science of Computer Programming
Reasoning about almost-certain convergence properties using Event-B
Science of Computer Programming
Hi-index | 0.00 |
We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and is the problem of each node in a network discovering and maintaining information on the network topology. One of the key challenges in developing this algorithm is specifying the problem itself. We provide a specification that includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the system reaches stable states. We prove these properties by appropriately combining proofs of invariants, event refinement, event convergence, and deadlock freedom. The combination of these features is novel and should be useful for formalizing and developing other kinds of semi-reactive systems, which are systems that react to, but do not modify, their environment. Our entire development has been formalized and machine checked using the Rodin tool.