{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:39:02Z","timestamp":1783010342224,"version":"3.54.6"},"reference-count":98,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T00:00:00Z","timestamp":1688169600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1750399"],"award-info":[{"award-number":["CCF-1750399"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Wallenberg Artificial Intelligence, Autonomous Systems and Software Program"},{"DOI":"10.13039\/501100004063","name":"Knut och Alice Wallenbergs Stiftelse","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004063","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swedish Foundation for Strategic Research"},{"name":"Swedish National Infrastructure for Computing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IIEEE Trans. Software Eng."],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1109\/tse.2023.3271065","type":"journal-article","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T17:48:56Z","timestamp":1682617736000},"page":"3771-3792","source":"Crossref","is-referenced-by-count":10,"title":["Self-Supervised Learning to Prove Equivalence Between Straight-Line Programs via Rewrite Rules"],"prefix":"10.1109","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1447-5993","authenticated-orcid":false,"given":"Steve","family":"Kommrusch","sequence":"first","affiliation":[{"name":"Colorado State University, Fort Collins, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3505-3383","authenticated-orcid":false,"given":"Martin","family":"Monperrus","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5103-3097","authenticated-orcid":false,"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[{"name":"Colorado State University, Fort Collins, CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref57","article-title":"Isabelle page","author":"paulson","year":"2022"},{"key":"ref56","author":"bertot","year":"2013","journal-title":"Interactive Theorem Proving and Program Development Coq'Art The Calculus of Inductive Constructions"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.21236\/ADA461052"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54415-1_54"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45231-8_41"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10936-7_11"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3409757"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314596"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45706-2_40"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82599-X"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3238147.3238178"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49430-8_3"},{"key":"ref48","article-title":"Scaling laws for neural language models","author":"kaplan","year":"2020"},{"key":"ref47","article-title":"Proving equivalence between complex expressions using graph-to-sequence neural models","author":"kommrusch","year":"2021"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45014-9_1"},{"key":"ref41","article-title":"An empirical investigation of catastrophic forgetting in gradient-based neural networks","author":"goodfellow","year":"2013"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/spe.774"},{"key":"ref43","first-page":"5048","article-title":"Hindsight experience replay","author":"andrychowicz","year":"2017","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/2362389.2362390"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3377555.3377893"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349314"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2655046"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_44"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-008-0075-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80003-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2287718.2287726"},{"key":"ref40","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc 3rd Int Conf Learn Representations"},{"key":"ref35","first-page":"1943","article-title":"SequenceR: Sequence-to-sequence learning for end-to-end program repair","volume":"47","author":"chen","year":"2019","journal-title":"IEEE Trans Softw Eng"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2012.6227135"},{"key":"ref37","article-title":"Google's neural machine translation system: Bridging the gap between human and machine translation","author":"wu","year":"2016"},{"key":"ref36","first-page":"3104","article-title":"Sequence to sequence learning with neural networks","author":"sutskever","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref31","first-page":"454","article-title":"HOList: An environment for machine learning of higher order logic theorem proving","author":"bansal","year":"2019","journal-title":"Proc 36th Int Conf Mach Learn"},{"key":"ref30","first-page":"4179","article-title":"Learning dynamic polynomial proofs","author":"fawzi","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","article-title":"Properties of matrix multiplication","author":"khan","year":"2020"},{"key":"ref32","article-title":"Graph representations for higher-order logic and theorem proving","author":"paliwal","year":"2019"},{"key":"ref39","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/K16-1028"},{"key":"ref24","author":"muchnick","year":"1997","journal-title":"Advanced Compiler Design Implementation"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2002.998286"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2272536"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349314"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1512475.1512477"},{"key":"ref22","article-title":"Machine learning for computer aided programming: From stochastic program repair to verifiable program equivalence","author":"kommrusch","year":"2021"},{"key":"ref21","article-title":"Equivalence of dataflow graphs via rewrite rules using a graph-to-sequence neural model","author":"kommrusch","year":"2020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462187"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2837614.2837656"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71237-6_7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/800028.808480"},{"key":"ref12","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISVDAT.2014.6881061"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446751"},{"key":"ref97","first-page":"27865","article-title":"Self-supervised bug detection and repair","author":"allamanis","year":"2021","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462840"},{"key":"ref11","first-page":"67","article-title":"Open NMT: Open-source toolkit for neural machine translation","author":"klein","year":"2017","journal-title":"Proc Conf Assoc Comput Linguistics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3428239"},{"key":"ref98","article-title":"Learning from self-sampled correct and partially-correct programs","author":"ni","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/322358.322373"},{"key":"ref16","article-title":"S4Eq software","author":"kommrusch","year":"2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26408-0_8"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.1999.809452"},{"key":"ref93","first-page":"105","article-title":"Dynamic construction of finite automata from examples using hill-climbing","author":"tomita","year":"1982","journal-title":"Proc 4th Annu Conf Cogn Sci Soc"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01111"},{"key":"ref95","article-title":"Efficient framework for learning code representations through semantic-preserving program transformations","author":"bui","year":"2020"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2021.106552"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/3460945.3464951"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2022.3147265"},{"key":"ref89","first-page":"2933","article-title":"PHOG: Probabilistic model for code","author":"bielik","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2019.00064"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/3340544"},{"key":"ref88","article-title":"Context2name: A deep learning-based approach to infer natural variable names from usage contexts","author":"bavishi","year":"2017"},{"key":"ref87","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/2676726.2677009","article-title":"Predicting program properties from “big code","author":"raychev","year":"2015","journal-title":"Proc 42nd Annu ACM SIGPLAN-SIGACT Symp Princ Program Lang"},{"key":"ref82","article-title":"Generative language modeling for automated theorem proving","author":"polu","year":"2020"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i7.16780"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/3290353"},{"key":"ref83","first-page":"81:1","article-title":"A survey of machine learning for big code and naturalness","volume":"51","author":"allamanis","year":"2018","journal-title":"ACM Comput Surveys"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i6.16634"},{"key":"ref79","article-title":"Hypertree proof search for neural theorem proving","author":"lample","year":"2022"},{"key":"ref78","article-title":"Deep learning for symbolic mathematics","author":"lample","year":"2020","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3025954"},{"key":"ref74","article-title":"Exploring the possibilities of applying transfer learning methods for natural language processing in software development","author":"ding","year":"2021"},{"key":"ref77","article-title":"Decision transformer: Reinforcement learning via sequence modeling","author":"chen","year":"2021"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.3389\/frai.2021.590215"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80027-9"},{"key":"ref1","author":"goodfellow","year":"2016","journal-title":"Deep Learning"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/MSR52588.2021.00084"},{"key":"ref70","article-title":"Probabilistic theorem proving","author":"gogate","year":"2012"},{"key":"ref73","article-title":"Neural program repair with execution-based backpropagation","author":"ye","year":"2021"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.3390\/e22111190"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_15"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3434304"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_8"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25935-0_13"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14052-5_26"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51081-8_121"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-014-0319-6"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022920129859"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/1516507.1516509"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_33"}],"container-title":["IEEE Transactions on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/32\/10185148\/10109816-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/32\/10185148\/10109816.pdf?arnumber=10109816","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T18:06:09Z","timestamp":1691431569000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10109816\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":98,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tse.2023.3271065","relation":{},"ISSN":["0098-5589","1939-3520","2326-3881"],"issn-type":[{"value":"0098-5589","type":"print"},{"value":"1939-3520","type":"electronic"},{"value":"2326-3881","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7]]}}}