• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Languages, Theory

Cached

  • Download as a PDF

Download Links

  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.research.microsoft.com]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Sumit Gulwani
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Gulwani_languages,theory,
    author = {Sumit Gulwani},
    title = {Languages, Theory},
    year = {}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develop utility programs, helping regular programmers automatically discover tricky/mundane details, program understanding, discovery of new algorithms, and even teaching. This paper describes three key dimensions in program synthesis: expression of user intent, space of programs over which to search, and the search technique. These concepts are illustrated by brief description of various program synthesis projects that target synthesis of a wide variety of programs such as standard undergraduate textbook algorithms (e.g., sorting, dynamic programming), program inverses (e.g., decoders, deserializers), bitvector manipulation routines, deobfuscated programs, graph algorithms, text-manipulating routines, mutual exclusion algorithms, etc. Categories and Subject Descriptors D.1.2 [Programming Techniques]:

Citations

5664 Probabilistic Reasoning in Intelligent Systems - Pearl - 1988
2458 Genetic Programming: On the Programming of Computers by Means of Natural Selection - Koza - 1992
1412 An Introduction to Kolmogorov Complexity and Its Applications - Li, Vitanyi - 1997
793 Language identification in the limit - Gold - 1967
517 Generalization as search - Mitchell - 1982
439 Learning regular sets from queries and counterexamples - Angluin - 1987
439 Algorithmic Program Debugging - Shapiro - 1983
324 Fast Probabilistic Algorithms for Verification of Polynomial Identities - Schwartz - 1980
318 Watch What I Do: Programming by Demonstration - Cypher, Halbert, et al. - 1993
259 Solution of a problem in concurrent programming control - Dijkstra - 1965
224 Kids: A semiautomatic program development system - Smith - 1990
127 A deductive approach to program synthesis - Manna, Waldinger - 1980
116 language interfaces to databases — an introduction - Androutsopoulos, Ritchie, et al. - 1995
105 The Art of Computer Programming, Volume III: Sorting and Searching - Knuth - 1973
88 Learning subsequential transducers for pattern recognition interpretation tasks - ONCINA, GARCÍA, et al. - 1993
83 On the complexity of teaching - Goldman, Kearns - 1992
77 Superoptimizer: a look at the smallest program - Massalin - 1987
76 Jungloid mining: helping to navigate the API jungle - Mandelin, Xu, et al. - 2005
66 The art of computer programming, Volume I: Fundamental Algorithms - Knuth - 1968
62 On the synthesis of finite-state machines from samples of their behavior - Biermann, Feldman - 1972
57 Editing by examples - Nix - 1983
53 Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters 10(2):80–82 - Blum, Chandra, et al. - 1980
48 Version space algebra and its application to programming by demonstration - Lau, Domingos, et al. - 2000
40 Hacker’s Delight - Warren - 2002
37 Eliminating branches using a superoptimizer and the GNU C compiler - Granlund, Kenner - 1992
33 Automatically finding patches using genetic programming - Weimer, Nguyen, et al.
32 Upper and Lower Bounds for First Order Expressibility - Immerman - 1982
24 TELS: learning text editing tasks from examples - Witten, Mo - 1993
23 A bibliographical study of grammatical inference - Higuera
23 J.S.: From program verification to program synthesis - Srivastava, Gulwani, et al. - 2010
19 Learning programs from traces using version space algebra - Lau, Domingos, et al. - 2003
18 NaLIX: An interactive natural language interface for querying XML - LI, YANG, et al. - 2005
17 Systematic search for lambda expressions - Katayama
17 A foray into Conficker’s logic and rendezvous points - Porras, Saidi, et al. - 2009
16 Program inversion - Dijkstra - 1979
16 R.: Program analysis as constraint solving - Gulwani, Srivastava, et al. - 2008
15 Programming by demonstration: a machine learning approach. Doctoral dissertation - Lau - 2001
14 Speeding up the synthesis of programs from traces - Biermann, Baum, et al. - 1975
14 Continuity analysis of programs - Chaudhuri, Gulwani, et al.
13 The reachability-bound problem - Gulwani, Zuleger - 2010
13 Oracle-guided componentbased program synthesis - Jha, Gulwani, et al. - 2010
13 Deriving linearizable fine-grained concurrent objects - VECHEV, YAHAV
12 Constraint-based approach for analysis of hybrid systems - Gulwani, Tiwari - 2008
12 Internet security threat report volume XIV. http://www.symantec.com/business/theme.jsp?themeid=threatreport - Corporation - 2009
9 Automatic discovery of mutual exclusion algorithms - Bar-David, Taubenfeld - 2003
9 The geometer’s sketchpad: programming by geometry. In Watch what I do: programming by demonstration - Jackiw, Finzer - 1993
8 Vs3: Smt solvers for program verification - Srivastava, Gulwani, et al. - 2009
7 Program verification using templates over predicate abstraction - Srivastava, Gulwani - 2009
7 Learning contextdependent mappings from sentences to logical forms - Zettlemoyer, Collins - 2009
6 A method for automatic program inversion based on LR(0) parsing - Glück, Kawabe - 2005
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University