Scalable verification of probabilistic networks

Scalable verification of probabilistic networks
复制标题

概率网络的可扩展验证

DOI:
10.1145/3314221.3314639
复制
发表时间:
2019
期刊:
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation
影响因子:
--
通讯作者:
Silva, Alexandra
Silva, Alexandra
中科院分区:
--
文献类型:
--
作者:
Smolka, Steffen;Kumar, Praveen;Kahn, David M.;Foster, Nate;Hsu, Justin;Kozen, Dexter;Silva, Alexandra

文献摘要

参考文献

被引文献

相似文献

提出了一种可扩展的概率网络程序验证工具McNetKAT。McNetKAT是基于一种新的语义,该语义基于有限状态、吸收马尔可夫链的概率NetKAT的守卫和无历史片段。该视图允许准确计算所有程序的语义,从而能够构建自动验证工具。特定于域的优化和并行化后端使McNetKAT能够分析包含数千个节点的网络,自动推理一般属性(如概率程序等价性和精细化)以及网络属性(如对故障的弹性)。我们使用实际拓扑评估了McNetKAT的可扩展性,将其性能与最先进的工具进行了比较,并就最近提出的数据中心网络设计开发了一个扩展的案例研究。
This paper presents McNetKAT, a scalable tool for verifying probabilistic network programs. McNetKAT is based on a new semantics for the guarded and history-free fragment of Probabilistic NetKAT in terms of finite-state, absorbing Markov chains. This view allows the semantics of all programs to be computed exactly, enabling construction of an automatic verification tool. Domain-specific optimizations and a parallelizing backend enable McNetKAT to analyze networks with thousands of nodes, automatically reasoning about general properties such as probabilistic program equivalence and refinement, as well as networking properties such as resilience to failures. We evaluate McNetKAT's scalability using real-world topologies, compare its performance against state-of-the-art tools, and develop an extended case study on a recently proposed data center network design.
DOI: 10.1145/321466.321473
发表时间: 1968-01-01
期刊: JOURNAL OF THE ACM
影响因子: 2.5
作者:
GRIFFITHS, TV
通讯作者: GRIFFITHS, TV
DOI: --
发表时间: 2021
期刊: --
影响因子: --
作者:
通讯作者: --
加权自动机的通用 epsilon 去除算法
DOI: 10.1007/3-540-44674-5_19
发表时间: 2000
影响因子: --
作者:
Mehryar Mohri
通讯作者: Mehryar Mohri
重新审视有限多带自动机的等价问题
DOI: 10.1007/978-3-642-39212-2_38
发表时间: 2013
影响因子: --
作者:
J. Worrell
通讯作者: J. Worrell
DOI: 10.1093/logcom/exi008
发表时间: 2005
期刊: J. Log. Comput.
影响因子: --
作者:
A. D. Pierro;C. Hankin;H. Wiklicky
通讯作者: H. Wiklicky