arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2210.09476cs.LO
收藏

分布式系统中的语境性

Contextuality in distributed systems

Nasos Evangelou-Oost, Callum Bannister, Ian J. Hayes

AI总结:

本文构建分布式程序规范格,用单纯集合、预层与信息代数刻画相对轨迹及正确性约束,将语境性解释为一致性失效,并在 Isabelle/HOL 中完成验证。

摘要:

我们提出了一个分布式程序规范的格,其序关系表示可实现性/精化。规范被建模为相对执行轨迹的子集族,这些轨迹编码状态转换的局部顺序,而不是依据全局时钟的绝对时序。这样做是为了克服同步方面的根本物理困难。该规范格借助若干成熟的数学工具来构建和分析。单纯集合的非退化胞腔集合被用于建模相对轨迹,预层建模这些轨迹由变量的拓扑空间进行的参数化,而信息代数揭示了关于程序正确性的新颖约束。后一方面将程序规范事业纳入 Abramsky 等人提出的、范围不断扩大的语境语义学框架之中。在这种程序规范模型中,语境性表现为某种一致性准则的失效,该准则可与 Lamport 的顺序一致性定义相比拟。信息代数理论还提出了用于验证该准则的高效局部计算算法。本文中的新颖构造已在证明助手 Isabelle/HOL 中得到验证。

英文摘要:

We present a lattice of distributed program specifications, whose ordering represents implementability/refinement. Specifications are modelled by families of subsets of relative execution traces, which encode the local orderings of state transitions, rather than their absolute timing according to a global clock. This is to overcome fundamental physical difficulties with synchronisation. The lattice of specifications is assembled and analysed with several established mathematical tools. Sets of nondegenerate cells of a simplicial set are used to model relative traces, presheaves model the parametrisation of these traces by a topological space of variables, and information algebras reveal novel constraints on program correctness. The latter aspect brings the enterprise of program specification under the widening umbrella of contextual semantics introduced by Abramsky et al. In this model of program specifications, contextuality manifests as a failure of a consistency criterion comparable to Lamport's definition of sequential consistency. The theory of information algebras also suggests efficient local computation algorithms for the verification of this criterion. The novel constructions in this paper have been verified in the proof assistant Isabelle/HOL.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑