arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1604.00350cs.LO
收藏

面向SPL验证的特征μ演算

Towards a Feature mu-Calculus Targeting SPL Verification

Maurice H. ter Beek, Erik P. de Vink, Tim A. C. Willemse

摘要:

模态μ演算μ-L是一种著名的不动点逻辑,用于表达和模型检查在标记转换系统上解释的属性。在本文中,我们提出了两个变种的μ演算,mu-Lf和mu-Lf ',特征转移系统。为此,我们明确地将功能表达式纳入逻辑,允许操作员选择转换和行为限制到特定的产品和子系列。我们为mu-Lf和mu-Lf'提供了语义,并将这两个新的mu-calculi和mu-L相互联系起来。接下来,我们专注于SPL行为的分析,并显示我们的形式主义可以应用于基于产品的验证与mu-Lf以及家庭为基础的验证与mu-Lf '。我们说明了一个玩具的例子如何属性可以模型检查,利用嵌入的mu-Lf'到μ演算的数据。

英文摘要:

The modal mu-calculus mu-L is a well-known fixpoint logic to express and model check properties interpreted over labeled transition systems. In this paper, we propose two variants of the mu-calculus, mu-Lf and mu-Lf', for feature transition systems. For this, we explicitly incorporate feature expressions into the logics, allowing operators to select transitions and behavior restricted to specific products and subfamilies. We provide semantics for mu-Lf and mu-Lf' and relate the two new mu-calculi and mu-L to each other. Next, we focus on the analysis of SPL behavior and show how our formalism can be applied for product-based verification with mu-Lf as well as family-based verification with mu-Lf'. We illustrate by means of a toy example how properties can be model checked, exploiting an embedding of mu-Lf' into the mu-calculus with data.

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

↑