Verifying cross-cutting features as open systems

@inproceedings{Li2002VerifyingCF,
  title={Verifying cross-cutting features as open systems},
  author={Harry C. Li and Shriram Krishnamurthi and Kathi Fisler},
  booktitle={SOEN},
  year={2002}
}
Feature-oriented software designs capture many interesting notions of cross-cutting, and offer a powerful method for building product-line architectures. Each cross-cutting feature is an independent module that fundamentally yields an open system from a verification perspective. We describe desiderata for verifying such modules through model checking and find that existing work on the verification of open systems fails to address most of the concerns that arise from feature-oriented systems. We… 

Figures from this paper

Looking for Inspiration: Understanding the Information Evaluation and Seeking Behavior of Novice Designers During Creative Idea Generation
Information usage is a key aspect of creative cognition and has been shown to influence design outcomes. The goal of this study was to investigate the information seeking behavior of student
Design variability verification in Software Product Lines
TLDR
This paper proposes a novel notion called variability verification applicable to Software Product Lines (SPL), where each feature exhibits independent variability and the verification of an entire SPL consisting of multiple features is reduced to the verify of the individual features.
Systematic techniques for efficiently checking Software Product Lines
vii Chapter
An Automation of Check Focusing on CRUD for Requirements Analysis Model in UML
TLDR
This paper proposes a support method to check the validity of a data life cycle by using a model checking tool “UPPAAL” focusing on CRUD (Create, Read, Update and Delete).
How Hard Is Aspect-Oriented Programming ?
TLDR
This paper presents a formalization of the problem of designing safety aspects for finite-state programs while ensuring the reachability of states from where liveness is met, where safety stipulates that nothing bad ever happens, and liveness states that something good will eventually happen in program computations.
An Automata-Theoretic Approach for Model-Checking Systems with Unspecified Components
TLDR
In this approach, some model-checking problems concerning a component-based system are first reduced to the emptiness problem of an oracle finite automaton, which is then solved by testing the unspecified components on-the-fly with test-cases generated automatically from the oracle infinite automaton.
Formal verification of projection-based software systems
TLDR
A formal model of the composition mechanisms used in projection-based languages was developed, and this model serves as the semantic basis for C3, a language for formally specifying the composition of projections.
A Constraint-based Approach to Open Feature Verification
TLDR
This thesis presents a new methodology based on constraint-generation that is simpler and less expensive than the original and supports both client-side and producer-side notions of compositional feature verification.