{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:49:25Z","timestamp":1725702565049},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642340253"},{"type":"electronic","value":"9783642340260"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34026-0_11","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T01:07:20Z","timestamp":1348621640000},"page":"131-145","source":"Crossref","is-referenced-by-count":13,"title":["A Formal Approach to Software Product Families"],"prefix":"10.1007","author":[{"given":"Martin","family":"Leucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Thoma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/11901433_41","volume-title":"Formal Methods and Software Engineering","author":"A. Bauer","year":"2006","unstructured":"Bauer, A., Leucker, M., Streit, J.: SALT\u2014Structured Assertion Language for Temporal Logic. In: Liu, Z., Kleinberg, R.D. (eds.) ICFEM 2006. LNCS, vol.\u00a04260, pp. 757\u2013775. Springer, Heidelberg (2006)"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1145\/136586.136587","volume":"1","author":"D. Batory","year":"1992","unstructured":"Batory, D., O\u2019Malley, S.: The design and implementation of hierarchical software systems with reusable components. ACM Transactions on Software Engineering and Methodology\u00a01(4), 355\u2013398 (1992)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"11_CR3","unstructured":"Czarnecki, K., Eisenecker, U.W.: Generative Programming: Methods, Tools, and Applications. Addison-Wesley (2000)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-04761-9_22","volume-title":"Automated Technology for Verification and Analysis","author":"A. Campetelli","year":"2009","unstructured":"Campetelli, A., Gruler, A., Leucker, M., Thoma, D.: Don\u2019t Know for Multi-valued Systems. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 289\u2013305. Springer, Heidelberg (2009)"},{"key":"11_CR5","first-page":"321","volume-title":"Proceedings of the 33rd International Conference on Software Engineering, ICSE 2011","author":"A. Classen","year":"2011","unstructured":"Classen, A., Heymans, P., Schobbens, P.-Y., Legay, A.: Symbolic model checking of software product lines. In: Proceedings of the 33rd International Conference on Software Engineering, ICSE 2011, pp. 321\u2013330. ACM, New York (2011)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(94)90269-0","volume":"126","author":"M. Dam","year":"1994","unstructured":"Dam, M.: CTL* and ECTL* as fragments of the modal \u03bc-calculus. Theoretical Computer Science\u00a0126(1), 77\u201396 (1994)","journal-title":"Theoretical Computer Science"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C.S., Sistla, A.P.: On Model-Checking for Fragments of \u03bc-Calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"11_CR8","first-page":"267","volume-title":"LICS 1986: Proceedings of the 1st Annual Symposium on Logic in Computer Science","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Lei, C.L.: Efficient model checking in fragments of the propositional \u03bc-calculus. In: LICS 1986: Proceedings of the 1st Annual Symposium on Logic in Computer Science, pp. 267\u2013278. IEEE Computer Society Press, Washington, D.C., USA (1986)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-68863-1_8","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"A. Gruler","year":"2008","unstructured":"Gruler, A., Leucker, M., Scheidemann, K.: Modeling and Model Checking Software Product Lines. In: Barthe, G., de Boer, F.S. (eds.) FMOODS 2008. LNCS, vol.\u00a05051, pp. 113\u2013131. Springer, Heidelberg (2008)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/11813040_21","volume-title":"FM 2006: Formal Methods","author":"P. H\u00f6fner","year":"2006","unstructured":"H\u00f6fner, P., Khedri, R., M\u00f6ller, B.: Feature Algebra. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol.\u00a04085, pp. 300\u2013315. Springer, Heidelberg (2006)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10270-009-0127-2","volume":"10","author":"P. H\u00f6fner","year":"2011","unstructured":"H\u00f6fner, P., Khedri, R., M\u00f6ller An, B.: algebra of product families. Software and Systems Modeling\u00a010, 161\u2013182 (2011) 10.1007\/s10270-009-0127-2","journal-title":"Software and Systems Modeling"},{"key":"11_CR12","unstructured":"Sholom, G., Cohen Kyo, C., Kang, J.A., Hess, W.E.: Novak, and A.\u00a0Spencer Peterson. Feature oriented design analysis (FODA) feasibility study. Technical Report CMU\/SEI-90-TR-21-ESD-90\/TR-222, Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA (1990)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11562948_27","volume-title":"Automated Technology for Verification and Analysis","author":"S. Shoham","year":"2005","unstructured":"Shoham, S., Grumberg, O.: Multi-valued Model Checking Games. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 354\u2013369. Springer, Heidelberg (2005)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Schobbens, P.-Y., Heymans, P., Trigaux, J.-C.: Feature diagrams: A survey and a formal semantics. In: 14th IEEE International Requirements Engineering Conference RE 2006, pp. 139\u2013148 (2006)","DOI":"10.1109\/RE.2006.23"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60218-6_1","volume-title":"CONCUR \u201995 Concurrency Theory","author":"C. Stirling","year":"1995","unstructured":"Stirling, C.: Local Model Checking Games. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 1\u201311. Springer, Heidelberg (1995)"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Wirsing, M.: Algebraic specification. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B), pp. 675\u2013788 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50018-4"},{"key":"11_CR19","unstructured":"Wolper, P.: A translation from full branching time temporal logic to one letter propositional dynamic logic with looping (unpublished manuscript)"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34026-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:41:12Z","timestamp":1620132072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34026-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642340253","9783642340260"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34026-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}