Synthesizing regular expressions from examples for introductory automata assignments
- Authors
- Lee, M.; So, S.; Oh, H.
- Issue Date
- 2016
- Publisher
- Association for Computing Machinery
- Keywords
- program synthesis; programming by example; Regular expression
- Citation
- ACM SIGPLAN Notices, v.52, no.3, pp.70 - 80
- Indexed
- SCOPUS
- Journal Title
- ACM SIGPLAN Notices
- Volume
- 52
- Number
- 3
- Start Page
- 70
- End Page
- 80
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/91367
- DOI
- 10.1145/2993236.2993244
- ISSN
- 1523-2867
- Abstract
- We present a method for synthesizing regular expressions for introductory automata assignments. Given a set of positive and negative examples, the method automatically synthesizes the simplest possible regular expression that accepts all the positive examples while rejecting all the negative examples. The key novelty is the search-based synthesis algorithm that leverages ideas from over- and under-approximations to effectively prune out a large search space. We have implemented our technique in a tool and evaluated it with non-trivial benchmark problems that students often struggle with. The results show that our system can synthesize desired regular expressions in 6.7 seconds on the average, so that it can be interactively used by students to enhance their understanding of regular expressions. © 2016 ACM.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.