Stefan Schrödl, Stefan Edelkamp  Home/Search
Context
Related
| informatik.unifreiburg.de/~...ap.ps.gz informatik.unifrei...report00121.ps.gz geocities.com/yss15632/pub/ap.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ad.informatik.u...p.publikationen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We present a supervised, interactive learning technique that infers control structures of computer programs from user-demonstrated traces. A two-stage process is applied: first, a minimal deterministic finite automaton (DFA) M labeled by the instructions of the program is learned from a set of example traces and membership queries to the user. It accepts all prefixes of traces of the target program. The number of queries is bounded by O(k \Delta jM j), with k being the total number of... (Update)
Similar documents (at the sentence level):
56.9%: Inferring Flow of Control in Program Synthesis by Example - Schrödl, Edelkamp (Correct)
Active bibliography (related documents): More All
0.2: Grammar Inference, Automata Induction, and Language Acquisition - Parekh, Honavar (2000) (Correct)
0.2: A Neural Network Architecture for Syntax Analysis - Chen, Honavar (1999) (Correct)
0.2: Adaptive Automata for Syntax Learning - Joo Jos Nero (1998) (Correct)
Similar documents based on text: More All
0.1: Localizing A* - Edelkamp, Schrödl (2000) (Correct)
0.1: Updating Shortest Paths - Edelkamp (1998) (Correct)
0.1: Directed Symbolic Exploration in AI-Planning - Edelkamp (2001) (Correct)
BibTeX entry: (Update)
@misc{ dl-inferring,
author = "Stefan Schrödl and Stefan Edelkamp",
title = "Inferring Flow of Control in Program Synthesis by Example",
url = "citeseer.ist.psu.edu/214632.html" }
Citations (may not include all citations):1450 The design and analysis of computer algorithms (context) - Aho, Hopcroft et al. - 1974
412 Language identification in the limit (context) - Gold - 1967
249 Volume 3: Sorting and Searching (context) - Knuth, of - 1973
175 Watch What I Do: Programming by Demonstration (context) - Cypher - 1993
127 Complexity of automaton identification from given data (context) - Gold - 1978
39 Software agents: Completing patterns and constructing user i.. - Schlimmer, Hermens - 1993
35 Logic Program Synthesis from Incomplete Information (context) - Flener - 1995
29 A note on the number of queries needed to identify regular l.. (context) - Angluin - 1981
16 The inference of regular lisp programs from examples (context) - Biermann - 1978
6 structure transformations under uncertainty (context) - Gaines - 1976
5 A polynomial time incremental algorithm for regular grammar .. - Parekh, Nichitiu et al. - 1997
2 Algorithmic Program Debuggging (context) - Shapiro - 1983
2 Inferrence of reversible languages (context) - Angluin - 1982
Documents on the same site (http://ad.informatik.uni-freiburg.de/adgroup.publikationen): More
The Exact Cost of Exploring Streets with a CAB (Extended .. - A. López-Ortiz.. (Correct)
Vega - A user-centered approach to the distributed.. - Hipke, Schuierer (1999) (Correct)
Exhibiting Knowledge in Planning Problems to Minimize State.. - Edelkamp, Helmert (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC