Painless Support for Static and Runtime Verification of Component-Based Applications

Abstract

Architecture Description Languages (ADL) provide descriptions of a software system in terms of its structure. Such descriptions give a high-level overview and come from the need to cope with arbitrarily complex dependencies arising from software components. In this paper we present Painless, a novel ADL with a declarative trait supporting parametrized specifications and architectural reconfigurations. Moreover, we exhibit its reliable facet on its integration with ProActive -a middleware for distributed programming. This is achieved by building on top of Mefresa, a Coq framework for the reasoning on software architectures. We inherit its strong guarantees by extracting certified code, and subsequently integrating it in our toolchain.

Component-based Distributed Software Reconfiguration:A Verification-oriented Survey

“…Somewhat similar to the work on Alloy is the formalization of GCM component configuration [63] and reconfiguration [64] in Coq. Like the Alloy specification, the functional behavior is not taken into account, but in [64] runtime reconfiguration is formally specified and the user of the platform can prove properties on the architecture of the application at runtime.…”

“…In addition, interactive and deductive verification are very time consuming. Nevertheless, verification time can be justified for generic applications, algorithms and tools that are massively used in different contexts and difficult to test, such as compilers [82,101], reconfiguration protocols [28] or reconfiguration languages [64].…”