This paper proposes an algebraic system, verification algebra (VA), for reducing the number of component combinations to be verified in multi-tenant architecture (MTA). MTA is a design architecture used in SaaS (Software-as-a-Service) where a tenant can customize its applications by integrating services already stored in the SaaS databases or newly supplied services. Similar to SaaS, VaaS (Verification-as-a-Service) is a verification service in a cloud that leverages the computing power offered by a cloud environment with automated provisioning, scalability and service composition. In VaaS architecture, however, there is a challenging problem called ‘combinatorial explosion’ that it is difficult to verify a large number of compositions constructed by both quantities of components and various combination structures even with computing resources in cloud. This paper proposes rules to emerge combinations status for future verification, on the basis of the existing results. Both composition patterns and properties are considered and analysed in VA rules.

中文翻译：

---

VaaS架构中多租户应用的验证代数

本文提出了一种代数系统，即验证代数 (VA)，用于减少多租户架构 (MTA) 中要验证的组件组合的数量。MTA 是 SaaS（软件即服务）中使用的一种设计架构，租户可以通过集成已存储在 SaaS 数据库中的服务或新提供的服务来自定义其应用程序。与 SaaS 类似，VaaS（验证即服务）是一种云中的验证服务，它利用云环境提供的计算能力，具有自动配置、可扩展性和服务组合。然而，在 VaaS 架构中，有一个称为“组合爆炸”的具有挑战性的问题，即即使使用云计算资源，也很难验证由大量组件和各种组合结构构成的大量组合。本文在已有结果的基础上，提出了出现组合状态的规则，以备将来验证。在 VA 规则中考虑和分析组合模式和属性。