skip to main content
10.1145/2364412.2364424acmotherconferencesArticle/Chapter ViewAbstractPublication PagessplcConference Proceedingsconference-collections
research-article

Towards an executable algebra for product lines

Published:02 September 2012Publication History

ABSTRACT

We propose the Controlled Language for Software Product Lines CL4SPL with the twofold aim of ensuring simplicity of use for product line engineers and safe translations to executable languages amenable for automated verification. We show an implementation of CL4SPL in Maude, a well-known rewrite engine, thus allowing formal analyses over product families specified with CL4SPL. We illustrate our approach with a toy family of coffee machines.

References

  1. P. Asirelli, M. H. ter Beek, A. Fantechi, and S. Gnesi. A Logical Framework to Deal with Variability. In IFM'10. LNCS 6396, Springer, 2010, 43--58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. P. Asirelli, M. H. ter Beek, A. Fantechi, and S. Gnesi. Formal Description of Variability in Product Families. In SPLC'11. IEEE, 2011, 130--139. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Baier and J.-P. Katoen. Principles of Model Checking. MIT Press, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. M. H. ter Beek, A. Fantechi, S. Gnesi, and F. Mazzanti. A state/event-based model-checking approach for the analysis of abstract system properties. Science of Computer Programming 76, 2 (2011), 119--135. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. M. H. ter Beek, F. Mazzanti, and A. Sulova. VMC: A Tool for Product Variability Analysis. In FM'12. LNCS 7436, Springer, 2012, 450--454.Google ScholarGoogle ScholarCross RefCross Ref
  6. A. Classen, M. Cordy, P. Heymans, A. Legay, and P.-Y. Schobbens. Model Checking Software Product Lines with SNIP. To appear in Software Tools for Technology Transfer, 2012.Google ScholarGoogle Scholar
  7. A. Classen, P. Heymans, P.-Y. Schobbens, and A. Legay. Symbolic Model Checking of Software Product Lines. In ICSE'11. ACM, 2011, 321--330. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Classen, P. Heymans, P.-Y. Schobbens, A. Legay, and J.-F. Raskin. Model Checking Lots of Systems. In ICSE'10. ACM, 2010, 335--344. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Clavel et al, Eds. All About Maude. LNCS 4350, Springer, 2007.Google ScholarGoogle Scholar
  10. D. Fischbein, S. Uchitel, and V. A. Braberman. A Foundation for Behavioural Conformance in Software Product Line Architectures. In ROSATEA'06. ACM, 2006, 39--48. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. Gondal, M. Poppleton, and M. Butler. Composing Event-B Specifications - Case-Study Experience. In SC'11. LNCS 6708, Springer, 2011, 100--115. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. Gruler, M. Leucker, and K. D. Scheidemann. Modelling and Model Checking Software Product Lines. In FMOODS'08. LNCS 5051, Springer, 2008, 113--131. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Hennessy and R. Milner. On Observing Nondeterminism and Concurrency. In ICALP'80. LNCS 85, Springer, 1980, 299--309. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T. Käkölä and J. C. Dueñas, Eds. Software Product Lines. Springer, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  15. K. Kang, S. Choen, J. Hess, W. Novak, and S. Peterson. Feature Oriented Domain Analysis (FODA) Feasibility Study. TR SEI-90-TR-21. CMU, 1990.Google ScholarGoogle Scholar
  16. K. G. Larsen, U. Nyman, and A. Wąsowski. Modal I/O Automata for Interface and Product Line Theories. In ESOP'07. LNCS 4421, Springer, 2007, 64--79. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. K. Lauenroth, K. Pohl, and S. Töhning. Model Checking of Domain Artifacts in Product Line Engineering. In ASE'09. IEEE, 2009, 269--280. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. N. Martí-Oliet. An Introduction to Maude and Some of Its Applications. In PADL'10. LNCS 5937, Springer, 2010, 4--9. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. I. Matteucci, M. Petrocchi, and M. L. Sbodio. CNL4DSA: a Controlled Natural Language for Data Sharing Agreements. In SAC'10. ACM, 2010, 616--620. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. I. Matteucci, M. Petrocchi, M. L. Sbodio, and L. Wiegand. A design phase for data sharing agreements. In DPM'11. LNCS 7122, Springer, 2011, 25--41. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. R. Milner. Communication and Concurrency. Prentice Hall, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. R. Muschevici, D. Clarke, and J. Proença. Feature Petri Nets. In FMSPLE'10. Univ. of Lancaster, 2010.Google ScholarGoogle Scholar
  23. K. Pohl, G. Böckle, and F. van der Linden. Software Product Line Engineering: Foundations, Principles, and Techniques. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. C. Stirling. Modal and Temporal Logics for Processes. In 8th Banff Higher Order Workshop 1995. LNCS 1043, Springer, 1996, 149--237. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. A. Verdejo and N. Martí-Oliet. Implementing CCS in Maude 2. In WRLA'02. ENTCS 71, 2002, 282--300. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. T. Ziadi and J. M. Jézéquel. Product Line Engineering with the UML: Deriving Products. In SPLC'06. Springer, 2006, 557--588.Google ScholarGoogle Scholar

Index Terms

  1. Towards an executable algebra for product lines

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Other conferences
                SPLC '12: Proceedings of the 16th International Software Product Line Conference - Volume 2
                September 2012
                287 pages
                ISBN:9781450310956
                DOI:10.1145/2364412

                Copyright © 2012 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 2 September 2012

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article

                Acceptance Rates

                Overall Acceptance Rate167of463submissions,36%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader