{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:36:36Z","timestamp":1775018196627,"version":"3.50.1"},"reference-count":33,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1134\/s036176882570015x","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T09:29:50Z","timestamp":1752571790000},"page":"262-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Programming for Automatic User Interface Construction"],"prefix":"10.1134","volume":"51","author":[{"given":"P. A.","family":"Lozov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. S.","family":"Kosarev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. Yu.","family":"Boulytchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2025,7,15]]},"reference":[{"key":"3945_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11558569_9","volume-title":"The architect\u2019s dilemma\u2014Will reference architectures help?, Quality of Software Architectures and Software Quality","author":"M. Haft","year":"2005","unstructured":"Haft, M., Humm, B., and Siedersleben, J., The architect\u2019s dilemma\u2014Will reference architectures help?, Quality of Software Architectures and Software Quality, Reussner, R., Mayer, J., Stafford, J.A., Overhage, S., Becker, S., and Schroeder, P.J., Eds., Lecture Notes in Computer Science, vol. 3712, Berlin: Springer, 2005, pp. 106\u2013122. https:\/\/doi.org\/10.1007\/11558569_9"},{"key":"3945_CR2","unstructured":"ISO 9241-210:2019: Ergonomics of Human-System Interaction\u2014Part 210: Human-Centred Design for Interactive Systems, International Organization for Standardization, 2019."},{"key":"3945_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.destud.2011.06.005","volume":"33","author":"E. Gerber","year":"2012","unstructured":"Gerber, E. and Carroll, M., The psychological experience of prototyping, Des. Stud., 2012, vol. 33, no. 1, pp.\u00a064\u201384. https:\/\/doi.org\/10.1016\/j.destud.2011.06.005","journal-title":"Des. Stud."},{"key":"3945_CR4","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5801.001.0001","volume-title":"The Reasoned Schemer","author":"D.P. Friedman","year":"2005","unstructured":"Friedman, D.P., Byrd, W.E., and Kiselyov, O., The Reasoned Schemer, Cambridge, MA: The MIT Press, 2005. https:\/\/doi.org\/10.7551\/mitpress\/5801.001.0001"},{"key":"3945_CR5","unstructured":"Lozov, P., Verbitskaia, E., and Boulytchev, D., Relational interpreters for search problems, miniKanren and Relational Programming Workshop, Berlin, 2019, Byrd, W.E. and Amin, N., Eds., Harvard Computer Science Group, 2019."},{"key":"3945_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Z3: An efficient SMT solver, Tools and Algorithms for the Construction and Analysis of Systems","author":"L. De Moura","year":"2008","unstructured":"De Moura, L. and Bj\u00f8rner, N., Z3: An efficient SMT solver, Tools and Algorithms for the Construction and Analysis of Systems, Ramakrishnan, C.R. and Rehof, J., Eds., Lecture Notes in Computer Science, vol. 4963, Berlin: Springer, 2008, pp. 337\u2013340. https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"3945_CR7","unstructured":"Bengfort, J., Thin vs. thick vs. zero client: What\u2019s the right fit for your business?, 2024. https:\/\/biztechmagazine.com\/article\/2018\/10\/thin-vs-thick-vs-zero-client-whats-right-fit-your-business-perfcon. Cited November 10, 2024."},{"key":"3945_CR8","unstructured":"IntelliJ platform UI guidelines: Layout, 2000\u20132022. https:\/\/jetbrains.github.io\/ui\/principles\/layout. Cited November 10, 2024."},{"key":"3945_CR9","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, A Series of Books in the Mathematical Sciences, vol. 174, San Francisco: Freeman, 1979."},{"key":"3945_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/eptcs.285.1","volume":"285","author":"D. Kosarev","year":"2016","unstructured":"Kosarev, D. and Boulytchev, D., Typed embedding of a relational language in OCaml, Electronic Proceedings in Theoretical Computer Science, 2016, vol. 285, pp. 1\u201322. https:\/\/doi.org\/10.4204\/eptcs.285.1","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"3945_CR11","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/1090189.1086390","volume":"40","author":"O. Kiselyov","year":"2005","unstructured":"Kiselyov, O., Shan, C.-C., Friedman, D.P., and Sabry, A., Backtracking, interleaving, and terminating monad transformers, ACM SIGPLAN Notices, 2005, vol. 40, no. 9, pp. 192\u2013203. https:\/\/doi.org\/10.1145\/1090189.1086390","journal-title":"ACM SIGPLAN Notices"},{"key":"3945_CR12","doi-asserted-by":"publisher","unstructured":"Rozplokhas, D., Vyatkin, A., and Boulytchev, D., Certified semantics for relational programming, Programming Languages and Systems, Oliveira, B.C.d.S., Ed., Lecture Notes in Computer Science, vol. 12470, Cham: Springer, 2020, pp. 167\u2013185. https:\/\/doi.org\/10.1007\/978-3-030-64437-6_9","DOI":"10.1007\/978-3-030-64437-6_9"},{"key":"3945_CR13","volume-title":"Disunification: A survey, Computational Logic\u2014Essays in Honor of Alan Robinson","author":"H. Comon","year":"1991","unstructured":"Comon, H., Disunification: A survey, Computational Logic\u2014Essays in Honor of Alan Robinson, MIT Press, 1991, pp. 322\u2013359."},{"key":"3945_CR14","unstructured":"Alvis, C.E., Willcock, J.J., Carter, K.M., Byrd, W.E., and Friedman, D.P., cKanren: miniKanren with constraints, Proceedings of the 2011 Annual Workshop on Scheme and Functional Programming, 2011."},{"key":"3945_CR15","unstructured":"Byrd, W.E. and Friedman, D.P., \u03b1Kanren: A fresh name in nominal logic programming, Proceedings of the 2007 Workshop on Scheme and Functional Programming, 2007."},{"key":"3945_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/s0129054101000448","volume":"12","author":"S. Abramov","year":"2001","unstructured":"Abramov, S. and Gl\u00fcck, R., From standard to non-standard semantics by semantics modifiers, Int. J. Found. Comput. Sci., 2001, vol. 12, no. 2, pp. 171\u2013211. https:\/\/doi.org\/10.1142\/s0129054101000448","journal-title":"Int. J. Found. Comput. Sci."},{"key":"3945_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44450-5_16","volume-title":"Combining semantics with non-standard interpreter hierarchies, FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science","author":"S. Abramov","year":"2000","unstructured":"Abramov, S. and Gl\u00fcck, R., Combining semantics with non-standard interpreter hierarchies, FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science, Kapoor, S. and Prasad, S., Eds., Lecture Notes in Computer Science, vol. 1974, Berlin: Springer, 2000, pp. 201\u2013213. https:\/\/doi.org\/10.1007\/3-540-44450-5_16"},{"key":"3945_CR18","doi-asserted-by":"publisher","unstructured":"Byrd, W.E., Holk, E., and Friedman, D.P., miniKanren, live and untagged: Quine generation via relational interpreters (programming pearl), Proceedings of the Annual Workshop on Scheme and Functional Programming, Copenhagen, 2012, New York: Association for Computing Machinery, 2012, pp. 8\u201329. https:\/\/doi.org\/10.1145\/2661103.2661105","DOI":"10.1145\/2661103.2661105"},{"key":"3945_CR19","doi-asserted-by":"publisher","unstructured":"Byrd, W.E., Ballantyne, M., Rosenblatt, G., and Might, M., A unified approach to solving seven programming problems (functional pearl), Proc. ACM Program. Lang., 2017, vol. 1, no. icfp, p. 8. https:\/\/doi.org\/10.1145\/3110252","DOI":"10.1145\/3110252"},{"key":"3945_CR20","doi-asserted-by":"publisher","unstructured":"Kosarev, D., Lozov, P., and Boulytchev, D., Relational synthesis for pattern matching, Programming Languages and Systems, Oliveira, B.C.d.S., Ed., Lecture Notes in Computer Science, vol. 12470, Cham: Springer, 2020, pp. 293\u2013310. https:\/\/doi.org\/10.1007\/978-3-030-64437-6_15","DOI":"10.1007\/978-3-030-64437-6_15"},{"key":"3945_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/fmcad.2016.7886661","volume-title":"Minimal unsatisfiable core extraction for SMT, 2016 Formal Methods in Computer-Aided Design (FMCAD)","author":"O. Guthmann","year":"2016","unstructured":"Guthmann, O., Strichman, O., and Trostanetski, A., Minimal unsatisfiable core extraction for SMT, 2016 Formal Methods in Computer-Aided Design (FMCAD), Mountain View, CA, IEEE, 2016, pp. 57\u201364. https:\/\/doi.org\/10.1109\/fmcad.2016.7886661"},{"key":"3945_CR22","unstructured":"React: A JavaScript Library for Building User Interfaces, Meta Platforms. https:\/\/reactjs.org\/. Cited November 10, 2024."},{"key":"3945_CR23","unstructured":"Jetpack Compose. Android Developers. https:\/\/developer.android.com\/compose. Cited November 10, 2024."},{"key":"3945_CR24","unstructured":"Streamlit framework site. https:\/\/docs.streamlit.io. Cited November 10, 2024."},{"key":"3945_CR25","unstructured":"Streamlit layouts and containers. https:\/\/docs.streamlit.io\/develop\/api-reference\/layout. Cited November 10, 2024."},{"key":"3945_CR26","doi-asserted-by":"publisher","unstructured":"Borning, A., Wallingford: Toward a constraint reactive programming language, Companion Proceedings of the 15th International Conference on Modularity, Malaga, Spain, 2016, New York: Association for Computing Machinery, 2016, pp. 45\u201349. https:\/\/doi.org\/10.1145\/2892664.2892667","DOI":"10.1145\/2892664.2892667"},{"key":"3945_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/504704.504705","volume":"8","author":"G.J. Badros","year":"2001","unstructured":"Badros, G.J., Borning, A., and Stuckey, P.J., The Cassowary linear arithmetic constraint solving algorithm, ACM Transactions on Computer-Human Interaction, 2001, vol. 8, no. 4, pp. 267\u2013306. https:\/\/doi.org\/10.1145\/504704.504705","journal-title":"ACM Transactions on Computer-Human Interaction"},{"key":"3945_CR28","doi-asserted-by":"publisher","first-page":"20329","DOI":"10.1038\/s41598-023-46500-6","volume":"13","author":"B. Cai","year":"2023","unstructured":"Cai, B., Luo, J., and Feng, Zh., A novel code generator for graphical user interfaces, Sci. Rep., 2023, vol. 13, no.\u00a01, p. 20329. https:\/\/doi.org\/10.1038\/s41598-023-46500-6","journal-title":"Sci. Rep."},{"key":"3945_CR29","doi-asserted-by":"publisher","unstructured":"Bielik, P., Fischer, M., and Vechev, M., Robust relational layout synthesis from examples for Android, Proc. ACM Program. Lang., 2018, vol. 2, no. oopsla, p.\u00a0156. https:\/\/doi.org\/10.1145\/3276526","DOI":"10.1145\/3276526"},{"key":"3945_CR30","unstructured":"Android ConstraintLayout widget. https:\/\/developer.android.com\/reference\/androidx\/constraintlayout\/widget\/ConstraintLayout. Cited November 10, 2024."},{"key":"3945_CR31","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/3490034","volume":"12","author":"L. Br\u00fcckner","year":"2022","unstructured":"Br\u00fcckner, L., Leiva, L.A., and Oulasvirta, A., Learning GUI completions with user-defined constraints, ACM Trans. Interactive Intell. Syst., 2022, vol. 12, no. 1, p. 6. https:\/\/doi.org\/10.1145\/3490034","journal-title":"ACM Trans. Interactive Intell. Syst."},{"key":"3945_CR32","doi-asserted-by":"publisher","unstructured":"Shiripour, M., Dayama, N.R., and Oulasvirta, A., Grid-based genetic operators for graphical layout generation, Proceedings of the ACM on Human-Computer Interaction, 2021, vol. 5, no. eics, p. 208. https:\/\/doi.org\/10.1145\/3461730","DOI":"10.1145\/3461730"},{"key":"3945_CR33","doi-asserted-by":"publisher","unstructured":"Swearngin, A., Wang, Ch., Oleson, A., Fogarty, J., and Ko, A.J., Scout: Rapid exploration of interface layout alternatives through high-level design constraints, Proceedings of the 2020 CHI Conference on Human Factors in Computing Systems, Honolulu, HI, 2020, New York: Association for Computing Machinery, 2020, pp. 1\u201313. https:\/\/doi.org\/10.1145\/3313831.3376593","DOI":"10.1145\/3313831.3376593"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S036176882570015X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S036176882570015X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S036176882570015X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:50:54Z","timestamp":1775011854000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S036176882570015X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,15]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["3945"],"URL":"https:\/\/doi.org\/10.1134\/s036176882570015x","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,15]]},"assertion":[{"value":"12 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}