Goharshady A, Hitarth S, Mohammadi F and Motwani H. (2023). Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs. Proceedings of the ACM on Programming Languages. 7:OOPSLA1. (727-756). Online publication date: 6-Apr-2023.

Hozzová P, Kovács L, Norman C and Voronkov A. (2023). Program Synthesis in Saturation. Automated Deduction – CADE 29. 10.1007/978-3-031-38499-8_18. (307-324).

https://link.springer.com/10.1007/978-3-031-38499-8_18

Wild A and Porter B. (2022). Multi-donor Neural Transfer Learning for Genetic Programming. ACM Transactions on Evolutionary Learning and Optimization. 2:4. (1-40). Online publication date: 31-Dec-2022.

https://doi.org/10.1145/3563043

Steinhöfel D. (2022). Ever Change a Running System: Structured Software Reengineering Using Automatically Proven-Correct Transformation Rules. Ernst Denert Award for Software Engineering 2020. 10.1007/978-3-030-83128-8_10. (197-226).

https://link.springer.com/10.1007/978-3-030-83128-8_10

Krasanakis E and Symeonidis A. (2021). Defining behaviorizeable relations to enable inference in semi-automatic program synthesis. Journal of Logical and Algebraic Methods in Programming. 10.1016/j.jlamp.2021.100714. 123. (100714). Online publication date: 1-Nov-2021.

https://linkinghub.elsevier.com/retrieve/pii/S2352220821000778

Rahmani K, Raza M, Gulwani S, Le V, Morris D, Radhakrishna A, Soares G and Tiwari A. (2021). Multi-modal program inference: a marriage of pre-trained language models and component-based synthesis. Proceedings of the ACM on Programming Languages. 5:OOPSLA. (1-29). Online publication date: 20-Oct-2021.

https://doi.org/10.1145/3485535

Drămnesc I and Jebelean T. : Deductive Synthesis of Sorting Algorithms in Theorema . Theoretical Aspects of Computing – ICTAC 2021. (314-333).

https://doi.org/10.1007/978-3-030-85315-0_18

Houshmand F, Lesani M and Vora K. (2021). Grafs: declarative graph analytics. Proceedings of the ACM on Programming Languages. 5:ICFP. (1-32). Online publication date: 22-Aug-2021.

https://doi.org/10.1145/3473588

Scott J, Sudula T, Rehman H, Mora F and Ganesh V. (2021). BanditFuzz: Fuzzing SMT Solvers with Multi-agent Reinforcement Learning. Formal Methods. 10.1007/978-3-030-90870-6_6. (103-121).

https://link.springer.com/10.1007/978-3-030-90870-6_6

Itzhaky S, Peleg H, Polikarpova N, Rowe R and Sergey I. (2021). Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities. Computer Aided Verification. 10.1007/978-3-030-81685-8_5. (110-134).

https://link.springer.com/10.1007/978-3-030-81685-8_5

Humenberger A and Kovács L. (2021). Algebra-Based Synthesis of Loops and Their Invariants (Invited Paper). Verification, Model Checking, and Abstract Interpretation. 10.1007/978-3-030-67067-2_2. (17-28).

http://link.springer.com/10.1007/978-3-030-67067-2_2

Drămnesc I and Jebelean T. (2020). Synthesis of Sorting Algorithms Using Multisets in Theorema. Journal of Logical and Algebraic Methods in Programming. 10.1016/j.jlamp.2020.100635. (100635). Online publication date: 1-Dec-2020.

https://linkinghub.elsevier.com/retrieve/pii/S2352220820301206

Kahani N, Bagherzadeh M and Cordy J. Synthesis of state machine models. Proceedings of the 23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems. (274-284).

https://doi.org/10.1145/3365438.3410936

Dramnesc I and Jebelean T. (2020). Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema 2020 IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI). 10.1109/SACI49304.2020.9118814. 978-1-7281-7377-1. (000165-000172).

https://ieeexplore.ieee.org/document/9118814/

Costea A, Zhu A, Polikarpova N and Sergey I. Concise Read-Only Specifications for Better Synthesis of Programs with Pointers. Programming Languages and Systems. (141-168).

https://doi.org/10.1007/978-3-030-44914-8_6

Subahi A. (2020). Cognification of Program Synthesis—A Systematic Feature-Oriented Analysis and Future Direction. Computers. 10.3390/computers9020027. 9:2. (27).

https://www.mdpi.com/2073-431X/9/2/27

Steinhöfel D. (2020). REFINITY to Model and Prove Program Transformation Rules. Programming Languages and Systems. 10.1007/978-3-030-64437-6_16. (311-319).

http://link.springer.com/10.1007/978-3-030-64437-6_16

Humenberger A, Bjørner N and Kovács L. (2020). Algebra-Based Loop Synthesis. Integrated Formal Methods. 10.1007/978-3-030-63461-2_24. (440-459).

http://link.springer.com/10.1007/978-3-030-63461-2_24

Ish-Shalom O, Itzhaky S, Rinetzky N and Shoham S. (2020). Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction. Verification, Model Checking, and Abstract Interpretation. 10.1007/978-3-030-39322-9_6. (112-135).

http://link.springer.com/10.1007/978-3-030-39322-9_6

Varanasi S, Salazar E, Mittal N and Gupta G. Synthesizing Imperative Code from Answer Set Programming Specifications. Logic-Based Program Synthesis and Transformation. (75-89).

https://doi.org/10.1007/978-3-030-45260-5_5

Varanasi S. (2019). Imperative Program Synthesis from Answer Set Programs. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.306.55. 306. (413-417).

http://arxiv.org/abs/1909.09058v1

Li H, Wang Y, Yin J and Tan G. (2019). SmartShell: Automated Shell Scripts Synthesis from Natural Language. International Journal of Software Engineering and Knowledge Engineering. 10.1142/S0218194019500098. 29:02. (197-220). Online publication date: 1-Feb-2019.

https://www.worldscientific.com/doi/abs/10.1142/S0218194019500098

Steinhöfel D and Hähnle R. (2019). Abstract Execution. Formal Methods – The Next 30 Years. 10.1007/978-3-030-30942-8_20. (319-336).

http://link.springer.com/10.1007/978-3-030-30942-8_20

Ginsbach P, Crawford L and O'Boyle M. CAnDL: a domain specific language for compiler analysis. Proceedings of the 27th International Conference on Compiler Construction. (151-162).

https://doi.org/10.1145/3178372.3179515

Andon P, Doroshenko A, Zhereb K and Yatsenko O. (2018). Algebra-Algorithmic Models and Methods of Parallel Programing

http://akademperiodyka.org.ua/en/node/682

Farzan A and Kincaid Z. (2017). Strategy synthesis for linear arithmetic games. Proceedings of the ACM on Programming Languages. 2:POPL. (1-30). Online publication date: 1-Jan-2018.

https://doi.org/10.1145/3158149

Fine S, Hemberg E, Krawiec K and O’Reilly U. (2018). Exploiting Subprograms in Genetic Programming. Genetic Programming Theory and Practice XV. 10.1007/978-3-319-90512-9_1. (1-16).

http://link.springer.com/10.1007/978-3-319-90512-9_1

Fisher J and Woodhouse S. (2017). Program synthesis meets deep learning for decoding regulatory networks. Current Opinion in Systems Biology. 10.1016/j.coisb.2017.07.006. 4. (64-70). Online publication date: 1-Aug-2017.

https://linkinghub.elsevier.com/retrieve/pii/S2452310017300227

Wang D, Jiang Y, Song H, He F, Gu M and Sun J. Verification of Implementations of Cryptographic Hash Functions. IEEE Access. 10.1109/ACCESS.2017.2697918. 5. (7816-7825).

http://ieeexplore.ieee.org/document/7924403/

Nguyen T, Weimer W, Kapur D and Forrest S. (2017). Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-662-54577-5_17. (301-318).

https://link.springer.com/10.1007/978-3-662-54577-5_17

Mota A, Iyoda J and Maranhão H. (2016). Program synthesis by model finding. Information Processing Letters. 116:11. (701-705). Online publication date: 1-Nov-2016.

https://doi.org/10.1016/j.ipl.2016.06.003

Cerone A. (2016). Refinement Mining: Using Data to Sift Plausible Models. Software Technologies: Applications and Foundations. 10.1007/978-3-319-50230-4_3. (26-41).

http://link.springer.com/10.1007/978-3-319-50230-4_3

Lim J and Yoo S. (2016). Field Report: Applying Monte Carlo Tree Search for Program Synthesis. Search Based Software Engineering. 10.1007/978-3-319-47106-8_27. (304-310).

http://link.springer.com/10.1007/978-3-319-47106-8_27

D’Antoni L, Samanta R and Singh R. (2016). Qlose: Program Repair with Quantitative Objectives. Computer Aided Verification. 10.1007/978-3-319-41540-6_21. (383-401).

http://link.springer.com/10.1007/978-3-319-41540-6_21

Fedyukovich G, Gurfinkel A and Sharygina N. Automated Discovery of Simulation BetweenźPrograms. Proceedings of the 20th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - Volume 9450. (606-621).

https://doi.org/10.1007/978-3-662-48899-7_42

Beyene T, Chaudhuri S, Popeea C and Rybalchenko A. Recursive Games for Compositional Program Synthesis. Revised Selected Papers of the 7th International Conference on Verified Software: Theories, Tools, and Experiments - Volume 9593. (19-39).

https://doi.org/10.1007/978-3-319-29613-5_2

Alrajeh D, Kramer J, Russo A and Uchitel S. (2015). Automated support for diagnosis and repair. Communications of the ACM. 58:2. (65-72). Online publication date: 28-Jan-2015.

https://doi.org/10.1145/2658986

Liu C, Zhang J, Zhou H, McDirmid S, Guo Z and Moscibroda T. Automating Distributed Partial Aggregation. Proceedings of the ACM Symposium on Cloud Computing. (1-12).

https://doi.org/10.1145/2670979.2670980

Jha S and Seshia S. (2014). Are There Good Mistakes? A Theoretical Analysis of CEGIS. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.157.10. 157. (84-99).

http://arxiv.org/abs/1407.5397v1

Leike J and Tiwari A. Synthesis for Polynomial Lasso Programs. Proceedings of the 15th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 8318. (434-452).

https://doi.org/10.1007/978-3-642-54013-4_24

Samanta R, Olivo O and Emerson E. (2014). Cost-Aware Automatic Program Repair. Static Analysis. 10.1007/978-3-319-10936-7_17. (268-284).

http://link.springer.com/10.1007/978-3-319-10936-7_17

Chaudhari D and Damani O. (2014). Automated Theorem Prover Assisted Program Calculations. Integrated Formal Methods. 10.1007/978-3-319-10181-1_13. (205-220).

https://link.springer.com/10.1007/978-3-319-10181-1_13

Bodik R and Jobstmann B. (2013). Algorithmic program synthesis. International Journal on Software Tools for Technology Transfer (STTT). 15:5-6. (397-411). Online publication date: 1-Oct-2013.

https://doi.org/10.1007/s10009-013-0287-9

Jacobs S, Kuncak V and Suter P. Reductions for Synthesis Procedures. Proceedings of the 14th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 7737. (88-107).

https://doi.org/10.1007/978-3-642-35873-9_8

Kapur D, Zhang Z, Horbach M, Zhao H, Lu Q and Nguyen T. (2013). Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants. Automated Reasoning and Mathematics. 10.1007/978-3-642-36675-8_11. (189-228).

http://link.springer.com/10.1007/978-3-642-36675-8_11

Singh R and Solar-Lezama A. SPT. Proceedings of the 24th international conference on Computer Aided Verification. (738-743).

https://doi.org/10.1007/978-3-642-31424-7_58

Bjørner N. Taking satisfiability to the next level with z3. Proceedings of the 6th international joint conference on Automated Reasoning. (1-8).

https://doi.org/10.1007/978-3-642-31365-3_1

Nedunuri S, Smith D and Cook W. (2012). Theory and Techniques for Synthesizing Efficient Breadth-First Search Algorithms. FM 2012: Formal Methods. 10.1007/978-3-642-32759-9_27. (308-325).

http://link.springer.com/10.1007/978-3-642-32759-9_27

Shelekhov V. (2012). Verification and synthesis of addition programs under the rules of correctness of statements. Automatic Control and Computer Sciences. 10.3103/S0146411611070121. 45:7. (421-427). Online publication date: 1-Dec-2011.

http://www.springerlink.com/index/10.3103/S0146411611070121

Kuhne U, Grose D and Drechsler R. (2010). Towards Fully Automatic Synthesis of Embedded Software. IEEE Embedded Systems Letters. 2:3. (53-57). Online publication date: 1-Sep-2010.

https://doi.org/10.1109/LES.2010.2049983

Hou X, Zhao Y, Liu Y, Yang Z, Wang K, Li L, Luo X, Lo D, Grundy J and Wang H. (2024). Large Language Models for Software Engineering: A Systematic Literature Review. ACM Transactions on Software Engineering and Methodology. 10.1145/3695988.

https://dl.acm.org/doi/10.1145/3695988

Hozzová P, Amrollahi D, Hajdu M, Kovács L, Voronkov A and Wagner E. Synthesis of Recursive Programs in Saturation. Automated Reasoning. (154-171).

https://doi.org/10.1007/978-3-031-63498-7_10

Steinhöfel D and Hähnle R. (2024). Schematic Program Proofs with Abstract Execution. Journal of Automated Reasoning. 68:2. Online publication date: 1-Jun-2024.

https://doi.org/10.1007/s10817-023-09692-0

Jonáš M and Strejček J. (2024). Truncating Abstraction of Bit-Vector Operations for BDD-based SMT Solvers. Theoretical Computer Science. 10.1016/j.tcs.2024.114664. (114664). Online publication date: 1-May-2024.

https://linkinghub.elsevier.com/retrieve/pii/S0304397524002810

Balasubramanian A, Majumdar R, Thinniyam R and Zetzsche G. (2024). Reachability in Continuous Pushdown VASS. Proceedings of the ACM on Programming Languages. 8:POPL. (90-114). Online publication date: 5-Jan-2024.

https://doi.org/10.1145/3633279

Ding Y and Qiu X. (2024). Enhanced Enumeration Techniques for Syntax-Guided Synthesis of Bit-Vector Manipulations. Proceedings of the ACM on Programming Languages. 8:POPL. (2129-2159). Online publication date: 5-Jan-2024.

https://doi.org/10.1145/3632913

Zhang K, Wang D, Xia J, Wang W and Li L. ALGO. Proceedings of the 37th International Conference on Neural Information Processing Systems. (54769-54784).

/doi/10.5555/3666122.3668511

Barbosa H, Barrett C, Cook B, Dutertre B, Kremer G, Lachnitt H, Niemetz A, Nötzli A, Ozdemir A, Preiner M, Reynolds A, Tinelli C and Zohar Y. (2023). Generating and Exploiting Automated Reasoning Proof Certificates. Communications of the ACM. 66:10. (86-95). Online publication date: 1-Oct-2023.

https://doi.org/10.1145/3587692

Mankowitz D, Michi A, Zhernov A, Gelmi M, Selvi M, Paduraru C, Leurent E, Iqbal S, Lespiau J, Ahern A, Köppe T, Millikin K, Gaffney S, Elster S, Broshear J, Gamble C, Milan K, Tung R, Hwang M, Cemgil T, Barekatain M, Li Y, Mandhane A, Hubert T, Schrittwieser J, Hassabis D, Kohli P, Riedmiller M, Vinyals O and Silver D. (2023). Faster sorting algorithms discovered using deep reinforcement learning. Nature. 10.1038/s41586-023-06004-9. 618:7964. (257-263). Online publication date: 8-Jun-2023.

https://www.nature.com/articles/s41586-023-06004-9

Yang M and Zhang D. (2023). Deep Reinforcement Learning Guided Decision Tree Learning For Program Synthesis 2023 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER). 10.1109/SANER56733.2023.00112. 978-1-6654-5278-6. (925-932).

https://ieeexplore.ieee.org/document/10123608/

Sobania D, Schweim D and Rothlauf F. A Comprehensive Survey on Program Synthesis With Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation. 10.1109/TEVC.2022.3162324. 27:1. (82-97).

https://ieeexplore.ieee.org/document/9743417/

Rothenberg B, Grumberg O, Vizel Y and Singher E. (2023). Condition Synthesis Realizability via Constrained Horn Clauses. NASA Formal Methods. 10.1007/978-3-031-33170-1_23. (380-396).

https://link.springer.com/10.1007/978-3-031-33170-1_23

https://doi.org/10.1145/3563043

Gissurarson M, Applis L, Panichella A, van Deursen A and Sands D. PropR. Proceedings of the 44th International Conference on Software Engineering. (1768-1780).

https://doi.org/10.1145/3510003.3510620

Ozdemir A, Brown F and Wahby R. (2022). CirC: Compiler infrastructure for proof systems, software verification, and more 2022 IEEE Symposium on Security and Privacy (SP). 10.1109/SP46214.2022.9833782. 978-1-6654-1316-9. (2248-2266).

https://ieeexplore.ieee.org/document/9833782/

Humenberger A, Amrollahi D, Bjørner N and Kovács L. (2022). Algebra-Based Reasoning for Loop Synthesis. Formal Aspects of Computing. 34:1. (1-31). Online publication date: 31-Mar-2022.

https://doi.org/10.1145/3527458

Yen J, Lévai T, Ye Q, Ren X, Govindan R and Raghavan B. Semi-automated protocol disambiguation and code generation. Proceedings of the 2021 ACM SIGCOMM 2021 Conference. (272-286).

https://doi.org/10.1145/3452296.3472910

Itzhaky S, Peleg H, Polikarpova N, Rowe R and Sergey I. Cyclic program synthesis. Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation. (944-959).

https://doi.org/10.1145/3453483.3454087

Barrière A, Blazy S, Flückiger O, Pichardie D and Vitek J. (2021). Formally verified speculation and deoptimization in a JIT compiler. Proceedings of the ACM on Programming Languages. 5:POPL. (1-26). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434327

Baumann P, Majumdar R, Thinniyam R and Zetzsche G. (2021). Context-bounded verification of liveness properties for multithreaded shared-memory programs. Proceedings of the ACM on Programming Languages. 5:POPL. (1-31). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434325

Kokologiannakis M, Kaysin I, Raad A and Vafeiadis V. (2021). PerSeVerE: persistency semantics for verification under ext4. Proceedings of the ACM on Programming Languages. 5:POPL. (1-29). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434324

Courant N and Leroy X. (2021). Verified code generation for the polyhedral model. Proceedings of the ACM on Programming Languages. 5:POPL. (1-24). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434321

Gutsfeld J, Müller-Olm M and Ohrem C. (2021). Automata and fixpoints for asynchronous hyperproperties. Proceedings of the ACM on Programming Languages. 5:POPL. (1-29). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434319

Hietala K, Rand R, Hung S, Wu X and Hicks M. (2021). A verified optimizer for Quantum circuits. Proceedings of the ACM on Programming Languages. 5:POPL. (1-29). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434318

Mathur U, Pavlogiannis A and Viswanathan M. (2021). Optimal prediction of synchronization-preserving races. Proceedings of the ACM on Programming Languages. 5:POPL. (1-29). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434317

Kim J, Hu Q, D'Antoni L and Reps T. (2021). Semantics-guided synthesis. Proceedings of the ACM on Programming Languages. 5:POPL. (1-32). Online publication date: 4-Jan-2021.

https://doi.org/10.1145/3434311

(2021). Software Tools for Automated Program Design, Synthesis, and Auto-Tuning. Formal and Adaptive Methods for Automation of Parallel Programs Construction. 10.4018/978-1-5225-9384-3.ch005. (143-179).

http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/978-1-5225-9384-3.ch005

Churchill E. (2020). Reflecting on AI activism. Interactions. 28:1. (26-27). Online publication date: 1-Jan-2021.

https://doi.org/10.1145/3441563

Le H, Mayer S and Henze N. (2020). Deep learning for human-computer interaction. Interactions. 28:1. (78-82). Online publication date: 1-Jan-2021.

https://doi.org/10.1145/3436958

Xu W. (2020). From automation to autonomy and autonomous vehicles. Interactions. 28:1. (48-53). Online publication date: 1-Jan-2021.

https://doi.org/10.1145/3434580

Correia A, Iyoda J and Mota A. (2021). A family of multi-concept program synthesisers in Alloy⁎. Science of Computer Programming. 10.1016/j.scico.2020.102536. 201. (102536). Online publication date: 1-Jan-2021.

https://linkinghub.elsevier.com/retrieve/pii/S0167642320301441

Peleg H, Gabay R, Itzhaky S and Yahav E. (2020). Programming with a read-eval-synth loop. Proceedings of the ACM on Programming Languages. 4:OOPSLA. (1-30). Online publication date: 13-Nov-2020.

https://doi.org/10.1145/3428227

Zhai J, Shi Y, Pan M, Zhou G, Liu Y, Fang C, Ma S, Tan L and Zhang X. C2S: translating natural language comments to formal program specifications. Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. (25-37).

https://doi.org/10.1145/3368089.3409716

Queiroz-Sousa P and Salgado A. (2019). A Review on OLAP Technologies Applied to Information Networks. ACM Transactions on Knowledge Discovery from Data. 14:1. (1-25). Online publication date: 29-Feb-2020.

https://doi.org/10.1145/3370912

Guo Z, James M, Justo D, Zhou J, Wang Z, Jhala R and Polikarpova N. (2019). Program synthesis by type-guided abstraction refinement. Proceedings of the ACM on Programming Languages. 4:POPL. (1-28). Online publication date: 1-Jan-2020.

https://doi.org/10.1145/3371080

Munerman V and Munerman D. (2020). An Axiomatic Approach to the Data Models Formalization for Mass Data Processing 2020 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus). 10.1109/EIConRus49466.2020.9039205. 978-1-7281-5761-0. (1996-2000).

https://ieeexplore.ieee.org/document/9039205/

Si X, Naik A, Dai H, Naik M and Song L. (2020). Code2Inv: A Deep Learning Framework for Program Verification. Computer Aided Verification. 10.1007/978-3-030-53291-8_9. (151-164).

http://link.springer.com/10.1007/978-3-030-53291-8_9

Steinhöfel D and Hähnle R. (2020). The Trace Modality. Dynamic Logic. New Trends and Applications. 10.1007/978-3-030-38808-9_8. (124-140).

http://link.springer.com/10.1007/978-3-030-38808-9_8

Hegde N, Chang Q and Kulkarni M. D2P. Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. (1-22).

https://doi.org/10.1145/3295500.3356205

Sjöberg V, Sang Y, Weng S and Shao Z. (2019). DeepSEA: a language for certified system software. Proceedings of the ACM on Programming Languages. 3:OOPSLA. (1-27). Online publication date: 10-Oct-2019.

https://doi.org/10.1145/3360562

Kapus T, Ish-Shalom O, Itzhaky S, Rinetzky N and Cadar C. Computing summaries of string loops in C for better testing and refactoring. Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. (874-888).

https://doi.org/10.1145/3314221.3314610

Knoth T, Wang D, Polikarpova N and Hoffmann J. Resource-guided program synthesis. Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. (253-268).

https://doi.org/10.1145/3314221.3314602

Cerone A. (2019). Model mining. Journal of Intelligent Information Systems. 52:3. (501-532). Online publication date: 1-Jun-2019.

https://doi.org/10.1007/s10844-017-0474-3

Hua J, Zhang Y, Zhang Y and Khurshid S. (2019). EdSketch. International Journal on Software Tools for Technology Transfer (STTT). 21:3. (249-265). Online publication date: 1-Jun-2019.

https://doi.org/10.1007/s10009-019-00512-8

Fanti G, Venkatakrishnan S, Bakshi S, Denby B, Bhargava S, Miller A and Viswanath P. (2018). Dandelion++. ACM SIGMETRICS Performance Evaluation Review. 46:1. (5-7). Online publication date: 17-Jan-2019.

https://doi.org/10.1145/3292040.3219620

Shi K, Steinhardt J and Liang P. (2019). FrAngel: component-based synthesis with control structures. Proceedings of the ACM on Programming Languages. 3:POPL. (1-29). Online publication date: 2-Jan-2019.

https://doi.org/10.1145/3290386

Polikarpova N and Sergey I. (2019). Structuring the synthesis of heap-manipulating programs. Proceedings of the ACM on Programming Languages. 3:POPL. (1-30). Online publication date: 2-Jan-2019.

https://doi.org/10.1145/3290385

Steinhöfel D and Hähnle R. (2019). Abstract Execution. Formal Methods – The Next 30 Years. 10.1007/978-3-030-30942-8_20. (319-336).

http://link.springer.com/10.1007/978-3-030-30942-8_20

Jonáš M and Strejček J. (2019). Q3B: An Efficient BDD-based SMT Solver for Quantified Bit-Vectors. Computer Aided Verification. 10.1007/978-3-030-25543-5_4. (64-73).

http://link.springer.com/10.1007/978-3-030-25543-5_4

Bł?dek I, Krawiec K and Swan J. (2018). Counterexample-driven genetic programming. Evolutionary Computation. 26:3. (441-469). Online publication date: 1-Sep-2018.

https://doi.org/10.1162/evco_a_00228

Krawiec K, Błądek I, Swan J and Drake J. Counterexample-driven genetic programming. Proceedings of the 27th International Joint Conference on Artificial Intelligence. (5304-5308).

/doi/10.5555/3304652.3304755

Blasi A, Goffi A, Kuznetsov K, Gorla A, Ernst M, Pezzè M and Castellanos S. Translating code comments to procedure specifications. Proceedings of the 27th ACM SIGSOFT International Symposium on Software Testing and Analysis. (242-253).

https://doi.org/10.1145/3213846.3213872

Gottschlich J, Solar-Lezama A, Tatbul N, Carbin M, Rinard M, Barzilay R, Amarasinghe S, Tenenbaum J and Mattson T. The three pillars of machine programming. Proceedings of the 2nd ACM SIGPLAN International Workshop on Machine Learning and Programming Languages. (69-80).

https://doi.org/10.1145/3211346.3211355

Hua J, Zhang M, Wang K and Khurshid S. Towards practical program repair with on-demand candidate generation. Proceedings of the 40th International Conference on Software Engineering. (12-23).

https://doi.org/10.1145/3180155.3180245

Yang Z, Hua J, Wang K and Khurshid S. (2018). EdSynth: Synthesizing API Sequences with Conditionals and Loops 2018 IEEE 11th International Conference on Software Testing, Verification and Validation (ICST). 10.1109/ICST.2018.00025. 978-1-5386-5012-7. (161-171).

https://ieeexplore.ieee.org/document/8367045/

Clochard M, Gondelman L and Pereira M. (2018). The Matrix Reproved (Verification Pearl). Journal of Automated Reasoning. 60:3. (365-383). Online publication date: 1-Mar-2018.

https://doi.org/10.1007/s10817-017-9436-2

KIMURA Y, GHAREHBAGHI A and FUJITA M. (2018). C Description Reconstruction Method from a Revised Netlist for ECO Support. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 10.1587/transfun.E101.A.685. E101.A:4. (685-696).

https://www.jstage.jst.go.jp/article/transfun/E101.A/4/E101.A_685/_article

Chandra K and Bodik R. (2017). Bonsai: synthesis-based reasoning for type systems. Proceedings of the ACM on Programming Languages. 2:POPL. (1-34). Online publication date: 1-Jan-2018.

https://doi.org/10.1145/3158150

Farzan A and Kincaid Z. (2017). Strategy synthesis for linear arithmetic games. Proceedings of the ACM on Programming Languages. 2:POPL. (1-30). Online publication date: 1-Jan-2018.

https://doi.org/10.1145/3158149

Albarghouthi A and Hsu J. (2017). Synthesizing coupling proofs of differential privacy. Proceedings of the ACM on Programming Languages. 2:POPL. (1-30). Online publication date: 1-Jan-2018.

https://doi.org/10.1145/3158146

Bansal S, Namjoshi K and Sa’ar Y. (2018). Synthesis of Asynchronous Reactive Programs from Temporal Specifications. Computer Aided Verification. 10.1007/978-3-319-96145-3_20. (367-385).

http://link.springer.com/10.1007/978-3-319-96145-3_20

Cerone A. (2018). FormalMiner: A Formal Framework for Refinement Mining. Software Technologies: Applications and Foundations. 10.1007/978-3-030-04771-9_15. (185-200).

http://link.springer.com/10.1007/978-3-030-04771-9_15

Mota A. (2018). The Pragmatic Dimension of Formal Methods: Towards Building a Sound Synthesiser. Formal Methods: Foundations and Applications. 10.1007/978-3-030-03044-5_1. (1-4).

http://link.springer.com/10.1007/978-3-030-03044-5_1

Jonáš M and Strejček J. (2018). Abstraction of Bit-Vector Operations for BDD-Based SMT Solvers. Theoretical Aspects of Computing – ICTAC 2018. 10.1007/978-3-030-02508-3_15. (273-291).

http://link.springer.com/10.1007/978-3-030-02508-3_15

Jha S and Seshia S. (2017). A theory of formal synthesis via inductive learning. Acta Informatica. 54:7. (693-726). Online publication date: 1-Nov-2017.

https://doi.org/10.1007/s00236-017-0294-5

Qiu X and Solar-Lezama A. (2017). Natural synthesis of provably-correct data-structure manipulations. Proceedings of the ACM on Programming Languages. 1:OOPSLA. (1-28). Online publication date: 12-Oct-2017.

https://doi.org/10.1145/3133889

Hua J and Khurshid S. EdSketch: execution-driven sketching for Java. Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software. (162-171).

https://doi.org/10.1145/3092282.3092285

Krawiec K, Błądek I and Swan J. Counterexample-driven genetic programming. Proceedings of the Genetic and Evolutionary Computation Conference. (953-960).

https://doi.org/10.1145/3071178.3071224

Bagheri H, Tang C and Sullivan K. (2017). Automated Synthesis and Dynamic Analysis of Tradeoff Spaces for Object-Relational Mapping. IEEE Transactions on Software Engineering. 43:2. (145-163). Online publication date: 1-Feb-2017.

https://doi.org/10.1109/TSE.2016.2587646

https://link.springer.com/10.1007/978-3-662-54577-5_17

Preiner M, Niemetz A and Biere A. (2017). Counterexample-Guided Model Synthesis. Tools and Algorithms for the Construction and Analysis of Systems. 10.1007/978-3-662-54577-5_15. (264-280).

http://link.springer.com/10.1007/978-3-662-54577-5_15

So S and Oh H. (2017). Synthesizing Imperative Programs from Examples Guided by Static Analysis. Static Analysis. 10.1007/978-3-319-66706-5_18. (364-381).

http://link.springer.com/10.1007/978-3-319-66706-5_18

Błądek I and Krawiec K. (2017). Evolutionary Program Sketching. Genetic Programming. 10.1007/978-3-319-55696-3_1. (3-18).

http://link.springer.com/10.1007/978-3-319-55696-3_1

Vechev M and Yahav E. (2016). Programming with "Big Code". Foundations and Trends in Programming Languages. 3:4. (231-284). Online publication date: 29-Dec-2016.

https://doi.org/10.1561/2500000028

Alur R, Fisman D, Singh R and Solar-Lezama A. (2016). SyGuS-Comp 2016: Results and Analysis. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.229.13. 229. (178-202).

http://arxiv.org/abs/1611.07627

Lundquist G, Mohan V and Hamlen K. Searching for software diversity. Proceedings of the 2016 New Security Paradigms Workshop. (80-91).

https://doi.org/10.1145/3011883.3011891

Chugh R, Hempel B, Spradlin M and Albers J. (2016). Programmatic and direct manipulation, together at last. ACM SIGPLAN Notices. 51:6. (341-354). Online publication date: 1-Aug-2016.

https://doi.org/10.1145/2980983.2908103

Padhi S, Sharma R and Millstein T. (2016). Data-driven precondition inference with learned features. ACM SIGPLAN Notices. 51:6. (42-56). Online publication date: 1-Aug-2016.

https://doi.org/10.1145/2980983.2908099

Galán F and Cañete-Valdeón J. (2016). Synthesis of positive logic programs for checking a class of definitions with infinite quantification. Information and Computation. 249:C. (205-236). Online publication date: 1-Aug-2016.

https://doi.org/10.1016/j.ic.2016.06.014

Gulwani S. Programming by Examples. Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706. (9-14).

https://doi.org/10.1007/978-3-319-40229-1_2

Chugh R, Hempel B, Spradlin M and Albers J. Programmatic and direct manipulation, together at last. Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. (341-354).

https://doi.org/10.1145/2908080.2908103

Padhi S, Sharma R and Millstein T. Data-driven precondition inference with learned features. Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. (42-56).

https://doi.org/10.1145/2908080.2908099

Tsankov P, Dashti M and Basin D. (2016). Access Control Synthesis for Physical Spaces 2016 IEEE 29th Computer Security Foundations Symposium (CSF). 10.1109/CSF.2016.38. 978-1-5090-2607-4. (443-457).

https://ieeexplore.ieee.org/document/7536393/

Chugh R. Prodirect manipulation. Proceedings of the 38th International Conference on Software Engineering Companion. (781-784).

https://doi.org/10.1145/2889160.2889210

Desai A, Gulwani S, Hingorani V, Jain N, Karkare A, Marron M, R S and Roy S. Program synthesis using natural language. Proceedings of the 38th International Conference on Software Engineering. (345-356).

https://doi.org/10.1145/2884781.2884786

Mao F, Cai X, Shen B, Xia Y and Jin B. (2016). Operational pattern based code generation for management information system: An industrial case study 2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD). 10.1109/SNPD.2016.7515935. 978-1-5090-2239-7. (425-430).

http://ieeexplore.ieee.org/document/7515935/

Alur R, Fisman D, Singh R and Solar-Lezama A. (2016). Results and Analysis of SyGuS-Comp'15. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.202.3. 202. (3-26).

http://arxiv.org/abs/1602.01170

Cerone A. (2016). Refinement Mining: Using Data to Sift Plausible Models. Software Technologies: Applications and Foundations. 10.1007/978-3-319-50230-4_3. (26-41).

http://link.springer.com/10.1007/978-3-319-50230-4_3

Clochard M, Gondelman L and Pereira M. (2016). The Matrix Reproved (Verification Pearl). Verified Software. Theories, Tools, and Experiments. 10.1007/978-3-319-48869-1_8. (107-118).

http://link.springer.com/10.1007/978-3-319-48869-1_8

D’Antoni L, Samanta R and Singh R. (2016). Qlose: Program Repair with Quantitative Objectives. Computer Aided Verification. 10.1007/978-3-319-41540-6_21. (383-401).

http://link.springer.com/10.1007/978-3-319-41540-6_21

Inala J, Singh R and Solar-Lezama A. (2016). Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers. Theory and Applications of Satisfiability Testing – SAT 2016. 10.1007/978-3-319-40970-2_19. (302-320).

http://link.springer.com/10.1007/978-3-319-40970-2_19

https://doi.org/10.1007/978-3-662-48899-7_42

Seshia S. Combining Induction, Deduction, and Structure for Verification and Synthesis. Proceedings of the IEEE. 10.1109/JPROC.2015.2471838. 103:11. (2036-2051).

http://ieeexplore.ieee.org/document/7295541/

Jeon J, Qiu X, Foster J and Solar-Lezama A. JSketch: sketching for Java. Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering. (934-937).

https://doi.org/10.1145/2786805.2803189

Nori A, Ozair S, Rajamani S and Vijaykeerthy D. (2015). Efficient synthesis of probabilistic programs. ACM SIGPLAN Notices. 50:6. (208-217). Online publication date: 7-Aug-2015.

https://doi.org/10.1145/2813885.2737982

https://doi.org/10.1007/978-3-319-29613-5_2

Nori A, Ozair S, Rajamani S and Vijaykeerthy D. Efficient synthesis of probabilistic programs. Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation. (208-217).

https://doi.org/10.1145/2737924.2737982

Cochran R, D'Antoni L, Livshits B, Molnar D and Veanes M. (2015). Program Boosting. ACM SIGPLAN Notices. 50:1. (677-688). Online publication date: 11-May-2015.

https://doi.org/10.1145/2775051.2676973

Cochran R, D'Antoni L, Livshits B, Molnar D and Veanes M. Program Boosting. Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (677-688).

https://doi.org/10.1145/2676726.2676973

Fisher J, Köksal A, Piterman N and Woodhouse S. (2015). Synthesising Executable Gene Regulatory Networks from Single-Cell Gene Expression Data. Computer Aided Verification. 10.1007/978-3-319-21690-4_38. (544-560).

http://link.springer.com/10.1007/978-3-319-21690-4_38

Liu C, Zhang J, Zhou H, McDirmid S, Guo Z and Moscibroda T. Automating Distributed Partial Aggregation. Proceedings of the ACM Symposium on Cloud Computing. (1-12).

https://doi.org/10.1145/2670979.2670980

Barthe G, Dupressoir F, Fouque P, Grégoire B and Zapalowicz J. Synthesis of Fault Attacks on Cryptographic Implementations. Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security. (1016-1027).

https://doi.org/10.1145/2660267.2660304

Gascón A and Tiwari A. (2014). Synthesis of a simple self-stabilizing system. Electronic Proceedings in Theoretical Computer Science. 10.4204/EPTCS.157.5. 157. (5-16).

http://arxiv.org/abs/1407.5392v1

Dillig T, Dillig I and Chaudhuri S. Optimal Guard Synthesis for Memory Safety. Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559. (491-507).

https://doi.org/10.1007/978-3-319-08867-9_32

Paoletti N, Yordanov B, Hamadi Y, Wintersteiger C and Kugler H. Analyzing and Synthesizing Genomic Logic Functions. Proceedings of the 16th International Conference on Computer Aided Verification - Volume 8559. (343-357).

https://doi.org/10.1007/978-3-319-08867-9_23

Gulwani S and Marron M. NLyze. Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data. (803-814).

https://doi.org/10.1145/2588555.2612177

Raychev V, Vechev M and Yahav E. Code completion with statistical language models. Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation. (419-428).

https://doi.org/10.1145/2594291.2594321

Raychev V, Vechev M and Yahav E. (2014). Code completion with statistical language models. ACM SIGPLAN Notices. 49:6. (419-428). Online publication date: 5-Jun-2014.

https://doi.org/10.1145/2666356.2594321

Galenson J, Reames P, Bodik R, Hartmann B and Sen K. CodeHint: dynamic and interactive synthesis of code snippets. Proceedings of the 36th International Conference on Software Engineering. (653-663).

https://doi.org/10.1145/2568225.2568250

Nedunuri S, Prabhu S, Moll M, Chaudhuri S and Kavraki L. (2014). SMT-based synthesis of integrated task and motion plans from plan outlines 2014 IEEE International Conference on Robotics and Automation (ICRA). 10.1109/ICRA.2014.6906924. 978-1-4799-3685-4. (655-662).

http://ieeexplore.ieee.org/document/6906924/

Kurilova D and Rayside D. (2013). On the simplicity of synthesizing linked data structure operations. ACM SIGPLAN Notices. 49:3. (155-158). Online publication date: 5-Mar-2014.

https://doi.org/10.1145/2637365.2517225

Mari F, Melatti I, Salvo I and Tronci E. (2014). Model-based synthesis of control software from system-level formal specifications. ACM Transactions on Software Engineering and Methodology. 23:1. (1-42). Online publication date: 1-Feb-2014.

https://doi.org/10.1145/2559934

Leike J and Tiwari A. Synthesis for Polynomial Lasso Programs. Proceedings of the 15th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 8318. (434-452).

https://doi.org/10.1007/978-3-642-54013-4_24

Singh R, Singh R, Xu Z, Krosnick R and Solar-Lezama A. Modular Synthesis of Sketches Using Models. Proceedings of the 15th International Conference on Verification, Model Checking, and Abstract Interpretation - Volume 8318. (395-414).

https://doi.org/10.1007/978-3-642-54013-4_22

Beyene T, Chaudhuri S, Popeea C and Rybalchenko A. (2014). A constraint-based approach to solving games on infinite graphs. ACM SIGPLAN Notices. 49:1. (221-233). Online publication date: 13-Jan-2014.

https://doi.org/10.1145/2578855.2535860

Chaudhuri S, Clochard M and Solar-Lezama A. (2014). Bridging boolean and quantitative synthesis using smoothed proof search. ACM SIGPLAN Notices. 49:1. (207-220). Online publication date: 13-Jan-2014.

https://doi.org/10.1145/2578855.2535859

Beyene T, Chaudhuri S, Popeea C and Rybalchenko A. A constraint-based approach to solving games on infinite graphs. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (221-233).

https://doi.org/10.1145/2535838.2535860

Chaudhuri S, Clochard M and Solar-Lezama A. Bridging boolean and quantitative synthesis using smoothed proof search. Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. (207-220).

https://doi.org/10.1145/2535838.2535859

Kuncak V. (2014). Verifying and Synthesizing Software with Recursive Functions. Automata, Languages, and Programming. 10.1007/978-3-662-43948-7_2. (11-25).

http://link.springer.com/10.1007/978-3-662-43948-7_2

Kneuss E, Kuraj I, Kuncak V and Suter P. (2013). Synthesis modulo recursive functions. ACM SIGPLAN Notices. 48:10. (407-426). Online publication date: 12-Nov-2013.

https://doi.org/10.1145/2544173.2509555

Kneuss E, Kuraj I, Kuncak V and Suter P. Synthesis modulo recursive functions. Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications. (407-426).

https://doi.org/10.1145/2509136.2509555

Kurilova D and Rayside D. On the simplicity of synthesizing linked data structure operations. Proceedings of the 12th international conference on Generative programming: concepts & experiences. (155-158).

https://doi.org/10.1145/2517208.2517225

Kuncak V and Blanc R. (2013). Interpolation for synthesis on unbounded domains 2013 Formal Methods in Computer-Aided Design (FMCAD). 10.1109/FMCAD.2013.6679396. 978-0-9835678-3-7. (93-96).

http://ieeexplore.ieee.org/document/6679396/

Hofferek G, Gupta A, Konighofer B, Jiang J and Bloem R. (2013). Synthesizing multiple boolean functions using interpolation on a single proof 2013 Formal Methods in Computer-Aided Design (FMCAD). 10.1109/FMCAD.2013.6679394. 978-0-9835678-3-7. (77-84).

http://ieeexplore.ieee.org/document/6679394/

Bodik R and Jobstmann B. (2013). Algorithmic program synthesis. International Journal on Software Tools for Technology Transfer (STTT). 15:5-6. (397-411). Online publication date: 1-Oct-2013.

https://doi.org/10.1007/s10009-013-0287-9

Solar-Lezama A. (2013). Program sketching. International Journal on Software Tools for Technology Transfer (STTT). 15:5-6. (475-495). Online publication date: 1-Oct-2013.

https://doi.org/10.1007/s10009-012-0249-7

Srivastava S, Gulwani S and Foster J. (2013). Template-based program verification and program synthesis. International Journal on Software Tools for Technology Transfer (STTT). 15:5-6. (497-518). Online publication date: 1-Oct-2013.

https://doi.org/10.1007/s10009-012-0223-4

Kuncak V, Mayer M, Piskac R and Suter P. (2013). Functional synthesis for linear arithmetic and sets. International Journal on Software Tools for Technology Transfer (STTT). 15:5-6. (455-474). Online publication date: 1-Oct-2013.

https://doi.org/10.1007/s10009-011-0217-7

Barthe G, Crespo J, Gulwani S, Kunz C and Marron M. (2013). From relational verification to SIMD loop synthesis. ACM SIGPLAN Notices. 48:8. (123-134). Online publication date: 23-Aug-2013.

https://doi.org/10.1145/2517327.2442529

Singh R, Gulwani S and Solar-Lezama A. (2013). Automated feedback generation for introductory programming assignments. ACM SIGPLAN Notices. 48:6. (15-26). Online publication date: 23-Jun-2013.

https://doi.org/10.1145/2499370.2462195

Udupa A, Raghavan A, Deshmukh J, Mador-Haim S, Martin M and Alur R. (2013). TRANSIT. ACM SIGPLAN Notices. 48:6. (287-296). Online publication date: 23-Jun-2013.

https://doi.org/10.1145/2499370.2462174

Singh R, Gulwani S and Solar-Lezama A. Automated feedback generation for introductory programming assignments. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. (15-26).

https://doi.org/10.1145/2491956.2462195

Udupa A, Raghavan A, Deshmukh J, Mador-Haim S, Martin M and Alur R. TRANSIT. Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation. (287-296).

https://doi.org/10.1145/2491956.2462174

Barthe G, Crespo J, Gulwani S, Kunz C and Marron M. From relational verification to SIMD loop synthesis. Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming. (123-134).

https://doi.org/10.1145/2442516.2442529

Koksal A, Pu Y, Srivastava S, Bodik R, Fisher J and Piterman N. (2013). Synthesis of biological models from mutation experiments. ACM SIGPLAN Notices. 48:1. (469-482). Online publication date: 23-Jan-2013.

https://doi.org/10.1145/2480359.2429125

Unno H, Terauchi T and Kobayashi N. (2013). Automating relatively complete verification of higher-order functional programs. ACM SIGPLAN Notices. 48:1. (75-86). Online publication date: 23-Jan-2013.

https://doi.org/10.1145/2480359.2429081

Koksal A, Pu Y, Srivastava S, Bodik R, Fisher J and Piterman N. Synthesis of biological models from mutation experiments. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (469-482).

https://doi.org/10.1145/2429069.2429125

Unno H, Terauchi T and Kobayashi N. Automating relatively complete verification of higher-order functional programs. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (75-86).

https://doi.org/10.1145/2429069.2429081

https://doi.org/10.1007/978-3-642-35873-9_8

Kapur D, Zhang Z, Horbach M, Zhao H, Lu Q and Nguyen T. Geometric quantifier elimination heuristics for automatically generating octagonal and max-plus invariants. Automated Reasoning and Mathematics. (189-228).

/doi/10.5555/2554473.2554484

Kuncak V, Kneuss E and Suter P. (2013). Executing Specifications Using Synthesis and Constraint Solving. Runtime Verification. 10.1007/978-3-642-40787-1_1. (1-20).

http://link.springer.com/10.1007/978-3-642-40787-1_1

http://link.springer.com/10.1007/978-3-642-36675-8_11

Doroshenko A, Zhereb K and Yatsenko O. (2013). Developing and Optimizing Parallel Programs with Algebra-Algorithmic and Term Rewriting Tools. Information and Communication Technologies in Education, Research, and Industrial Applications. 10.1007/978-3-319-03998-5_5. (70-92).

http://link.springer.com/10.1007/978-3-319-03998-5_5

Prountzos D, Manevich R and Pingali K. (2012). Elixir. ACM SIGPLAN Notices. 47:10. (375-394). Online publication date: 15-Nov-2012.

https://doi.org/10.1145/2398857.2384644

Prountzos D, Manevich R and Pingali K. Elixir. Proceedings of the ACM international conference on Object oriented programming systems languages and applications. (375-394).

https://doi.org/10.1145/2384616.2384644

Gulwani S. Synthesis from Examples. Proceedings of the 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. (8-14).

https://doi.org/10.1109/SYNASC.2012.69

Gulwani S, Harris W and Singh R. (2012). Spreadsheet data manipulation using examples. Communications of the ACM. 55:8. (97-105). Online publication date: 1-Aug-2012.

https://doi.org/10.1145/2240236.2240260

Singh R and Solar-Lezama A. SPT. Proceedings of the 24th international conference on Computer Aided Verification. (738-743).

https://doi.org/10.1007/978-3-642-31424-7_58

Spielmann A and Kuncak V. Synthesis for unbounded bit-vector arithmetic. Proceedings of the 6th international joint conference on Automated Reasoning. (499-513).

https://doi.org/10.1007/978-3-642-31365-3_39

Bjørner N. Taking satisfiability to the next level with z3. Proceedings of the 6th international joint conference on Automated Reasoning. (1-8).

https://doi.org/10.1007/978-3-642-31365-3_1

Seshia S. Sciduction. Proceedings of the 49th Annual Design Automation Conference. (356-365).

https://doi.org/10.1145/2228360.2228425

Thummalapenta S, Sinha S, Singhania N and Chandra S. Automating test automation. Proceedings of the 34th International Conference on Software Engineering. (881-891).

/doi/10.5555/2337223.2337327

Pandita R, Xiao X, Zhong H, Xie T, Oney S and Paradkar A. Inferring method specifications from natural language API descriptions. Proceedings of the 34th International Conference on Software Engineering. (815-825).

/doi/10.5555/2337223.2337319

Pandita R, Xiao X, Zhong H, Xie T, Oney S and Paradkar A. (2012). Inferring method specifications from natural language API descriptions 2012 34th International Conference on Software Engineering (ICSE 2012). 10.1109/ICSE.2012.6227137. 978-1-4673-1066-6. (815-825).

http://ieeexplore.ieee.org/document/6227137/

Thummalapenta S, Sinha S, Singhania N and Chandra S. (2012). Automating test automation 2012 34th International Conference on Software Engineering (ICSE 2012). 10.1109/ICSE.2012.6227131. 978-1-4673-1066-6. (881-891).

http://ieeexplore.ieee.org/document/6227131/

White S, Martinez T and Rudolph G. (2012). Reinforcement Programming. Computational Intelligence. 28:2. (176-208). Online publication date: 1-May-2012.

https://doi.org/10.1111/j.1467-8640.2012.00413.x

Chi E. (2012). Who knows?. Communications of the ACM. 55:4. (110-110). Online publication date: 1-Apr-2012.

https://doi.org/10.1145/2133806.2133829

Harmon D, Vouga E, Smith B, Tamstorf R and Grinspun E. (2012). Asynchronous contact mechanics. Communications of the ACM. 55:4. (102-109). Online publication date: 1-Apr-2012.

https://doi.org/10.1145/2133806.2133828

Tekir S. (2012). Reading CS classics. Communications of the ACM. 55:4. (32-34). Online publication date: 1-Apr-2012.

https://doi.org/10.1145/2133806.2133818

Kuncak V, Mayer M, Piskac R and Suter P. (2012). Software synthesis procedures. Communications of the ACM. 55:2. (103-111). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076472

Hoos H. (2012). Programming by optimization. Communications of the ACM. 55:2. (70-80). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076469

Allen B, Bresnahan J, Childers L, Foster I, Kandaswamy G, Kettimuthu R, Kordas J, Link M, Martin S, Pickett K and Tuecke S. (2012). Software as a service for data scientists. Communications of the ACM. 55:2. (81-88). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076468

Evangelopoulos N and Visinescu L. (2012). Text-mining the voice of the people. Communications of the ACM. 55:2. (62-69). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076467

Oliner A, Ganapathi A and Xu W. (2012). Advances and challenges in log analysis. Communications of the ACM. 55:2. (55-61). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076466

Boehm H and Adve S. (2012). You don't know jack about shared variables or memory models. Communications of the ACM. 55:2. (48-54). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076465

Zelkowitz M. (2012). What have we learned about software engineering?. Communications of the ACM. 55:2. (38-39). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076463

Simon B and Cutts Q. (2012). Peer instruction. Communications of the ACM. 55:2. (27-29). Online publication date: 1-Feb-2012.

https://doi.org/10.1145/2076450.2076459

Könighofer R and Bloem R. Automated error localization and correction for imperative programs. Proceedings of the International Conference on Formal Methods in Computer-Aided Design. (91-100).

/doi/10.5555/2157654.2157671

Pu Y, Bodik R and Srivastava S. Synthesis of first-order dynamic programming algorithms. Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications. (83-98).

https://doi.org/10.1145/2048066.2048076

Yessenov K, Xu Z and Solar-Lezama A. Data-driven synthesis for object-oriented frameworks. Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications. (65-82).

https://doi.org/10.1145/2048066.2048075

Pu Y, Bodik R and Srivastava S. (2011). Synthesis of first-order dynamic programming algorithms. ACM SIGPLAN Notices. 46:10. (83-98). Online publication date: 18-Oct-2011.

https://doi.org/10.1145/2076021.2048076

Yessenov K, Xu Z and Solar-Lezama A. (2011). Data-driven synthesis for object-oriented frameworks. ACM SIGPLAN Notices. 46:10. (65-82). Online publication date: 18-Oct-2011.

https://doi.org/10.1145/2076021.2048075

Singh R and Solar-Lezama A. Synthesizing data structure manipulations from storyboards. Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering. (289-299).

https://doi.org/10.1145/2025113.2025153

Jose B, Gamatie A, Ouy J and Shukla S. SMT based false causal loop detection during code synthesis from Polychronous specifications. Proceedings of the Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign. (109-118).

https://doi.org/10.1109/MEMCOD.2011.5970517

Hofferek G and Bloem R. Controller synthesis for pipelined circuits using uninterpreted functions. Proceedings of the Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign. (31-42).

https://doi.org/10.1109/MEMCOD.2011.5970508

Bai Y, Brandt J and Schneider K. SMT-based optimization for synchronous programs. Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems. (11-20).

https://doi.org/10.1145/1988932.1988935

Tiwari A. Logic in Software, Dynamical and Biological Systems. Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science. (9-10).

https://doi.org/10.1109/LICS.2011.20

Srivastava S, Gulwani S, Chaudhuri S and Foster J. Path-based inductive synthesis for program inversion. Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. (492-503).

https://doi.org/10.1145/1993498.1993557

Harris W and Gulwani S. Spreadsheet table transformations from examples. Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. (317-328).

https://doi.org/10.1145/1993498.1993536

Gulwani S, Jha S, Tiwari A and Venkatesan R. Synthesis of loop-free programs. Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. (62-73).

https://doi.org/10.1145/1993498.1993506

Gulwani S, Korthikanti V and Tiwari A. Synthesizing geometry constructions. Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation. (50-61).

https://doi.org/10.1145/1993498.1993505

Kulkarni M, Nguyen D, Prountzos D, Sui X and Pingali K. (2011). Exploiting the commutativity lattice. ACM SIGPLAN Notices. 46:6. (542-555). Online publication date: 4-Jun-2011.

https://doi.org/10.1145/1993316.1993562

Kim D and Rinard M. (2011). Verification of semantic commutativity conditions and inverse operations on linked data structures. ACM SIGPLAN Notices. 46:6. (528-541). Online publication date: 4-Jun-2011.

https://doi.org/10.1145/1993316.1993561

D'Elia D, Demetrescu C and Finocchi I. (2011). Mining hot calling contexts in small space. ACM SIGPLAN Notices. 46:6. (516-527). Online publication date: 4-Jun-2011.

https://doi.org/10.1145/1993316.1993559

Srivastava S, Gulwani S, Chaudhuri S and Foster J. (2011). Path-based inductive synthesis for program inversion. ACM SIGPLAN Notices. 46:6. (492-503). Online publication date: 4-Jun-2011.

https://doi.org/10.1145/1993316.1993557

Harris W and Gulwani S. (2011). Spreadsheet table transformations from examples. ACM SIGPLAN Notices. 46:6. (317-328). Online publication date: 4-Jun-2011.

https://doi.org/10.1145/1993316.1993536

Gulwani S, Jha S, Tiwari A and Venkatesan R. (2011). Synthesis of loop-free programs. ACM SIGPLAN Notices. 46:6. (62-73). Online publication date: 4-Jun-2011.

https://doi.org/10.1145/1993316.1993506

Gulwani S, Korthikanti V and Tiwari A. (2011). Synthesizing geometry constructions. ACM SIGPLAN Notices. 46:6. (50-61). Online publication date: 4-Jun-2011.

https://doi.org/10.1145/1993316.1993505

Naujokat S, Lamprecht A and Steffen B. Tailoring Process Synthesis to Domain Characteristics. Proceedings of the 2011 16th IEEE International Conference on Engineering of Complex Computer Systems. (167-175).

https://doi.org/10.1109/ICECCS.2011.24

Gulwani S. Automating string processing in spreadsheets using input-output examples. Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. (317-330).

https://doi.org/10.1145/1926385.1926423

Gulwani S. (2011). Automating string processing in spreadsheets using input-output examples. ACM SIGPLAN Notices. 46:1. (317-330). Online publication date: 26-Jan-2011.

https://doi.org/10.1145/1925844.1926423

Xu G, Mitchell N, Arnold M, Rountev A and Sevitsky G. Software bloat analysis. Proceedings of the FSE/SDP workshop on Future of software engineering research. (421-426).

https://doi.org/10.1145/1882362.1882448

Le Goues C, Forrest S and Weimer W. The case for software evolution. Proceedings of the FSE/SDP workshop on Future of software engineering research. (205-210).

https://doi.org/10.1145/1882362.1882406

Wintersteiger C, Hamadi Y and de Moura L. Efficiently solving quantified bit-vector formulas. Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design. (239-246).

/doi/10.5555/1998496.1998539

Itzhaky S, Gulwani S, Immerman N and Sagiv M. (2010). A simple inductive synthesis methodology and its applications. ACM SIGPLAN Notices. 45:10. (36-46). Online publication date: 17-Oct-2010.

https://doi.org/10.1145/1932682.1869463

Itzhaky S, Gulwani S, Immerman N and Sagiv M. A simple inductive synthesis methodology and its applications. Proceedings of the ACM international conference on Object oriented programming systems languages and applications. (36-46).

https://doi.org/10.1145/1869459.1869463

Thacker W, Zhang J, Watson L, Birch J, Iyer M and Berry M. (2010). Algorithm 905. ACM Transactions on Mathematical Software. 37:3. (1-20). Online publication date: 1-Sep-2010.

https://doi.org/10.1145/1824801.1824812

Gulwani S. Dimensions in program synthesis. Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming. (13-24).

https://doi.org/10.1145/1836089.1836091

de Moura L and Bjørner N. Bugs, moles and skeletons. Proceedings of the 5th international conference on Automated Reasoning. (400-411).

https://doi.org/10.1007/978-3-642-14203-1_34

Wei Y, Pei Y, Furia C, Silva L, Buchholz S, Meyer B and Zeller A. Automated fixing of programs with contracts. Proceedings of the 19th international symposium on Software testing and analysis. (61-72).

https://doi.org/10.1145/1831708.1831716

Kuncak V, Mayer M, Piskac R and Suter P. (2010). Complete functional synthesis. ACM SIGPLAN Notices. 45:6. (316-329). Online publication date: 12-Jun-2010.

https://doi.org/10.1145/1809028.1806632

Kuncak V, Mayer M, Piskac R and Suter P. Complete functional synthesis. Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation. (316-329).

https://doi.org/10.1145/1806596.1806632

Solar-Lezama A. The Sketching Approach to Program Synthesis. Proceedings of the 7th Asian Symposium on Programming Languages and Systems. (4-13).

https://doi.org/10.1007/978-3-642-10672-9_3