Abstract

Software product lines (SPLs) facilitate reuse and customization in software development by genuinely addressing the concept of variability. Product Line Calculus of Communicating Systems (PL-CCS) is a process calculus for behavioral modeling of SPLs, in which variability can be explicitly modeled by a binary variant operator. In this paper, we study different notions of behavioral equivalence for PL-CCS, based on Park and Milner's strong bisimilarity. These notions enable reasoning about the behavior of SPLs at different levels of abstraction. We study the compositionality property of these notions and the mutual relationship among them. We further show how the strengths of these notions can be consolidated in an equational reasoning method. Finally, we designate the notions of behavioral equivalence that are characterized by the property specification language for PL-CCS, called multi-valued modal μ-calculus.

Highlights

  • Software product line (SPL) engineering has become a established trend in software development, where a family of similar software products with minor differences are developed in tandem, instead of developing each specific softwarePreprint submitted to Journal of Logical and Algebraic Methods in ProgrammingOctober 30, 2015

  • We provide a sound axiomatization of Product Line Calculus of Communicating Systems (PL-Communicating Systems (CCS)) terms modulo product line bisimilarity, which allows one to derive any sound equation on closed terms with finite-state behavior

  • We show that the multi-valued modal μ-calculus is the characterizing logic for our product line bisimilarity

Read more

Summary

Introduction

Software product line (SPL) engineering has become a established trend in software development, where a family of similar software products with minor differences are developed in tandem, instead of developing each specific software. Preprint submitted to Journal of Logical and Algebraic Methods in ProgrammingOctober 30, 2015

INTRODUCTION
Product Line CCS
PL-CCS
PL-CCS Semantics
Bisimilarity for Product Lines
Congruence Property
EQUATIONAL REASONING ON PL-CCS TERMS p4
Equational Reasoning on PL-CCS Terms
Extending PL-CCS Framework
PL-CCS Axiomatization
Completeness of the Axiomatization for Finite-state Behaviors
PRODUCT LINE ANALYSIS
Product Line Analysis
Restructuring a product family
LOGICAL CHARACTERIZATION
Multi-Valued Modal μ-Calculus
RELATED WORK
Related Work
Conclusions and Future Work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call