Hila Peleg

Orcid: 0000-0002-0107-5659

Affiliations:
  • Technion - Israel Institute of Technology, Haifa, Israel
  • University of California, San Diego, CA, USA (former)
  • Technion - Israel Institute of Technology, Haifa, Israel (PhD 2019)


According to our database1, Hila Peleg authored at least 27 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constrictor: Immutability as a Design Concept (Artifact).
Dagstuhl Artifacts Ser., 2024

Kotlin's Type System is (Also) Unsound.
CoRR, 2024

Constrictor: Immutability as a Design Concept.
Proceedings of the 38th European Conference on Object-Oriented Programming, 2024

2023
Programming-by-Example with Nested Examples.
Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing, 2023

2022
AmiGo: Computational Design of Amigurumi Crochet Patterns.
Proceedings of the SCF '22: Proceedings of the 7th Annual ACM Symposium on Computational Fabrication, 2022

2021
LooPy: interactive program synthesis with control structures.
Proc. ACM Program. Lang., 2021

Synthesis of web layouts from examples.
Proceedings of the ESEC/FSE '21: 29th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2021

Cyclic program synthesis.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities - (Invited Paper).
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Programming with a read-eval-synth loop.
Proc. ACM Program. Lang., 2020

Digging for fold: synthesis-aided API discovery for Haskell.
Proc. ACM Program. Lang., 2020

Just-in-time learning for bottom-up enumerative synthesis.
Proc. ACM Program. Lang., 2020

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

Programming by predicates: a formal model for interactive synthesis.
Acta Informatica, 2020

Small-Step Live Programming by Example.
Proceedings of the UIST '20: The 33rd Annual ACM Symposium on User Interface Software and Technology, 2020

The wonderful wizard of LoC: paying attention to the man behind the curtain of lines-of-code metrics.
Proceedings of the 2020 ACM SIGPLAN International Symposium on New Ideas, 2020

Perfect Is the Enemy of Good: Best-Effort Program Synthesis.
Proceedings of the 34th European Conference on Object-Oriented Programming, 2020

2019
Program Synthesis for Programmers.
PhD thesis, 2019

Some challenges for software testing research (invited talk paper).
Proceedings of the 28th ACM SIGSOFT International Symposium on Software Testing and Analysis, 2019

2018
Generating Tests by Example.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

Abstraction-Based Interaction Model for Synthesis.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2018

On the importance of common sense in program synthesis.
Proceedings of the Companion Proceedings for the ISSTA/ECOOP 2018 Workshops, 2018

Programming not only by example.
Proceedings of the 40th International Conference on Software Engineering, 2018

2017
Learn&Fuzz: machine learning for input fuzzing.
Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, 2017

2016
Symbolic automata for representing big code.
Acta Informatica, 2016

D^3 : Data-Driven Disjunctive Abstraction.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2016

2013
Symbolic Automata for Static Specification Mining.
Proceedings of the Static Analysis - 20th International Symposium, 2013


  Loading...