A core calculus for dynamic delta-oriented programming
Delta-oriented programming is a flexible strategy for implementation of software product lines (SPLs). The SPL is a family of software systems that are developed by using or reusing common artifacts. The paper introduces to dynamic delta-oriented programming in detail and provides many schemata. The product line dynamic reconfiguration graph is presented and analyzed very carefully. An example illustrating the main concepts of dynamic delta-oriented programming is discussed step by step. The authors present a formal foundation of dynamic delta-oriented programming and so it is possible to switch the implemented product configuration at runtime.
- Towards a calculus for dynamic architectures
- scientific article; zbMATH DE number 512961
- A calculus of refinements for program derivations
- A lambda-calculus for dynamic binding
- The -calculus: syntax and types
- A calculus of program adaption and its applications
- Automata, Languages and Programming
- A calculus of coroutines
- An Overview of CaesarJ
- Compositional type checking of delta-oriented software product lines
- Delegation by object composition
- scientific article; zbMATH DE number 1728246 (Why is no real title available?)
- Incremental model-based testing of delta-oriented software product lines
- On flexible dynamic trait replacement for Java-like languages
- Refined effects for unanticipated object re-classification: \(\mathcal{F}{\mathit ickle}_{3}\) (extended abstract)
- Software Product Line Engineering
- Transactions on Aspect-Oriented Software Development VI. Special issue on aspects and model-driven engineering
Uses Software
This page was built for publication: A core calculus for dynamic delta-oriented programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647772)