A superimposition control construct for distributed systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal logic (vol. 1): mathematical foundations and computational aspects
Temporal logic (vol. 1): mathematical foundations and computational aspects
Using SPIN for feature interaction analysis—a case study
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
Feature integration using a feature construct
Science of Computer Programming
Feature Interactions in Telecommunications and Software Systems VI
Feature Interactions in Telecommunications and Software Systems VI
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Games for synthesis of controllers with partial observation
Theoretical Computer Science - Logic and complexity in computer science
Automata logics, and infinite games
Managing evolution in software product lines: a model-checking perspective
Proceedings of the Sixth International Workshop on Variability Modeling of Software-Intensive Systems
Synthesis of hierarchical systems
Science of Computer Programming
| Hi-index | 0.00 |
We describe an algorithmic method for the synthesis of features. The method takes as input a base system, a triggering condition for the feature, a set of system variables which the feature is allowed to update, and a requirement on the result of integrating it. It computes whether a feature of the given form and with the desired property exists and, if so, a construction of it. The method is based on the theory of infinite parity games.