Skip to main content
Springer Nature Link
Log in

Trace-Based Programming

  • Reference work entry
  • First Online:
Encyclopedia of Machine Learning and Data Mining

  • 332 Accesses

Abstract

Trace-based programming is introduced as a specific approach to inductive programming where a, typically recursive, program is inferred from a small set of example computational traces.

Most of the work by this author was done while on leave of absence in 2006/2007 as a Visiting Faculty Member and Erasmus Exchange Teacher at Sabancı University, Turkey.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Recommended Reading

  • Biermann AW (1972) On the inference of Turing machines from sample computations. Artif Intell 3(3):181–198

    Google Scholar 

  • Schmid U, Wysotzki F (1998) Induction of recursive program schemes. In: Proceedings of the 10th European conference on machine learning (ECML 1998). Volume 1398 of lecture notes in artificial intelligence. Springer, pp 214–225

    Google Scholar 

  • Schrödl S, Edelkamp S (1999) Inferring flow of control in program synthesis by example. In: Proceedings of the 23rd annual German conference on artificial intelligence (KI 1999). Volume 1701 of lecture notes in artificial intelligence. Springer, pp 171–182

    Google Scholar 

  • Shavlik JW (1990) Acquiring recursive and iterative concepts with explanation-based learning. Mach Learn 5:39–70

    Google Scholar 

  • Wysotzki F (1983) Representation and induction of infinite concepts and recursive action sequences. In: Proceedings of the 8th international joint conference on artificial intelligence (IJCAI 1983). Morgan Kaufmann, pp 409–414

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Technology, Uppsala University, Uppsala, Sweden

    Pierre Flener

  2. Faculty of Information Systems and Applied Computer Science, University of Bamberg, An der Weberei 5, Bamberg, Germany

    Ute Schmid

Authors
  1. Pierre Flener
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ute Schmid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pierre Flener .

Editor information

Editors and Affiliations

  1. The University of New South Wales, Sydney, NSW, Australia

    Claude Sammut

  2. Faculty of Information Technology, Monash University, Melbourne, VIC, Australia

    Geoffrey I. Webb

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media New York

About this entry

Cite this entry

Flener, P., Schmid, U. (2017). Trace-Based Programming. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_844

Download citation

Publish with us

Policies and ethics