首页> 外文会议>International conference on certified programs and proofs >The 'Probabilistic Information-Order for Noninterference' Competition: Do we have a winner?
【24h】

The 'Probabilistic Information-Order for Noninterference' Competition: Do we have a winner?

机译:“无干扰的概率信息顺序”竞赛:我们有赢家吗?

获取原文

摘要

Many information measures compete for our attention when we want to decide whether one program leaks no more information than another: an early favourite was Shannon Entropy, of course. But more recent entries are Bayes Vulnerability, Marginal Guesswork, Guessing Entropy... and the field has become rather full. It's a bit of a zoo. All of the measures have their own advantages and disadvantages, their adherents and detractors. But do any of them have mathematical properties relevant to specification and refinement? Do they admit a program algebra? Do they allow compositional reasoning?
机译:当我们想要确定一个程序是否泄漏的信息不会比另一个泄漏更多的信息时,许多信息措施就吸引了我们的注意力:当然,早期最喜欢的是Shannon Entropy。但是,最近的条目包括贝叶斯漏洞,边际猜测工作,猜测熵...,并且该领域已经变得相当充裕。有点像动物园。所有这些措施都有其自身的优缺点,它们的拥护者和反对者。但是,它们中的任何一个都具有与规格和精炼相关的数学特性吗?他们接受程序代数吗?他们允许作文推理吗?

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号