{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T09:03:54Z","timestamp":1774602234195,"version":"3.50.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031081286","type":"print"},{"value":"9783031081293","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08129-3_4","type":"book-chapter","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T14:34:11Z","timestamp":1655130851000},"page":"59-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":[": A Tool to\u00a0Transform Feature Models with\u00a0Numerical Features and\u00a0Arithmetic Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1398-9423","authenticated-orcid":false,"given":"Daniel-Jesus","family":"Munoz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeho","family":"Oh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5376-742X","authenticated-orcid":false,"given":"Monica","family":"Pinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5677-7156","authenticated-orcid":false,"given":"Lidia","family":"Fuentes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Batory","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Agh, H., Garc\u00eda, F., Piattini, M.: A checklist for the evaluation of software process line approaches. Inf. Softw. Technol. 146(1) (2022)","DOI":"10.1016\/j.infsof.2022.106864"},{"key":"4_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37521-7","volume-title":"Feature-oriented Software Product Lines","author":"S Apel","year":"2016","unstructured":"Apel, S., Batory, D., K\u00e4stner, C., Saake, G.: Feature-oriented Software Product Lines. Springer, NY (2016). https:\/\/doi.org\/10.1007\/978-3-642-37521-7"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Barrett, C.: Decision procedures: an algorithmic point of view, by Daniel Kroening and Ofer Strichman,Springer-Verlag, 2008. J. Autom. Reasoning 51(4), 453\u2013456 (2013)","DOI":"10.1007\/s10817-013-9295-4"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Barrett, C., Tinelli, C.: Satisfiability Modulo Theories (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_11","DOI":"10.1007\/978-3-319-10575-8_11"},{"key":"4_CR5","unstructured":"Batory, D.: Automated Software Design, vol. 1 (2021). Lulu.com"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-19440-5_7","volume-title":"Software Language Engineering","author":"K B\u0105k","year":"2011","unstructured":"B\u0105k, K., Czarnecki, K., W\u0105sowski, A.: Feature and meta-models in Clafer: mixed, specialized, and coupled. In: Malloy, B., Staab, S., van den Brand, M. (eds.) SLE 2010. LNCS, vol. 6563, pp. 102\u2013122. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19440-5_7"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Benavides, D., Segura, S., Ruiz-Cort\u00e9s, A.: Automated analysis of feature models 20 years later: a literature review. Inf. Syst. 35(6), 615\u2013636 (2010)","DOI":"10.1016\/j.is.2010.01.001"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Berger, T., She, S., Lotufo, R., Wa\u0327sowski, A., Czarnecki, K.: A study of variability models and languages in the systems software domain. IEEE TSE 39(12), 1611\u20131640 (2013)","DOI":"10.1109\/TSE.2013.34"},{"key":"4_CR9","volume-title":"Handbook of Satisfiability","author":"A Biere","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability. IOS Press, Amsterdam (2009)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-00768-2_16","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Brummayer","year":"2009","unstructured":"Brummayer, R., Biere, A.: Boolector: an efficient SMT solver for bit-vectors and arrays. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 174\u2013177. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_16"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-71209-1_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"RE Bryant","year":"2007","unstructured":"Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.: Deciding bit-vector arithmetic with abstraction. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 358\u2013372. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_28"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-319-10575-8_7","volume-title":"Handbook of Model Checking","author":"RE Bryant","year":"2018","unstructured":"Bryant, R.E.: Binary decision diagrams. In: Handbook of Model Checking, pp. 191\u2013217. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_7"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., et al.: Approximate model counting. FRONTIERS (2021)","DOI":"10.3233\/FAIA201010"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Chistikov, D., Dimitrova, R., Majumdar, R.: Approximate counting in SMT and value estimation for probabilistic programs. Acta Informatica 54(8) (2017)","DOI":"10.1007\/s00236-017-0297-2"},{"key":"4_CR15","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-030-79186-5_16","volume-title":"Enterprise, Business-Process and Information Systems Modeling","author":"V D\u00f6ller","year":"2021","unstructured":"D\u00f6ller, V., Karagiannis, D.: Formalizing conceptual modeling methods with MetaMorph. In: Augusto, A., Gill, A., Nurcan, S., Reinhartz-Berger, I., Schmidt, R., Zdravkovic, J. (eds.) BPMDS\/EMMSAD -2021. LNBIP, vol. 421, pp. 245\u2013261. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79186-5_16"},{"key":"4_CR16","unstructured":"Ganesh, V., Dill, D.: The Simple Theorem Prover (STP) solver (2006). https:\/\/stp.github.io\/"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Henard, C., Papadakis, M., Harman, M., Traon, Y.L.: Combining multi-objective search and constraint solving for configuring large software product lines. In: SPLC. IEEE Press (2015)","DOI":"10.1109\/ICSE.2015.69"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Horcas, J., Pinto, M., Fuentes, L.: Variability models for generating efficient configurations of functional quality attributes. IST J. 95 (2018)","DOI":"10.1016\/j.infsof.2017.10.018"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Horcas, J., Pinto, M., Fuentes, L.: Extensible and modular abstract syntax for feature modeling based on language constructs. In: SPLC. ACM (2020)","DOI":"10.1145\/3382025.3414959"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"K\u00e4stner, C., et al.: Variability-aware parsing in the presence of lexical macros and conditional compilation. In: OOPSLA, vol. 46. IEEE\/ACM (2011)","DOI":"10.1145\/2076021.2048128"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Liang, J., Ganesh, V., Czarnecki, K., Raman, V.: SAT-based analysis of large real-world feature models is easy. In: SPLC. IEEE\/ACM (2015)","DOI":"10.1145\/2791060.2791070"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Marchezan, L., Rodrigues, E., Assun\u00e7\u00e3o, W.K.G., Bernardino, M., Basso, F.P., Carbonell, J.: Software product line scoping: a systematic literature review. J. Syst. Softw. 186 (2022)","DOI":"10.1016\/j.jss.2021.111189"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-030-79382-1_24","volume-title":"Advanced Information Systems Engineering","author":"D-J Munoz","year":"2021","unstructured":"Munoz, D.-J., Gurov, D., Pinto, M., Fuentes, L.: Category theory framework for variability models with non-functional requirements. In: La Rosa, M., Sadiq, S., Teniente, E. (eds.) CAiSE 2021. LNCS, vol. 12751, pp. 397\u2013413. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79382-1_24"},{"issue":"11","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/s00607-018-0632-7","volume":"100","author":"DJ Munoz","year":"2018","unstructured":"Munoz, D.J., Pinto, M., Fuentes, L.: Finding correlations of features affecting energy consumption and performance of web servers using the HADAS eco-assistant. Computing 100(11), 1155\u20131173 (2018)","journal-title":"Computing"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Munoz, D., Oh, J., Pinto, M., Fuentes, L., Batory, D.: Uniform random sampling product configurations of feature models that have numerical features. In: SPLC (2019)","DOI":"10.1145\/3336294.3336297"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Munoz, D., Pinto, M., Fuentes, L.: HADAS: analysing quality attributes of software configurations. In: SPLC, SPLC 2019. ACM (2019)","DOI":"10.1145\/3307630.3342385"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Oh, J., Batory, D., Myers, M., Siegmund, N.: Finding near-optimal configurations in product lines by random sampling. In: ESEC\/FSE (2017)","DOI":"10.1145\/3106237.3106273"},{"key":"4_CR29","unstructured":"Oh, J., Gazillo, P., Batory, D., Heule, M., Myers, M.: Uniform Sampling from Kconfig Feature Models. Technical report, TR-19-02, University of Texas at Austin, Department of Computer Science (2019)"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Pett, T., Th\u00fcm, T., Runge, T., Krieter, S., Lochau, M., Schaefer, I.: Product sampling for product lines: the scalability challenge. In: SPLC, SPLC 2019. Association for Computing Machinery (2019)","DOI":"10.1145\/3336294.3336322"},{"key":"4_CR31","unstructured":"Phan, Q.: Model counting modulo theories. Ph.D. thesis, Queen Mary University of London, April 2015"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Heradio, R., Fernandez-Amoros, D., Galindo, J., Benavides, D., Batory, D.: Uniform and scalable sampling of highly configurable systems. Empir. Softw. Eng. 27, 44 (2022)","DOI":"10.1007\/s10664-021-10102-5"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Raatikainen, M., Tiihonen, J., Mannisto, T.: Software product lines and variability modeling: a tertiary study. J. Syst. Softw. 149, 485\u2013510 (2019)","DOI":"10.1016\/j.jss.2018.12.027"},{"key":"4_CR34","unstructured":"Rossi, F., Beek, P.V., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)"},{"key":"4_CR35","unstructured":"Schmitt, A., Wiersch, S., Weis, S.: Glencoe-a Visualization Prototyping Framework. In: ICCE (2015)"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Shi, K.: Combining evolutionary algorithms with constraint solving for configuration optimization. In: ICSME. IEEE\/ACM, September 2017","DOI":"10.1109\/ICSME.2017.32"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Siegmund, N., Grebhahn, A., Apel, S., K\u00e4stner, C.: Performance-influence models for highly configurable systems. In: FSE. ACM, New York (2015)","DOI":"10.1145\/2786805.2786845"},{"key":"4_CR38","unstructured":"Sorensson, N., Een, N.: Minisat v1. 13-a SAT solver with conflict-clause minimization. SAT 2005(53), 1\u201312 (2005)"},{"key":"4_CR39","doi-asserted-by":"crossref","unstructured":"Sundermann, C., Nieke, M., Bittner, P.M., He\u00df, T., Th\u00fcm, T., Schaefer, I.: Applications of #SAT solvers on feature models. In: VaMoS. ACM (2021)","DOI":"10.1145\/3442391.3442404"},{"key":"4_CR40","unstructured":"Surveysystem.com: Sample Size Calc. https:\/\/www.surveysystem.com\/sscalc.htm"},{"key":"4_CR41","doi-asserted-by":"crossref","unstructured":"Th\u00fcm, T., et al.: FeatureIDE: an extensible framework for feature-oriented software development. Sci. Comput. Program. 79, 70\u201385 (2014)","DOI":"10.1016\/j.scico.2012.06.002"},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11814948_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 counting models with advanced component caching and implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 424\u2013429. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_38"},{"key":"4_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28","volume-title":"Automation of Reasoning: 2: Classical Papers on Computational Logic 1967\u20131970","author":"G Tseitin","year":"1983","unstructured":"Tseitin, G.: On the complexity of derivation in propositional calculus. In: Siekmann, J., Wrightson, G. (eds.) Automation of Reasoning: 2: Classical Papers on Computational Logic 1967\u20131970. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/978-3-642-81955-1_28"}],"container-title":["Lecture Notes in Computer Science","Reuse and Software Quality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08129-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T14:35:02Z","timestamp":1655130902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08129-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031081286","9783031081293"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08129-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software and Software Reuse","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montpellier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icsr2022.wp.imt.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}