{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:33:05Z","timestamp":1777606385221,"version":"3.51.4"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"crossref","award":["1954\/23, SPECTACKLE"],"award-info":[{"award-number":["1954\/23, SPECTACKLE"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2026,4,30]]},"abstract":"<jats:p>Writing formal specifications is an important yet challenging aspect of software engineering. Correct specifications facilitate verification efforts and reduce bugs. However, the declarative nature of specifications differs from the imperative approach of most common programming languages, and software engineers often perceive formal methods as difficult. Arguably, guidelines and tools for writing readable specifications should lower the barrier to formal methods adoption.<\/jats:p>\n                  <jats:p>In this work, we focus on Boolean formulas, a fundamental building block of specifications. Analogous to research on code comprehension, we conducted an experiment that attempts to identify what properties affect Boolean formula comprehension by software engineers. To this end, we collected 59 representative Boolean formulas and tested how various syntactic properties, such as negation symbol count and nesting level, affect comprehension task response times and correctness. Our experiment with 181 participants shows that eliminating negation symbols and decreasing operator count are among the most significant factors that improve comprehension. We use these empirical results to derive a reading complexity score and develop a fast regression-based refactoring algorithm for Boolean formulas. Finally, we conducted a follow-up experiment with 57 participants, which provided strong evidence for the algorithm\u2019s effectiveness in improving comprehension.<\/jats:p>","DOI":"10.1145\/3744557","type":"journal-article","created":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:22:44Z","timestamp":1749727364000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["What Properties Affect Boolean Formula Comprehension in Formal Specifications?"],"prefix":"10.1145","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8628-230X","authenticated-orcid":false,"given":"Ilia","family":"Shevrin","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4022-5349","authenticated-orcid":false,"given":"Shahar","family":"Maoz","sequence":"additional","affiliation":[{"name":"Computer Science and AI, Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,12]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-018-9628-3"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/221232"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/571922.571962"},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2017.27"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2019.00033"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(95)00043-7"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2017.18"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-012-9201-4"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2593489.2593491"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(83)80031-5"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.06.011"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3639474.3640050"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2018.2859926"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66197-1_11"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41010-9_5"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3196321.3196342"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-13188-2_9"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/302405.302672"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-022-10160-3"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/32.485225"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-sen:19990600"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(98)00003-X"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/SANER.2017.7884657"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.22152\/programming-journal.org\/2023\/7\/7"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60583-5"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-017-9579-0"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/2133797.2133800"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10664-018-9621-x"},{"key":"e_1_3_3_30_2","volume-title":"Software Abstractions - Logic, Language, and Analysis","author":"Jackson D.","year":"2006","unstructured":"D. Jackson. 2006. Software Abstractions - Logic, Language, and Analysis. MIT Press."},{"key":"e_1_3_3_31_2","unstructured":"S. Jacobs G. A. P\u00e9rez R. Abraham V. Bruy\u00e8re M. Cadilhac M. Colange C. Delfosse T. van Dijk A. Duret-Lutz P. Faymonville et al. 2022. The reactive synthesis competition (SYNTCOMP): 2018-2021. arXiv:2206.00251. Retrieved from https:\/\/dblp.org\/rec\/journals\/sttt\/JacobsPABCCDDDFFKKLMMPR24.html?view=bibtex"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSME.2019.00085"},{"key":"e_1_3_3_33_2","unstructured":"F. Kordon P. Bouvier H. Garavel F. Hulin-Hubard N. Amat E. Amparore B. Berthomieu D. Donatelli S. Dal Zilio P. Jensen et al. 2022. Complete Results for the 2022 Edition of the Model Checking Contest. Retrieved from http:\/\/mcc.lip6.fr\/2022\/results.php"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30942-8_1"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27660-6_8"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2006.51"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/FormaliSE58978.2023.00013"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10270-021-00868-z"},{"key":"e_1_3_3_39_2","first-page":"39","volume-title":"Proceedings of the 2nd Workshop on Interactive Natural Language Technology for Explainable Artificial Intelligence (NL4XAI@INGL \u201920)","author":"Mayn A.","year":"2020","unstructured":"A. Mayn and K. van Deemter. 2020. Towards generating effective explanations of logical formulas: Challenges and strategies. In Proceedings of the 2nd Workshop on Interactive Natural Language Technology for Explainable Artificial Intelligence (NL4XAI@INGL \u201920). J. M. Alonso and A. Catal\u00e1 (Eds.), Association for Computational Linguistics, 39\u201343."},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233837"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1984732.1984742"},{"key":"e_1_3_3_42_2","first-page":"270","volume-title":"Proceedings of the IFIP 13th World Computer Congress on Linkage and Developing Countries, Information Processing \u201994","author":"Parnas D. L.","year":"1994","unstructured":"D. L. Parnas. 1994. Inspection of safety-critical software using program-function tables. In Proceedings of the IFIP 13th World Computer Congress on Linkage and Developing Countries, Information Processing \u201994. K. A. Duncan and K. H. Krueger (Eds.), IFIP Transactions, volume A-53, 270\u2013277."},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1952.11988183"},{"key":"e_1_3_3_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48869-1_2"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE-Companion58688.2023.00097"},{"issue":"3","key":"e_1_3_3_46_2","first-page":"219","article-title":"Syntactic\/semantic interactions in programmer behavior: A model and experimental results","volume":"8","author":"Shneiderman B.","year":"1979","unstructured":"B. Shneiderman and R. E. Mayer. 1979. Syntactic\/semantic interactions in programmer behavior: A model and experimental results. International Journal of Parallel Programming 8, 3 (1979), 219\u2013238.","journal-title":"International Journal of Parallel Programming"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2004.04.003"},{"key":"e_1_3_3_48_2","volume-title":"The Z notation -\n                  A\n                  reference manual\n                  Prentice Hall International Series in Computer Science","author":"Spivey J. M.","year":"1989","unstructured":"J. M. Spivey. 1989. The Z notation - A reference manual. Prentice Hall International Series in Computer Science. Prentice Hall."},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2008.4493342"},{"key":"e_1_3_3_50_2","volume-title":"Evaluating Formal Specifications : A Cognitive Approach","author":"Vinter R. J.","year":"1998","unstructured":"R. J. Vinter. 1998. Evaluating Formal Specifications : A Cognitive Approach. Ph.D. thesis, University of Hertfordshire, United Kingdom."},{"key":"e_1_3_3_51_2","unstructured":"Old Dominion University. 2023. Identities. Retrieved March 14 2024 from https:\/\/www.cs.odu.edu\/~toida\/nerzic\/content\/logic\/prop_logic\/identities\/identities.html"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/BotSE.2019.00015"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3626522"}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3744557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:07:43Z","timestamp":1773328063000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3744557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,12]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4,30]]}},"alternative-id":["10.1145\/3744557"],"URL":"https:\/\/doi.org\/10.1145\/3744557","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,12]]},"assertion":[{"value":"2024-12-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}