Symbolic Automata for Static Specification Mining. - Hila Peleg; Sharon Shoham; Eran Yahav; Hongseok Yang (SAS, 2013)

D^3 : Data-Driven Disjunctive Abstraction. - Hila Peleg; Sharon Shoham; Eran Yahav (VMCAI, 2016)

Symbolic automata for representing big code. - Hila Peleg; Sharon Shoham; Eran Yahav; Hongseok Yang (Acta Informatica, 2016)

Learn&Fuzz: machine learning for input fuzzing. - Patrice Godefroid; Hila Peleg; Rishabh Singh (ASE, 2017)

Programming not only by example. - Hila Peleg; Sharon Shoham; Eran Yahav (ICSE, 2018)

On the importance of common sense in program synthesis. - Hila Peleg (ISSTA/ECOOP Workshops, 2018)

Abstraction-Based Interaction Model for Synthesis. - Hila Peleg; Shachar Itzhaky; Sharon Shoham (VMCAI, 2018)

Generating Tests by Example. - Hila Peleg; Dan Rasin; Eran Yahav (VMCAI, 2018)

Some challenges for software testing research (invited talk paper). - Nadia Alshahwan; Andrea Ciancone; Mark Harman; Yue Jia 001; Ke Mao; Alexandru Marginean; Alexander Mols; Hila Peleg; Federica Sarro; Ilya Zorin (ISSTA, 2019)

Program Synthesis for Programmers. - Hila Peleg (2019)

Perfect Is the Enemy of Good: Best-Effort Program Synthesis. - Hila Peleg; Nadia Polikarpova (ECOOP, 2020)

The wonderful wizard of LoC: paying attention to the man behind the curtain of lines-of-code metrics. - Kalev Alpernas; Yotam M. Y. Feldman; Hila Peleg (Onward!, 2020)

Small-Step Live Programming by Example. - Kasra Ferdowsifard; Allen Ordookhanians; Hila Peleg; Sorin Lerner; Nadia Polikarpova (UIST, 2020)

Programming by predicates: a formal model for interactive synthesis. - Hila Peleg; Shachar Itzhaky; Sharon Shoham; Eran Yahav (Acta Informatica, 2020)

Perfect is the Enemy of Good: Best-Effort Program Synthesis (Artifact). - Hila Peleg; Nadia Polikarpova (Dagstuhl Artifacts Ser., 2020)

Just-in-time learning for bottom-up enumerative synthesis. - Shraddha Barke; Hila Peleg; Nadia Polikarpova (Proc. ACM Program. Lang., 2020)

Digging for fold: synthesis-aided API discovery for Haskell. - Michael B. James; Zheng Guo 003; Ziteng Wang; Shivani Doshi; Hila Peleg; Ranjit Jhala; Nadia Polikarpova (Proc. ACM Program. Lang., 2020)

Programming with a read-eval-synth loop. - Hila Peleg; Roi Gabay; Shachar Itzhaky; Eran Yahav (Proc. ACM Program. Lang., 2020)

Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities - (Invited Paper). - Shachar Itzhaky; Hila Peleg; Nadia Polikarpova; Reuben N. S. Rowe; Ilya Sergey (CAV (1), 2021)

Cyclic program synthesis. - Shachar Itzhaky; Hila Peleg; Nadia Polikarpova; Reuben N. S. Rowe; Ilya Sergey (PLDI, 2021)

Synthesis of web layouts from examples. - Dylan Lukes; John Sarracino; Cora Coleman; Hila Peleg; Sorin Lerner; Nadia Polikarpova (ESEC/SIGSOFT FSE, 2021)

LooPy: interactive program synthesis with control structures. - Kasra Ferdowsifard; Shraddha Barke; Hila Peleg; Sorin Lerner; Nadia Polikarpova (Proc. ACM Program. Lang., 2021)

AmiGo: Computational Design of Amigurumi Crochet Patterns. - Michal Edelstein; Hila Peleg; Shachar Itzhaky; Mirela Ben-Chen (SCF, 2022)

Programming-by-Example with Nested Examples. - Tomer Katz; Hila Peleg (VL/HCC, 2023)

Constrictor: Immutability as a Design Concept. - Elad Kinsbruner; Shachar Itzhaky; Hila Peleg (ECOOP, 2024)

Kotlin's Type System is (Also) Unsound. - Elad Kinsbruner; Hila Peleg; Shachar Itzhaky (CoRR, 2024)

Constrictor: Immutability as a Design Concept (Artifact). - Elad Kinsbruner; Shachar Itzhaky; Hila Peleg (Dagstuhl Artifacts Ser., 2024)

Bottom-Up Synthesis of Memory Mutations with Separation Logic. - Kasra Ferdowsi; Hila Peleg (ECOOP, 2025)

Bottom-Up Synthesis of Memory Mutations with Separation Logic (Artifact). - Kasra Ferdowsi; Hila Peleg (Dagstuhl Artifacts Ser., 2025)