Speeding up the Synthesis of Programs from Traces

Biermann, Alan W.; Baum, Richard I.; Petry, Frederick E.

doi:10.1109/t-c.1975.224180

Cited by 36 publications

(22 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the sake of simplicity, we follow Biermann's original notation and will define S i as the index of the state in the target automaton that state q i in the original LFDFA maps to, i.e., q S i = F(q i ) (Biermann & Petry, 1975). …”

Section: Theorem 1 Let T Be a Lfdfa Then For Any Automaton M Compamentioning

confidence: 99%

“…Biermann noted (Biermann & Petry, 1975) that a more effective search strategy can be applied if some bookkeeping information is kept and used to avoid assigning values to variables that will later prove to generate a conflict. This bookkeeping information can also be used to identify variables that have only one possible assignment left, and should therefore be chosen next.…”

Section: The Basic Search Algorithmmentioning

confidence: 99%

“…The basic search algorithm for this problem was proposed by Biermann (Biermann & Feldman, 1972). Later, the same author proposed an improved search strategy that is much more efficient in the majority of the complex problems (Biermann & Petry, 1975). Section 5.1 describes these algorithms in detail.…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Untitled

Oliveira

Silva

2001

Machine Learning

View full text Add to dashboard Cite

Abstract. This work describes algorithms for the inference of minimum size deterministic automata consistent with a labeled training set. The algorithms presented represent the state of the art for this problem, known to be computationally very hard.In particular, we analyze the performance of algorithms that use implicit enumeration of solutions and algorithms that perform explicit search but incorporate a set of techniques known as dependency directed backtracking to prune the search tree effectively.We present empirical results that show the comparative efficiency of the methods studied and discuss alternative approaches to this problem, evaluating their advantages and drawbacks.

show abstract

Section: Theorem 1 Let T Be a Lfdfa Then For Any Automaton M Compamentioning

confidence: 99%

Section: The Basic Search Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Untitled

Oliveira

Silva

2001

Machine Learning

View full text Add to dashboard Cite

show abstract

“…Secondly all right-contractions are done (A4 + A3 + A7) 4 . Denote the reflexive and transitive closure of these rewrites by * < −→ −→.…”

Section: The Transformation Stepsmentioning

confidence: 99%

“…3 When rewriting terms obtained from i no A7 contractions will occur but it does no harm to have a rewrite system which applies to general terms. 4 When rewriting terms obtained from i no A3 and A7 contractions will occur but it does no harm to have a rewrite system which applies to general terms. In general, there exist normal forms with respect to > * −→ −→ in which an A4 step reveals new A3 redexes, e.g.…”

Section: The Transformation Stepsmentioning

confidence: 99%

Generating FSMs from interworkings

Feijs¹

1999

Distributed Computing

View full text Add to dashboard Cite

A technique for the automated synthesis of FSMs (finite state machines) from sets of interworkings (synchronous sequence charts) is described. This is useful for obtaining feedback from a set of scenarios during a system's definition phase or test phase. It is sound in the sense that the generated FSM only exhibits traces that correspond to one of the interworkings from the given set. It preserves deadlock freedom in the sense that no behaviours are lost. The concrete syntax of SDL is used to represent the resulting FSMs.

show abstract

Automatic synthesis of state machines from trace diagrams

Koskimies

Mäkinen

1994

Softw Pract Exp

View full text Add to dashboard Cite

The automatic synthesis of state machines describing the behaviour of a class of objects in object‐oriented software modelling is studied. It is shown that the synthesis can be carried out on the basis of trace diagrams giving possible sequences of events during the execution of the system. An algorithm originally developed for the automatic construction of programs on the basis of their execution traces is applied to the problem, and an experimental state machine synthesizer is implemented. It is demonstrated that such a synthesizer is a highly useful component in a practical object‐oriented CASE system.

show abstract

Speeding up the Synthesis of Programs from Traces

Cited by 36 publications

References 17 publications

Untitled

Untitled

Generating FSMs from interworkings

Automatic synthesis of state machines from trace diagrams

Contact Info

Product

Resources

About