Sequentiality vs. Concurrency in Games and Logic
Samson Abramsky
顺序性/并发性的区别和语义的证明之间的连接进行了研究，特别是游戏和线性逻辑。
Connections between the sequentiality/concurrency distinction and the semantics of proofs are investigated, with particular reference to games and Linear Logic.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We firstly find the existence of silent event $τ$ in true concurrency (named weakly true concurrency) by defining weakly true concurrent behaviors and weakly true concurrent logics. Based on Paolo Baldan and Silvia Crafa's comprehensive work on (strongly) true concurrency, we find the correspondence between weakly true concurrent equivalences and weakly true concurrent logics.
A Logic for True Concurrency
我们提出了一个逻辑的真正的并发性，其公式谓词的事件在计算和因果关系的依赖关系。诱导的逻辑等价是遗传的历史保持双相似性，和片段的逻辑可以被识别对应于其他真正的并发行为等价在文献中：步骤，pomset和历史保持双相似性。标准的Hennessy-Milner逻辑，因此（交织）双相似性，也被恢复为一个片段。我们还提出了一个扩展的逻辑与不动点算子，从而允许描述因果和并发性质的无限计算。我们相信，这项工作有助于合理介绍真正的并发频谱和更深入地了解所涉及的行为等价物之间的关系。
Permission-Based Separation Logic for Message-Passing Concurrency
基于分离逻辑和资源使用分析的思想，我们开发了消息传递并发程序的局部推理技术。我们扩展进程的权限资源，并定义了一个约简语义的扩展语言。这为解释消息传递并发的分离公式提供了基础。我们还定义了一个健全的证明系统，使我们能够推断满意度成分使用本地，分离为基础的推理。
Communication, and concurrency with logic-based restriction inside a calculus of structures
众所周知，我们可以使用结构证明理论来提炼或概括现有的范例计算原语，或者发现新的范例计算原语。在这样的观点下，我们继续开发一个程序，其目标是建立逻辑系统的证明搜索和过程代数中的计算之间的对应关系。我们给出了一个纯粹的逻辑帐户的进程代数操作，其中严格包括我们发现在米尔纳CCS行动的限制行为。这在被赋予自对偶量词的深层推理结构演算中的逻辑系统中是可能的。使用证明搜索这样一个逻辑系统的无切证明，我们展示了如何解决可达性问题的进程代数，包含一个重要的片段米尔纳CCS。
On Propositional Dynamic Logic and Concurrency
本文提出操作性命题动态逻辑(OPDL)，通过区分程序与轨迹，解决并发中交错捕捉问题，并扩展至CCS和编舞编程等并发模型。
Logics and Games for True Concurrency
我们研究了基于过渡系统，Petri网和事件结构的各种偏序模型的并发性的基本数学性质，并表明这些系统的并发行为可以通过两个简单的和一般的对偶局部行为以统一的方式捕获。这种对偶性被用来定义新的μ演算和逻辑游戏，用于分析具有偏序语义的并发系统。这项工作的一些结果是：一些mu-演算的定义，在某些类的系统，诱导相同的标识作为一些最有名的互模拟等价的并发性;和定义（无限）高阶逻辑游戏的互模拟和模型检查，其中的球员的游戏给予（本地）一元二阶权力的一组元素，他们被允许发挥。更具体地说，我们表明，我们的游戏是健全的和完整的，因此，确定;此外，它们是可判定的有限情况下，并支持新的决策程序的互模拟和模型检查。由于这些mu演算和逻辑游戏概括了著名的不动点逻辑和博弈论决策程序的并发系统与交织语义，本文的结果给出了一些基础的设计一个基于逻辑的，博弈论的框架研究，在一个统一的方式，几个并发系统，无论他们是否有交织或偏序语义。
The Glory of the Past and Geometrical Concurrency
本文有助于对并发的几何模型的一般理解，被命名为高维自动机（HDAs）的普拉特。特别是，我们调查模态逻辑等模型和它们的表达能力方面的互模拟，可以被捕获。并发的几何模型之所以有趣，主要有两个原因：它的通用性和可表达性，以及捕获自动并发和动作细化的自然方式。然而，这种模型的逻辑没有得到很好的研究，其中一个简单的，但足够的，模态逻辑在HDAs只是最近才被引入。由于这种模态逻辑，有两个存在模态，期间和之后，只捕获分裂互模拟，这是相当低的范Glabbeek和Vaandrager的频谱，直接的问题是什么小的扩展，这个逻辑可以捕获更细粒度的遗传历史保持互模拟（hh）？作为回应，本文中的工作提供了几个见解。一个是HDA的几何方面使得可以用于捕获hh互模拟，这是一种不使用事件变量的标准模态逻辑，与我们比较的两种逻辑（在表达性较低的模型上）相反。我们在这里研究的逻辑使用标准的过去模态，并扩展了以前引入的逻辑（称为HDML），只有向前的，动作标记的模态。此外，我们试图通过引入一个相关的模型，我们称之为ST-配置结构，它扩展了van Glabbeek和Plotkin的配置结构，以更好地理解上述问题。我们将这个模型与HDAs联系起来，并根据这个新模型重新定义和证明了以前的结果。这些提供了一个不同的观点，为什么过去的模态和几何并发捕获遗传历史保持互模拟。还获得了其他相关的见解。
Convolution, Separation and Concurrency
卷积的概念提出的背景下，正式的幂级数连同提升结构表征代数的这种系列，这通常是quantale。一些例子支持了这些构造的普遍性，最突出的例子是分离逻辑，其中卷积是断言Quantale中的分离合取;区间逻辑，其中卷积是斩波操作;和流区间函数，其中卷积用于分析动态或实时系统的轨迹。一个霍尔逻辑是在幂级数Quantale上以通用的方式构造的，它适用于这些例子中的每一个。在许多情况下，卷积的可交换概念具有作为并发操作的自然解释。
Compositional Verification of Concurrency Using Past-Time Temporal Epistemic Logic
提出一种过去时间时态认知逻辑，用于形式化共享内存并发中的基于局部视图的推理，并在Peterson互斥算法上验证其有效性，同时展示该逻辑如何嵌入依赖-保证推理。
Logical Concurrency Control from Sequential Proofs
我们感兴趣的是识别和执行并发程序的隔离要求，即，确保程序满足其规范的并发控制。本文的论点是，这可以从顺序证明开始系统地进行，即，在没有并发交织的情况下证明程序的正确性。我们说明我们的论文提出了一个解决方案的问题，使一个顺序库线程安全的并发客户端。我们考虑一个顺序库注释断言以及证明这些断言在顺序执行。我们展示了如何使用证明来导出并发控制，以确保库方法的任何执行在由并发客户端调用时满足相同的断言。我们还提出了一个扩展，以保证库方法是线性化或原子。
ReLoC Reloaded: A Mechanized Relational Logic for Fine-Grained Concurrency and Logical Atomicity
本文提出ReLoC Reloaded，一种基于Iris框架的机械化关系分离逻辑，用于证明高阶状态与细粒度并发程序的精化关系，并扩展了逻辑原子关系规范，支持预言变量以增强实用性。
This paper is motivated by the desire to study package management using the toolkit of the semantics of functional languages. As it transpires, this is deeply related to the semantics of concurrent computation. The models we produce are not solely of theoretical interest, but amenable to analysis and computation. This work makes a number of related contributions. First, it relates the specification of branching dependency structures, which exist in fields from knowledge-representation to package management, to the specification of semantics of concurrent computation. Second, it relates depende…
Between quantum logic and concurrency
我们从定义在一种特殊的偏序集（称为因果网）的元素上的两个闭包算子开始。因果网用于模拟并发进程的历史，记录局部状态和事件的发生。如果这样的偏序集的每个极大链（线）满足每个极大反链（割），则这两个闭包算子重合，并生成一个完备的正交模格。在本文中，我们回顾，在这个格中的任何封闭的集合，每一条线满足它或它的正交补在格中，并表明，任何线，在格上的二值状态可以相关联。从这个结果开始，我们描绘了一种逻辑语言，其公式在因果网的闭集上进行解释，其中每行都诱导公式的真值分配。由此产生的逻辑是非经典的，我们表明，最大的反链在因果网相关联的布尔（因此“经典”）子结构的整体量子逻辑。
The emergence of propositions-as-sessions, a Curry-Howard correspondence between propositions of Linear Logic and session types for concurrent processes, has settled the logical foundations of message-passing concurrency. Central to this approach is the resource consumption paradigm heralded by Linear Logic. In this paper, we investigate a new point in the design space of session type systems for message-passing concurrent programs. We identify O'Hearn and Pym's Logic of Bunched Implications (BI) as a fruitful basis for an interpretation of the logic as a concurrent programming language. This …
This work proposes a Dynamic Epistemic Logic with Communication Actions that can be performed concurrently. Unlike Concurrent Epistemic Action Logic introduced by Ditmarsch, Hoek and Kooi, where the concurrency mechanism is the so called true concurrency, here we use an approach based on process calculus, like CCS and CSP, and Action Models Logic. Our approach makes possible the proof of soundness, completeness and decidability, different from the others approaches. We present an axiomatization and show that the proof of soundness, completeness and decidability can be done using a reduction me…
Towards Concurrent Quantitative Separation Logic
本文提出并发定量分离逻辑，将定量分离逻辑与并发分离逻辑结合，用于验证并发、指针和随机化程序实现后置条件的概率下界。
Deductive Verification of Weak Memory Programs with View-based Protocols (extended version)
本文提出在VerCors中编码弱内存并发的方案，通过扩展原子操作支持并引入协议自动机概念，实现基于许可的分离逻辑，用于验证弱内存并发程序的正确性。
An application of parallel cut elimination in multiplicative linear logic to the Taylor expansion of proof nets
本文研究MLL证明网并行消去的组合性质，通过路径约束保证无限加权和归约的有限性，并证明该约束适用于MELL泰勒展开中的微分网，为线性逻辑定量语义提供充分条件。
This volume contains the proceedings of the Combined 25th International Workshop on Expressiveness in Concurrency and the 15th Workshop on Structural Operational Semantics (EXPRESS/SOS 2018), which was held on September 3, 2018, in Beijing, China, as an affiliated workshop of CONCUR 2018, the 29th International Conference on Concurrency Theory. The EXPRESS workshops aim at bringing together researchers interested in the expressiveness of various formal systems and semantic notions, particularly in the field of concurrency. Their focus has traditionally been on the comparison between programmin…
Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics
本卷包含第22届并发表达性国际研讨会和第12届结构操作语义研讨会（EXPRESS/SOS 2015）的会议记录，该研讨会于2015年8月31日在西班牙马德里举行，作为第26届并发理论国际会议CONCUR 2015的附属研讨会。EXPRESS研讨会旨在汇集对各种形式系统和语义概念的表达感兴趣的研究人员，特别是在并发领域。传统上，他们的重点是编程概念（例如并发、函数式、命令式、逻辑和面向对象编程）之间的比较以及计算数学模型（例如进程代数、Petri网、事件结构、模态逻辑和重写系统）之间的比较。基于它们的相对表达能力。自1994年以来，EXPRESS系列研讨会已经成功举办，多年来，这一重点已经得到广泛的理解。SOS研讨会的目的是成为一个论坛的研究人员，学生和从业人员感兴趣的新发展，未来的调查方向，在结构操作语义领域。SOS研讨会系列的具体目标之一是在从事SOS理论和实践工作的并发和程序设计语言社区之间建立协同作用。自2012年以来，EXPRESS和SOS社区组织了一个年度EXPRESS/SOS联合研讨会，讨论计算数学模型的表达能力以及系统和编程概念的形式语义。
This volume contains the proceedings of the Combined 24th International Workshop on Expressiveness in Concurrency and the 14th Workshop on Structural Operational Semantics (EXPRESS/SOS 2017) which was held on 04 September 2017 in Berlin, Germany, as an affiliated workshop of CONCUR 2017, the 28th International Conference on Concurrency Theory. The EXPRESS workshops aim at bringing together researchers interested in the expressiveness of various formal systems and semantic notions, particularly in the field of concurrency. Their focus has traditionally been on the comparison between programming…
This volume contains the proceedings of the Combined 23nd International Workshop on Expressiveness in Concurrency and the 13th Workshop on Structural Operational Semantics (EXPRESS/SOS 2016) which was held on 22 August 2016 in Québec City, Canada, as an affiliated workshop of CONCUR 2016, the 27th International Conference on Concurrency Theory. The EXPRESS workshops aim at bringing together researchers interested in the expressiveness of various formal systems and semantic notions, particularly in the field of concurrency. Their focus has traditionally been on the comparison between programmin…
Coinductive Big-Step Semantics for Concurrency
在SOS 2010上发表的一篇论文中，我们开发了一个框架，用于交互式输入-输出的大步骤语义结合发散，基于共归纳和混合归纳共归纳概念，评价和终止敏感弱双相似性。与标准的归纳定义的大步骤语义相反，这个框架正确地处理分歧;特别是，产生一些可观察的效果，然后发散的运行，不会“丢失”。在这里，我们在一个简单的示例语言上扩展了这种共享变量并发的方法。我们以建构性逻辑发展我们语义的元理论。
Comparing Session Type Systems derived from Linear Logic
本文严格比较了由线性逻辑的经典与直觉主义表述派生出的并发会话类型系统，开发了涵盖两者的 $π\mathsf{ULL}$ 系统作为参考框架，并基于局部性原则和进程组合形式分析了其差异。
Proceedings Combined 21st International Workshop on Expressiveness in Concurrency and 11th Workshop on Structural Operational Semantics
本卷包含2014年9月1日在意大利罗马举行的第21届并发表达性国际研讨会和第11届结构操作语义研讨会（EXPRESS/SOS 2014）的会议记录，作为CONCUR 2014的附属研讨会，第25届并发理论国际会议。EXPRESS研讨会旨在汇集对各种形式系统和语义概念的表达感兴趣的研究人员，特别是在并发领域。传统上，他们的重点是比较编程概念（如并发、函数、命令、逻辑和面向对象编程）和计算的数学模型（如进程代数、Petri网、事件结构、模态逻辑和重写系统）之间的相对表达能力。自1994年以来，EXPRESS系列研讨会已经成功举办，多年来，这一重点已经得到广泛的理解。SOS研讨会的目的是成为一个论坛的研究人员，学生和从业人员感兴趣的新发展，未来的调查方向，在结构操作语义领域。SOS研讨会系列的具体目标之一是在从事SOS理论和实践工作的并发和程序设计语言社区之间建立协同作用。SOS在其他领域的应用报告也非常受欢迎，包括：生物系统的建模和分析，计算机系统编程的安全性，嵌入式系统的建模和分析，中间件和协调语言的规范，程序设计语言语义和实现，静态分析软件和硬件验证，以及特定领域语言和基于模型的工程的语义。
A proof-theoretic view on scheduling in concurrency
本文阐述了一种新的方法的问题的证明理论研究的并发交互称为“证据的时间表”。观察证明理论是非常适合于描述合流系统，而并发具有非确定性作为一个基本特征，我们开发了一个对应的证明提供了什么是需要并发系统合流，即调度。在我们的逻辑系统中，进程和验证者在证明语言的不同片段中显式地显示为证明，并且它们之间的切割消除确实对应于并发系统的执行。这种角色的分离为过程的指称语义提供了新的见解，也为将π演算转换为无前缀的形式主义（如solos）提供了新的方法，作为证明系统之间转换的操作对应物。
Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics
本卷包含2013年8月26日在阿根廷布宜诺斯艾利斯举行的第20届并发表达性国际研讨会和第10届结构操作语义研讨会（EXPRESS/SOS 2013）的会议记录，作为CONCUR 2013的附属研讨会，第24届并发理论国际会议。EXPRESS研讨会旨在汇集对各种形式系统和语义概念的表达感兴趣的研究人员，特别是在并发领域。传统上，他们的重点是编程概念（例如并发、函数式、命令式、逻辑和面向对象编程）之间的比较以及计算数学模型（例如进程代数、Petri网、事件结构、模态逻辑和重写系统）之间的比较。基于它们的相对表达能力。自1994年以来，EXPRESS系列研讨会已经成功举办，多年来，这一重点已经得到广泛的理解。SOS研讨会的目的是成为一个论坛的研究人员，学生和从业人员感兴趣的新发展，未来的调查方向，在结构操作语义领域。SOS研讨会系列的具体目标之一是在从事SOS理论和实践工作的并发和程序设计语言社区之间建立协同作用。SOS在其他领域的应用报告也非常受欢迎，包括：生物系统的建模和分析，计算机系统编程的安全性，嵌入式系统的建模和分析，中间件和协调语言的规范，程序设计语言语义和实现，静态分析软件和硬件验证，以及特定领域语言和基于模型的工程的语义。
Bisimulations and Logics for Higher-Dimensional Automata
本文提出Ipomset模态逻辑，用于刻画HDAs中的路径双向模拟，并定义单元双向模拟及其与标准双向模拟的关系。
The present work aims to give a unity of logic via standard sequential, unpolarized games. Specifically, our vision is that there must be mathematically precise concepts of linear refinement and intuitionistic restriction of logic such that the linear refinement of classical logic (CL) coincides with (classical) linear logic (LL), and its intuitionistic restriction with the linear refinement of intuitionistic logic (IL) into intuitionistic LL (ILL). However, LL is, in contradiction to the name, cannot be the linear refinement of CL at least from the game-semantic point of view due to its concu…
A wide-spectrum language integrates specification constructs into a programming language in a manner that treats a specification command just like any other command. This paper investigates a semantic model for a wide-spectrum language that supports concurrency and a refinement calculus. In order to handle specifications with rely and guarantee conditions, the model includes explicit environment steps as well as program steps. A novelty of our approach is that we define a set of primitive commands and operators, from which more complex specification and programming language commands are built.…
We present a logical system CFP (Concurrent Fixed Point Logic) from whose proofs one can extract nondeterministic and concurrent programs that are provably total and correct with respect to the proven formula. CFP is an intuitionistic first-order logic with inductive and coinductive definitions extended by two propositional operators, A || B (restriction, a strengthening of the implication B -> A) and $\ddownarrow(A)$ (total concurrency). The target of the extraction is a lambda calculus with constructors and recursion extended by a constructor Amb (for McCarthy's amb) which is interpreted ope…
Extracting total Amb programs from proofs
本文提出CFP逻辑系统，用于从证明中提取可证明总正确性的非确定性和并发程序，通过域论语义验证提取程序的正确性，并展示了一个将无限Gray码转换为符号数字表示的非确定性程序。
Actris 2.0: Asynchronous Session-Type Based Reasoning in Separation Logic
本文提出Actris 2.0，一种基于会话类型的分离逻辑，用于在混合并发范式下证明消息传递程序的功能正确性，并通过子协议增强异步推理，已在Coq中机械化验证。
Back to Futures
本文提出一种基于伴随逻辑Curry-Howard解释的并发语言，通过添加三个原子原语编码顺序组合与同步，统一表达期货、分叉/连接并行和单子并发，并形式化线性期货。
Boolean networks (BNs) are widely used to model the qualitative dynamics of biological systems. Besides the logical rules determining the evolution of each component with respect to the state of its regulators, the scheduling of component updates can have a dramatic impact on the predicted behaviours. In this paper, we explore the use of Read (contextual) Petri Nets (RPNs) to study dynamics of BNs from a concurrency theory perspective. After showing bi-directional translations between RPNs and BNs and analogies between results on synchronism sensitivity, we illustrate that usual updating modes…
An old dream of concurrency theory and programming language semantics has been to uncover the fundamental synchronization mechanisms which regulate situations as different as game semantics for higher-order programs, and Hoare logic for concurrent programs with shared memory and locks. In this paper, we establish a deep and unexpected connection between two recent lines of work on concurrent separation logic (CSL) and on template game semantics for differential linear logic (DiLL). Thanks to this connection, we reformulate in the purely conceptual style of template games for DiLL the asynchron…
ICLP is the premier international event for presenting research in logic programming. Contributions to ICLP 2022 were sought in all areas of logic programming, including but not limited to: Foundations: Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. Languages issues: Concurrency, Objects, Coordination, Mobility, Higher order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming techniques. Programming support: Program analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing, Execution visualiz…
Putting Logic-Based Distributed Systems on Stable Grounds
在声明式网络范式中，类似数据日志的语言用于表达分布式计算。虽然最近这些语言的正式操作语义已经开发出来，相应的声明性语义一直缺乏。挑战在于精确地捕获分布式计算由于并发、网络延迟和异步通信而固有的不确定性的量。本文展示了如何声明，基于模型的语义可以通过简单地使用众所周知的稳定模型语义与否定的数据库。我们表明，基于模型的语义匹配先前提出的正式操作语义。
ICLP is the premier international event for presenting research in logic programming. Contributions to ICLP 2021 were sought in all areas of logic programming, including but not limited to: Foundations: Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. Languages issues: Concurrency, Objects, Coordination, Mobility, Higher order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming techniques. Programming support: Program analysis, Transformation, Validation, Verification, Debugging, Profiling, Testing, Execution visualiz…
Probabilistic specifications are fast gaining ground as a tool for statistical modeling of probabilistic systems. One of the main goals of formal methods in this domain is to ensure that specific behavior is present or absent in the system, up to a certain confidence threshold, regardless of the way it operates amid uncertain information. This paper presents a rewriting logic semantics for a probabilistic extension of Event-B, a proof-based formal method for discrete systems modeling. The proposed semantics adequately captures the three sources of probabilistic behavior, namely, probabilistic …
In this paper, we show how to interpret a language featuring concurrency, references and replication into proof nets, which correspond to a fragment of differential linear logic. We prove a simulation and adequacy theorem. A key element in our translation are routing areas, a family of nets used to implement communication primitives which we define and study in detail.
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and bisimulation games play a central role. We show how each of these types of games can be described in terms of an indexed family of comonads on the category of relational structures and homomorphisms. The index $k$ is a resource parameter which bounds the degree of access to the underlying structure. The coKleisli categories for these comonads can be used to giv…
Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming. Contributions are sought in all areas of logic programming, including but not restricted to: Foundations: Semantics, Formalisms, Nonmonotonic reasoning, Knowledge representation. Languages: Concurrency, Objects, Coordination, Mobility, Higher Order, Types, Modes, Assertions, Modules, Meta-programming, Logic-based domain-specific languages, Programming Techniques. Declarative programming: Declarative program development, Analysis, Type and mode infere…
Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming. Contributions are solicited in all areas of logic programming and related areas, including but not restricted to: - Foundations: Semantics, Formalisms, Answer-Set Programming, Non-monotonic Reasoning, Knowledge Representation. - Declarative Programming: Inference engines, Analysis, Type and mode inference, Partial evaluation, Abstract interpretation, Transformation, Validation, Verification, Debugging, Profiling, Testing, Logic-based domain-specific …
Disentangling Parallelism and Interference in Game Semantics
本文通过构建 IA 的因果博弈语义模型，提出并行无邪性与顺序性条件以分别排除干扰与并行性，实现四项完全抽象结果，首次将 Abramsky 语义立方体计划扩展至顺序确定性领域之外。
Yeo's Theorem for Locally Colored Graphs: the Path to Sequentialization in Linear Logic
本文提出了一种基于半边着色的Yeo定理泛化方法，用于从线性逻辑证明网中提取序列性信息，无需修改图结构。
State-based models of concurrent systems are traditionally considered under a variety of notions of process equivalence. In the particular case of labelled transition systems, these equivalences range from trace equivalence to (strong) bisimilarity, and are organized in what is known as the linear time -- branching time spectrum. A combination of universal coalgebra and graded monads provides a generic framework in which the semantics of concurrency can be parametrized both over the branching type of the underlying transition systems and over the granularity of process equivalence. We show in …
Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht-Fraisse games, pebble games, and bisimulation games play a central role. We show how each of these types of games can be described in terms of an indexed family of comonads on the category of relational structures and homomorphisms. The index k is a resource parameter which bounds the degree of access to the underlying structure. The coKleisli categories for these comonads can be used to give …
Domain Theory and the Logic of Observable Properties
斯通对偶的数学框架被用来合成理论计算机科学中迄今为止独立的一些发展：域理论，斯科特作为指称语义的基础引入的计算数学理论。- Milner、Hennessy等人基于操作语义提出的并发性和系统行为理论。- 程序的逻辑。斯通对偶提供了语义（点的空间=计算过程的表示）和逻辑（过程的属性格）之间的连接。此外，底层逻辑是几何的，它可以在计算上被解释为可观察属性的逻辑-即可以根据关于其执行的有限数量的信息来确定过程的属性。这些想法导致以下方案：1.元语言的介绍，包括-类型=宇宙的话语各种计算的情况。- 术语=程序=模型或点的语法内涵。2.一个标准的指称解释的元语言，分配域的类型和域元素的条款。3.元语言也给出了{ \em逻辑}解释，其中类型被解释为命题理论，术语通过程序逻辑解释，该程序逻辑将它们满足的属性公理化。4.这两种解释是相互关联的，表明它们是彼此的石头。因此，语义学和逻辑学保证了彼此的和谐，事实上，每一个都决定着另一个，直到同构。这为一系列应用开辟了道路。在我们的元语言中，给定一个计算情形的指称描述，我们可以转动句柄来获得该情形的逻辑。
Temporal Planning via Interval Logic Satisfiability for Autonomous Systems
本文提出以 Allen 区间逻辑表达动作与流的区间关系，并构建 CP 规划图处理复杂并发，实验显示其在案例研究中优于 PDDL 2.1 规划器。
A Proof Theoretic Study of Soft Concurrent Constraint Programming
并发约束编程（CCP）是一个简单而强大的并发模型，其中代理通过告知和询问约束进行交互。从一开始，CCP语言就被设计成与逻辑有很强的联系。事实上，底层的约束系统可以从直觉（线性）逻辑的一个合适的片段--ILL--构建，并且过程可以被解释为ILL中的公式。约束作为ILL公式不能准确地表示"偏好"（称为软约束），如概率，不确定性或模糊性存在的情况。为了规避这个问题，c-半环已被提出作为代数结构，用于定义约束系统，其中允许代理告诉和询问软约束。然而，在这种情况下，与逻辑和证明理论的紧密联系丢失了。在这项工作中，我们给出了一个证明理论的解释软约束：它们可以被定义为公式在一个合适的片段ILL与次指数（SELL）的次指数，有序的c-半环结构，被解释为偏好。因此，我们实现两个目标：（1）获得一种CCP语言，其中智能体可以告诉和询问软约束，（2）证明（1）中的语言与逻辑有很强的联系。因此，我们保持一个声明性的阅读过程的公式，同时提供了一个逻辑框架的软CCP为基础的系统。（1）的一个有趣的副作用是，通过限制对非幂等c-半环的提升规则的使用，我们也能够处理SELL中的概率（和其他模态）。这种控制次指数的更好方法允许考虑更有趣的空间和限制，并且它为指定更具挑战性的计算系统提供了可能性。
Recent approaches to verifying programs in separation logics for concurrency have used state transition systems (STSs) to specify the atomic operations of programs. A key challenge in the setting has been to compose such STSs into larger ones, while enabling programs specified under one STS to be linked to a larger one, without reverification. This paper develops a notion of morphism between two STSs which permits such lifting. The morphisms are a constructive form of simulation between the STSs, and lead to a general and concise proof system. We illustrate the concept and its generality on se…
Extending concurrent separation logic to the hardware level to verify the xv6 OS kernel on RISC-V with AI agents
该研究提出基于Iris的MachCSL框架，将并发分离逻辑扩展至硬件层级，借助LLM智能体验证RISC-V上的xv6内核，发现10个漏洞，耗时77天完成验证。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。