Hila Peleg

Hila Peleg

Auto-generated profile, based on publicly available information

Hila Peleg

Technion, Haifa, Israel

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 October 2021 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
KFKasra Ferdowsifard
Kasra Ferdowsifard
SBShraddha Barke
Shraddha Barke
HPHila Peleg
Hila Peleg
SLSorin Lerner
Sorin Lerner
NPNadia Polikarpova
Nadia Polikarpova
One vision for program synthesis, and specifically for programming by example (PBE), is an interactive programmer's assistant, integrated into the development environment. To make program synthesis practical for interactive use, prior work on Small-Step Live PBE has proposed to limit the scope of synthesis to small code snippets, and enable the users to provide local specifications for those snippets. This paradigm, however, does not work well in the presence of loops. We present LooPy, a synthesizer integrated into a live programming environment, which extends Small-Step Live PBE to work inside loops and scales it up to synthesize larger code snippets, while remaining fast enough for interactive use. To allow users to effectively provide examples at various loop iterations, even when the loop body is incomplete, LooPy makes use of live execution , a technique that leverages the programmer as an oracle to step over incomplete parts of the loop. To enable synthesis of loop bodies at interactive speeds, LooPy introduces Intermediate State Graph , a new data structure, which compactly represents a large space of code snippets composed of multiple assignment statements and conditionals. We evaluate LooPy empirically using benchmarks from competitive programming and previous synthesizers, and show that it can solve a wide variety of synthesis tasks at interactive speeds. We also perform a small qualitative user study which shows that LooPy's block-level specifications are easy for programmers to provide.

13 November 2020 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
MJMichael B. James
Michael B. James
ZGZheng Guo
Zheng Guo
ZWZiteng Wang
Ziteng Wang
SDShivani Doshi
Shivani Doshi
HPHila Peleg
Hila Peleg
NPNadia Polikarpova
Nadia Polikarpova
We present Hoogle+, a web-based API discovery tool for Haskell. A Hoogle+ user can specify a programming task using either a type, a set of input-output tests, or both. Given a specification, the tool returns a list of matching programs composed from functions in popular Haskell libraries, and annotated with automatically-generated examples of their behavior. These features of Hoogle+ are powered by three novel techniques. First, to enable efficient type-directed synthesis from tests only, we develop an algorithm that infers likely type specifications from tests . Second, to return high-quality programs even with ambiguous specifications, we develop a technique that automatically eliminates meaningless and repetitive synthesis results . Finally, we show how to extend this elimination technique to automatically generate informative inputs that can be used to demonstrate program behavior to the user. To evaluate the effectiveness of Hoogle+ compared with traditional API search techniques, we perform a user study with 30 participants of varying Haskell proficiency. The study shows that programmers equipped with Hoogle+ generally solve tasks faster and were able to solve 50% more tasks overall.

25 December 2015 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
HPHila Peleg
Hila Peleg
SSSharon Shoham
Sharon Shoham
EYEran Yahav
Eran Yahav

29 December 2017
Verified
Book Chapter
Closed access
PDF file
HPHila Peleg
Hila Peleg
SIShachar Itzhaky
Shachar Itzhaky
SSSharon Shoham
Sharon Shoham

25 January 2017 in arXiv
Verified
Preprint
Open access
PDF file
PGPatrice Godefroid
Patrice Godefroid
HPHila Peleg
Hila Peleg
RSRishabh Singh
Rishabh Singh
Fuzzing consists of repeatedly testing an application with modified, or fuzzed, inputs with the goal of finding security vulnerabilities in input-parsing code. In this paper, we show how to automate the generation of an input grammar suitable for input fuzzing using sample inputs and neural-network-based statistical machine-learning techniques. We present a detailed case study with a complex input format, namely PDF, and a large complex security-critical parser for this format, namely, the PDF parser embedded in Microsoft's new Edge browser. We discuss (and measure) the tension between conflicting learning and fuzzing goals: learning wants to capture the structure of well-formed inputs, while fuzzing wants to break that structure in order to cover unexpected code paths and find bugs. We also present a new algorithm for this learn&fuzz challenge which uses a learnt input probability distribution to intelligently guide where to fuzz inputs.

29 December 2017
Verified
Book Chapter
Closed access
PDF file
HPHila Peleg
Hila Peleg
DRDan Rasin
Dan Rasin
EYEran Yahav
Eran Yahav