Author:
Li Harry C.,Krishnamurthi Shriram,Fisler Kathi
Publisher
Springer Science and Business Media LLC
Reference39 articles.
1. Abadi, Martin and Lamport, Leslie. 1995. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534.
2. Alur, R., Grosu, R., and McDougall, M. 2000. Efficient reachability analysis of hierarchic reactive machines. In International Conference on Computer-Aided Verification. volume 1855 of Lecture Notes in Computer Science. Springer-Verlag, pp. 280–295.
3. Alur, R. and Yannakakis, M. 1998. Model checking of hierarchical state machines. In Symposium on the Foundations of Software Engineering, pp. 175–188.
4. Areces, C., Bouma, W., and de Rijke, M. 2000. Feature interaction as a satisfiability problem. In M. Calder and E. Magill, editors, Feature Interactions in Telecommunications Systems. IOS Press.
5. Astesiano, E. and Reggio, G. 1998. A discipline for handling feature interaction. In Requirements Targeting Software and Systems Engineering, number 1526 in Lecture Notes in Computer Science, Springer-Verlag, pp. 95–119.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Exploring feature interactions without specifications: a controlled experiment;ACM SIGPLAN Notices;2020-04-07
2. Towards functional verifying a family of systemC TLMs;Frontiers of Computer Science;2019-03-07
3. Exploring feature interactions without specifications: a controlled experiment;Proceedings of the 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences;2018-11-05
4. Feature interaction in software product line engineering: A systematic mapping study;Information and Software Technology;2018-06
5. VarXplorer;Proceedings of the 12th International Workshop on Variability Modelling of Software-Intensive Systems;2018-02-07