Bringing Coq into the World of GCM Distributed Applications

Among all programming paradigms, component-based engineering stands as one of the most followed approaches for real world software development. Its emphasis on clean separation of concerns and reusability makes it appealing for both industrial and research purposes. The Grid Component Model (GCM) en...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel programming Vol. 42; no. 4; pp. 643 - 662
Main Authors: Gaspar, Nuno, Henrio, Ludovic, Madelaine, Eric
Format: Journal Article
Language:English
Published: Boston Springer US 01.08.2014
Springer Nature B.V
Subjects:
Architecture
Computer networks
Computer programs
Computer Science
Construction
Fractals
Interactive
Interfaces
Language
Parallel processing
Processor Architectures
Programming
Reasoning
Reconfiguration
Semantics
Software
Software development
Software Engineering/Programming and Operating Systems
Stands
Studies
Theorem proving
Theorems
Theory of Computation
Component-based engineering
The Coq Proof Assistant
Interactive theorem proving
Formal methods
Formal semantics
ISSN:0885-7458, 1573-7640
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Among all programming paradigms, component-based engineering stands as one of the most followed approaches for real world software development. Its emphasis on clean separation of concerns and reusability makes it appealing for both industrial and research purposes. The Grid Component Model (GCM) endorses this approach in the context of distributed systems by providing all the means to define, compose and dynamically reconfigure component-based applications. While structural reconfiguration is one of the key features of GCM applications, this ability to evolve at runtime poses several challenges w.r.t reliability. In this paper we present Mefresa, a framework for reasoning on the structure of GCM applications. This contribution comes in the form of a formal specification mechanized in the Coq Proof Assistant. Our aim is to demonstrate the benefits of interactive theorem proving for the reasoning on software architectures. We provide a configuration and reconfiguration language for the safe instantiation of distributed systems.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0885-7458
1573-7640
DOI:10.1007/s10766-013-0264-7