| |||||||||||||
WRiPE 2011 : 1st International Workshop on Rigorous Protocol Engineering, co-located with ICNP 2011 | |||||||||||||
Link: http://wripe11.cis.upenn.edu/ | |||||||||||||
| |||||||||||||
Call For Papers | |||||||||||||
WRiPE is an inter-disciplinary workshop that will bring together researchers from the networking, formal methods and programming languages communities. ICNP started nearly twenty years ago as a conference focused on the application of formal methods to the design and analysis of protocols primarily from the telecommunication space. This initial focus on formal methods has diminished over the years as ICNP has shifted towards research on Internet protocols. The aim of WRiPE is to reinvigorate and revitalize the application of formal methods to the design and analysis of network protocols.
We think the time is ripe for this type of workshop because (1) verification techniques have matured greatly in the last few decades, (2) verification tools such as model checkers, theorem provers, and SAT/SMT solvers have attracted a sizable user base, and (3) such techniques and tools have not traditionally been applied to network protocols (in particular IP, which is now the dominant networking technology). By network protocols, we include traditional IP routing protocols, wireless multi-hop routing, BGP policies, transport protocols, application-layer overlay networks, and enterprise and data center networks. These may also include security extensions to these protocols, e.g. IPSec and Secure BGP, as well as protocols developed using emerging software router platforms such as OpenFlow. By verification technique, we mean any rigorous method of demonstrating that an implementations satisfies a given specification, or that reliable conclusions can be extracted from measurements. Topics of interest include, but are not limited to, the following: Correct-by-Construction methods: meta-model frameworks (logics, algebras, calculi, etc.) for Internet protocols Applications of model checkers, theorem provers, and SAT/SMT solvers to Internet protocol design. Domain specific languages (declarative, functional, or logic-based) that raises the level of abstraction in Internet protocol development. Formal-methods based techniques for run-time verification and testing of Internet protocols. Combining model checking and theorem proving for verifying Internet protocols. Model finding techniques for network configuration. |
|