paperbot · PL 论文追踪

全部论文 待读 收藏

P2 A Probabilistic Choreography Language for PRISM

面向 PRISM 的概率编排语言
LMCS vol.Volume 22, Issue 42026匹配度 4/10 · 论文属于形式化方法与概率程序验证领域,涉及概率语义、模型检测和 PRISM 编码,与用户关注的程序分析和形式化验证有间接关联;但未涉及 LLM/Agent 驱动的验证、静态分析在 ML/Agentic 系统中的应用、浮点程序分析或贝叶斯程序分析,因此不匹配核心研究方向。引用 0 inbox
Marco Carbone, Adele Veschetti
crossref: 2026-10-09

AI 速览

一句话:提出一种概率编排语言,定义概率语义并编码到 PRISM,支持并发概率系统的全局建模与模型检测。

论文针对并发概率系统的建模与分析,提出一种基于 PRISM 的编排框架。编排语言从全局视角描述系统内期望的交互,使流程与潜在错误更易理解,从而提高执行正确性与可靠性。作者为该语言赋予概率语义,并给出到 PRISM 语言的形式化编码,讨论编码正确性,使程序性质可通过 PRISM 模型检测器验证。最后实现编译器,并借助 PRISM 网站中的用例展示其实用性,表明该语言可把全局编排规约编译为可分析的概率模型。

问题
并发概率系统的交互复杂,缺乏全局视角的规约语言,且难以直接进行形式化模型检测。
方法
设计一种编排语言及其概率语义,给出到 PRISM 语言的形式化编码并讨论正确性,同时实现编译器。
评估
实现编译器,并使用 PRISM 网站上的用例进行演示,验证性质可通过翻译后的 PRISM 模型进行模型检测。
原文摘要(Abstract)

We present a choreographic framework for modelling and analysing concurrent probabilistic systems based on the PRISM model-checker. This is achieved through the development of a choreography language, which is a specification language that allows to describe the desired interactions within a concurrent system from a global viewpoint. Using choreographies gives a clear and complete view of system interactions, making it easier to understand the process flow and identify potential errors, which helps ensure correct execution and improves system reliability. We equip our language with a probabilistic semantics and then define a formal encoding into the PRISM language and discuss its correctness. Properties of programs written in our choreographic language can be model-checked by the PRISM model-checker via their translation into the PRISM language. Finally, we implement a compiler for our language and demonstrate its practical applicability via examples drawn from the use cases featured in the PRISM website.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot12174,
  title = {A Probabilistic Choreography Language for PRISM},
  author = {Marco Carbone and Adele Veschetti},
  journal = {Logical Methods in Computer Science},
  volume = {Volume 22, Issue 4},
  year = {2026},
  doi = {10.46298/lmcs-22(4:1)2026}
}