返回
摘要
En 中文
The industry is in the mood for programmable networks, where an operator can dynamically deploy network functions on network devices, akin to how one deploys virtual machines on physical machines in a cloud environment. Such flexibility brings along the threat of unpredictable behavior and performance. What are the minimum restrictions that we need to impose on network functionality such that we are able to verify that a network device behaves and performs as expected, for example, does not crash or enter an infinite loop? We present the result of working iteratively on two tasks: designing a domain-specific verification tool for packet-processing software, while trying to identify a minimal set of restrictions that packet-processing software must satisfy in order to be verification-friendly. Our main insight is that packet-processing software is a good candidate for domain-specific verification, for example, because it typically consists of distinct pieces of code that share limited mutable state; we can leverage this and other properties to sidestep fundamental verification challenges. We apply our ideas on Click packet-processing software; we perform complete and sound verification of an IP router and two simple middleboxes within tens of minutes, whereas a state-of-the-art general-purpose tool fails to complete the same task within several hours.
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
E.s.r. spectra of the radicals Me2ĊCN·AlMe3and Me2ĊCO2Me·AlMe3in solution自由基Me2 cn·AlMe3 和Me2 co 2Me·AlMe3 的e.s.r光谱在溶液中
Imaging photoinduced surface potentials on hybrid perovskites by real-time Scanning Electron Microscopy
Micron
IF0
Halocin C8: an antimicrobial peptide distributed among four halophilic archaeal genera: Natrinema, Haloterrigena, Haloferax, and HalobacteriumHalocin C8: 一种抗菌肽,分布在四个嗜盐古细菌属中: Natrinema,halotrigena,Haloferax和Halobacterium

