Design and validation of computer protocols
Design and validation of computer protocols
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Router plugins: a software architecture for next-generation routers
IEEE/ACM Transactions on Networking (TON)
Bandera: extracting finite-state models from Java source code
Proceedings of the 22nd international conference on Software engineering
ACM Transactions on Computer Systems (TOCS)
A survey of programmable networks
ACM SIGCOMM Computer Communication Review
Specifying Distributed Software Architectures
Proceedings of the 5th European Software Engineering Conference
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
SMART: a many-to-many multicast protocol for ATM
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Programmable networks offer the ability to customize router behaviour at run time, thus increasing flexibility of network administration. Programmable network routers are configured using domain-specific languages. In this paper, we describe our approach to defining the syntax and semantics of such a domain-specific language. The ability to evolve router programs dynamically creates potential for misconfigurations. By exploiting domain-specific abstractions, we are able to translate router configurations into Promela and validate them using the Spin model checker, thus providing reasoning support for our domain-specific language. To evaluate our approach we use our configuration language to express the IETF's Differentiated Services specification and show that industrial-sized DiffServ router configurations can be validated using Spin on a standard PC.