{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:13:24Z","timestamp":1750220004372,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3540250.3549157","type":"proceedings-article","created":{"date-parts":[[2022,11,9]],"date-time":"2022-11-09T20:46:22Z","timestamp":1668026782000},"page":"620-632","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Parasol: efficient parallel synthesis of large model spaces"],"prefix":"10.1145","author":[{"given":"Clay","family":"Stevens","sequence":"first","affiliation":[{"name":"University of Nebraska-Lincoln, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Bagheri","sequence":"additional","affiliation":[{"name":"University of Nebraska-Lincoln, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3395363.3397347"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3179294"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39071-5_23"},{"key":"e_1_3_2_1_4_1","volume-title":"Predicting Learnt Clauses Quality in Modern SAT Solvers. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence","author":"Audemard Gilles","year":"2009","unstructured":"Gilles Audemard and Laurent Simon . 2009 . Predicting Learnt Clauses Quality in Modern SAT Solvers. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence , Pasadena, California, USA , July 11-17, 2009, Craig Boutilier (Ed.). 399\u2013404. http:\/\/ijcai.org\/Proceedings\/09\/Papers\/074.pdf Gilles Audemard and Laurent Simon. 2009. Predicting Learnt Clauses Quality in Modern SAT Solvers. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, Craig Boutilier (Ed.). 399\u2013404. http:\/\/ijcai.org\/Proceedings\/09\/Papers\/074.pdf"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213018400018"},{"key":"e_1_3_2_1_6_1","unstructured":"Authors. 2020. Project website. https:\/\/sites.google.com\/view\/parallel-exploration\/home \t\t\t\t  Authors. 2020. Project website. https:\/\/sites.google.com\/view\/parallel-exploration\/home"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950337"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568291"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2016.2587646"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-020-09932-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2019.2940145"},{"key":"e_1_3_2_1_12_1","volume-title":"HordeSat: A Massively Parallel Portfolio SAT Solver. CoRR, abs\/1505.03340","author":"Balyo Tom\u00e1s","year":"2015","unstructured":"Tom\u00e1s Balyo , Peter Sanders , and Carsten Sinz . 2015. HordeSat: A Massively Parallel Portfolio SAT Solver. CoRR, abs\/1505.03340 ( 2015 ), arxiv:1505.03340. arxiv:1505.03340 Tom\u00e1s Balyo, Peter Sanders, and Carsten Sinz. 2015. HordeSat: A Massively Parallel Portfolio SAT Solver. CoRR, abs\/1505.03340 (2015), arxiv:1505.03340. arxiv:1505.03340"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"e_1_3_2_1_14_1","volume-title":"YalSAT Entering the SAT Competition","author":"Biere Armin","year":"2017","unstructured":"Armin Biere . 2017. CaDiCaL, Lingeling, Plingeling, Treengeling , YalSAT Entering the SAT Competition 2017 . In Proc. of SAT Competition 2017 \u2013 Solver and Benchmark Descriptions, Tom\u00e1\u0161 Balyo, Marijn Heule, and Matti J\u00e4rvisalo (Eds.) (Department of Computer Science Series of Publications B , Vol. B-2017-1). University of Helsinki, 14\u2013 15 . Armin Biere. 2017. CaDiCaL, Lingeling, Plingeling, Treengeling, YalSAT Entering the SAT Competition 2017. In Proc. of SAT Competition 2017 \u2013 Solver and Benchmark Descriptions, Tom\u00e1\u0161 Balyo, Marijn Heule, and Matti J\u00e4rvisalo (Eds.) (Department of Computer Science Series of Publications B, Vol. B-2017-1). University of Helsinki, 14\u201315."},{"key":"e_1_3_2_1_15_1","volume-title":"Schmerl","author":"C\u00e1mara Javier","year":"2017","unstructured":"Javier C\u00e1mara , David Garlan , and Bradley R . Schmerl . 2017 . Synthesis and Quantitative Verification of Tradeoff Spaces for Families of Software Systems. In Proceedings of ECSA. Javier C\u00e1mara, David Garlan, and Bradley R. Schmerl. 2017. Synthesis and Quantitative Verification of Tradeoff Spaces for Families of Software Systems. In Proceedings of ECSA."},{"key":"e_1_3_2_1_16_1","volume-title":"Tradespace Exploration: Promise and Limits. In Disciplinary Convergence in Systems Engineering Research, Azad M","author":"Collopy Paul D.","year":"2018","unstructured":"Paul D. Collopy . 2018 . Tradespace Exploration: Promise and Limits. In Disciplinary Convergence in Systems Engineering Research, Azad M . Madni, Barry Boehm, Roger G. Ghanem, Daniel Erwin, and Marilee J. Wheaton (Eds.). Springer International Publishing , 297\u2013307. isbn:978-3-319-62217-0 Paul D. Collopy. 2018. Tradespace Exploration: Promise and Limits. In Disciplinary Convergence in Systems Engineering Research, Azad M. Madni, Barry Boehm, Roger G. Ghanem, Daniel Erwin, and Marilee J. Wheaton (Eds.). Springer International Publishing, 297\u2013307. isbn:978-3-319-62217-0"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96145-3_3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_19_1","unstructured":"Django Foundation. 2020. Django website. https:\/\/www.djangoproject.com\/ \t\t\t\t  Django Foundation. 2020. Django website. https:\/\/www.djangoproject.com\/"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-NIER.2019.00036"},{"key":"e_1_3_2_1_21_1","unstructured":"Steve Ebersole Gail Badner Andrea Boriero and Sanne Grinovero. 2020. Hibernate website. https:\/\/hibernate.org\/orm\/ \t\t\t\t  Steve Ebersole Gail Badner Andrea Boriero and Sanne Grinovero. 2020. Hibernate website. https:\/\/hibernate.org\/orm\/"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC-PICom-DataCom-CyberSciTec.2016.89"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09823-4_66"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119655.1119658"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2013.15"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190070"},{"key":"e_1_3_2_1_27_1","unstructured":"David Heinemeier Hansson. 2020. Ruby on Rails website. https:\/\/rubyonrails.org\/ \t\t\t\t  David Heinemeier Hansson. 2020. Ruby on Rails website. https:\/\/rubyonrails.org\/"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2019.00018"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/505145.505149"},{"key":"e_1_3_2_1_30_1","volume-title":"Software Abstractions","author":"Jackson D.","unstructured":"D. Jackson . 2012. Software Abstractions ( 2 nd ed.). MIT Press . D. Jackson. 2012. Software Abstractions (2nd ed.). MIT Press.","edition":"2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21292-5_3"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 12th National Conference on Artificial Intelligence","author":"Kim Sun","year":"1994","unstructured":"Sun Kim and Hantao Zhang . 1994. ModGen: Theorem Proving by Model Generation . In Proceedings of the 12th National Conference on Artificial Intelligence , Seattle, WA, USA , July 31 - August 4, 1994 , Volume 1 , Barbara Hayes-Roth and Richard E. Korf (Eds.). AAAI Press \/ The MIT Press , 162\u2013167. http:\/\/www.aaai.org\/Library\/AAAI\/1994\/aaai94-025.php Sun Kim and Hantao Zhang. 1994. ModGen: Theorem Proving by Model Generation. In Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31 - August 4, 1994, Volume 1, Barbara Hayes-Roth and Richard E. Korf (Eds.). AAAI Press \/ The MIT Press, 162\u2013167. http:\/\/www.aaai.org\/Library\/AAAI\/1994\/aaai94-025.php"},{"volume-title":"Domain Analysis of E-Commerce Systems Using Feature-Based Model Templates. Master\u2019s thesis","author":"Lau Sean Quan","key":"e_1_3_2_1_33_1","unstructured":"Sean Quan Lau . 2006. Domain Analysis of E-Commerce Systems Using Feature-Based Model Templates. Master\u2019s thesis . University of Waterloo . Sean Quan Lau. 2006. Domain Analysis of E-Commerce Systems Using Feature-Based Model Templates. Master\u2019s thesis. University of Waterloo."},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of FPL. 1\u20138.","author":"Liu Dong","year":"2016","unstructured":"Dong Liu and Benjamin Carri\u00f3n Sch\u00e4fer . 2016 . Efficient and reliable High-Level Synthesis Design Space Explorer for FPGAs . In Proceedings of FPL. 1\u20138. Dong Liu and Benjamin Carri\u00f3n Sch\u00e4fer. 2016. Efficient and reliable High-Level Synthesis Design Space Explorer for FPGAs. In Proceedings of FPL. 1\u20138."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63046-5_10"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2013.252"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2019.00045"},{"key":"e_1_3_2_1_38_1","volume-title":"The Margrave Tool for Firewall Analysis. In Uncovering the Secrets of System Administration: Proceedings of the 24th Large Installation System Administration Conference, LISA 2010","author":"Nelson Timothy","year":"2010","unstructured":"Timothy Nelson , Christopher Barratt , Daniel J. Dougherty , Kathi Fisler , and Shriram Krishnamurthi . 2010 . The Margrave Tool for Firewall Analysis. In Uncovering the Secrets of System Administration: Proceedings of the 24th Large Installation System Administration Conference, LISA 2010 , San Jose, CA, USA , November 7-12, 2010, Rudi van Drunen (Ed.). USENIX Association. https:\/\/www.usenix.org\/conference\/lisa10\/margrave-tool-firewall-analysis Timothy Nelson, Christopher Barratt, Daniel J. Dougherty, Kathi Fisler, and Shriram Krishnamurthi. 2010. The Margrave Tool for Firewall Analysis. In Uncovering the Secrets of System Administration: Proceedings of the 24th Large Installation System Administration Conference, LISA 2010, San Jose, CA, USA, November 7-12, 2010, Rudi van Drunen (Ed.). USENIX Association. https:\/\/www.usenix.org\/conference\/lisa10\/margrave-tool-firewall-analysis"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2013.6606569"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699417"},{"key":"e_1_3_2_1_41_1","unstructured":"Oracle. 2019. Java Tutorials \u2013 Parallelism. https:\/\/docs.oracle.com\/javase\/tutorial\/collections\/streams\/parallelism.html \t\t\t\t  Oracle. 2019. Java Tutorials \u2013 Parallelism. https:\/\/docs.oracle.com\/javase\/tutorial\/collections\/streams\/parallelism.html"},{"key":"e_1_3_2_1_42_1","volume-title":"Moore","author":"Pelleg Dan","year":"2000","unstructured":"Dan Pelleg and Andrew W . Moore . 2000 . X-means : Extending K-means with Efficient Estimation of the Number of Clusters. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29 - July 2, 2000, Pat Langley (Ed.). Morgan Kaufmann , 727\u2013734. Dan Pelleg and Andrew W. Moore. 2000. X-means: Extending K-means with Efficient Estimation of the Number of Clusters. In Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29 - July 2, 2000, Pat Langley (Ed.). Morgan Kaufmann, 727\u2013734."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-95582-7_34"},{"key":"e_1_3_2_1_44_1","volume-title":"Towards making formal methods normal: meeting developers where they are. CoRR, abs\/2010.16345","author":"Reid Alastair","year":"2020","unstructured":"Alastair Reid , Luke Church , Shaked Flur , Sarah de Haas , Maritza Johnson , and Ben Laurie . 2020. Towards making formal methods normal: meeting developers where they are. CoRR, abs\/2010.16345 ( 2020 ), arXiv:2010.16345. arxiv:2010.16345 Alastair Reid, Luke Church, Shaked Flur, Sarah de Haas, Maritza Johnson, and Ben Laurie. 2020. Towards making formal methods normal: meeting developers where they are. CoRR, abs\/2010.16345 (2020), arXiv:2010.16345. arxiv:2010.16345"},{"key":"e_1_3_2_1_45_1","volume-title":"Nazareno Aguirre, Sarfraz Khurshid, and Marcelo F. Frias.","author":"Rosner Nicol\u00e1s","year":"2013","unstructured":"Nicol\u00e1s Rosner , Junaid Haroon Siddiqui , Nazareno Aguirre, Sarfraz Khurshid, and Marcelo F. Frias. 2013 . Ranger : Parallel analysis of alloy models by range partitioning. In Proceedings of ASE. Nicol\u00e1s Rosner, Junaid Haroon Siddiqui, Nazareno Aguirre, Sarfraz Khurshid, and Marcelo F. Frias. 2013. Ranger: Parallel analysis of alloy models by range partitioning. In Proceedings of ASE."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.2514\/1.9204"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133210"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.485845"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-49669-2_4"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2014.03.072"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380365"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534399"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359591.3359726"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32409-4_21"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-022-00660-4"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39031-9_17"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71209-1_49"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68237-0_22"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2018.03.006"}],"event":{"name":"ESEC\/FSE '22: 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","NUS NUS"],"location":"Singapore Singapore","acronym":"ESEC\/FSE '22"},"container-title":["Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3540250.3549157","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3540250.3549157","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:02Z","timestamp":1750182662000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3540250.3549157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":59,"alternative-id":["10.1145\/3540250.3549157","10.1145\/3540250"],"URL":"https:\/\/doi.org\/10.1145\/3540250.3549157","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}