Quantitative verification of software families based on coalgebraic modal logic and games

基于联代数模态逻辑和博弈的软件族定量验证

• 批准号: EP/X019373/1
• 负责人: Harsh Beohar
• 金额: $ 30.05万
• 依托单位: University of Sheffield
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2023
• 资助国家: 英国
• 起止时间: 2023 至 无数据
• 项目状态: 未结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FX019373%2F1
• 关键词: Quantitative; verification; software; families; based

To facilitate software with mass customisation, many software vendors develop a product from a core software base. As a result, it has become increasingly common to consider not only a single product, but to model and develop a family of software systems at the same time. Now this transformation of designing a single product to a family of software systems poses, in general, two significant challenges for Formal Methods. First, the traditional formal verification techniques for establishing conformance on a single product suffers from scalability since the inability of underlying formalisms to express behaviour of a software family. Second, conformance when stated as an equivalence relation is not a robust notion of behavioural comparison w.r.t. a specification, where a more fine-grained comparison in the form of behavioural distance is required. This is particularly relevant when software includes components that interact with an uncertain environment (like in the context of autonomous driving) and the correctness of such safety-crticial systems is part of the global trend on explainable AI.So our overarching aim is to advance the state-of-art verification techniques by enabling a more fine-grained behavioural analysis of software families based on behavioural distances. In particular, we will develop abstract mathematical models to specify behaviour of software families, develop fixpoint algorithms to compute behavioural distances on such models, and develop analysis technqiues to diagnose when an implementation is nonconforming. Building upon our recent work on behavioural equivalences for software families, we will pose and tackle our research questions at the abstract level of coalgebras. The advantage is that one can create a generic core framework to reason about a family of state-based systems of fixed branching types, which can be instantiated to concrete domains like software product lines (both static or adaptive) or parametric Markov models. In other words, this proposal lays out the theoretical underpinning necessary for the quantitative verification of software families modelled as coalgebras. Furthermore, this research also provides an impetus for evolving the theory of coalgebras since many fundamental questions (like expressive modal logics and games) for behavioural distances on coalgebras with side effects are not yet developed.

为了促进软件的大规模定制，许多软件供应商从核心软件基础开发产品。因此，不仅考虑单个产品，而且同时建模和开发一系列软件系统已经变得越来越普遍。现在，从设计单个产品到设计一系列软件系统的转变，通常会给形式化方法带来两个重大挑战。首先，用于在单个产品上建立一致性的传统形式化验证技术受到可伸缩性的影响，因为底层形式化无法表达软件家族的行为。其次，作为等价关系陈述的一致性并不是行为比较的健壮概念，而不是规范，其中需要以行为距离的形式进行更细粒度的比较。当软件包含与不确定环境交互的组件时（比如在自动驾驶的背景下），这种安全关键系统的正确性是可解释人工智能全球趋势的一部分，这一点尤为重要。因此，我们的首要目标是通过基于行为距离对软件家族进行更细粒度的行为分析来推进最先进的验证技术。特别是，我们将开发抽象的数学模型来指定软件家族的行为，开发定点算法来计算这些模型上的行为距离，并开发分析技术来诊断何时实现不一致。基于我们最近对软件家族行为等价的研究，我们将在抽象的代数层面提出并解决我们的研究问题。其优点是可以创建一个通用的核心框架来推理一系列固定分支类型的基于状态的系统，这些系统可以实例化到具体的领域，如软件产品线（静态或自适应）或参数马尔可夫模型。换句话说，这个建议为以代数为模型的软件族的定量验证提供了必要的理论基础。此外，本研究还为协代数理论的发展提供了动力，因为具有副作用的协代数上的行为距离的许多基本问题（如表达模态逻辑和博弈）尚未发展。

项目成果

Hennessy-Milner Theorems via Galois Connections

通过伽罗瓦连接的 Hennessy-Milner 定理

• DOI: 10.4230/lipics.csl.2023.12
• 发表时间: 2023
• 作者: Beohar H