Cart (Loading....) | Create Account
Close category search window
 

Discovery of inductive algorithms through automated reasoning: A case study on sorting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dramnesc, I. ; Dept. of Comput. Sci., West Univ., Timişoara, Romania ; Jebelean, T.

By constructive proofs of the existence of the sorted version of the input list, we synthesize automatically five inductive sorting algorithms: Selection-Sort, Insertion-Sort, Quick-Sort, Merge-Sort, as well as a novel algorithm similar to Merge-Sort. Each algorithm uses certain auxiliary inductive functions, which are also automatically synthesized. The automatic proofs use natural style inferences like traditionally in the Theorema system (www.theorema.org). This case study reveals various novel proof techniques specific to the domain of lists, which are crucial for the automation of the proving process. These techniques include: goal oriented reasoning using meta-variables, several versions of induction on lists, and the use of partially unsolved goals. For increased efficiency we also use some special inference rules which are specific to certain predicates on lists, like for instance “is permutation of” (two lists have the same elements with the same number of occurrences), or “is Sorted” (a list is ordered).

Published in:

Intelligent Systems and Informatics (SISY), 2012 IEEE 10th Jubilee International Symposium on

Date of Conference:

20-22 Sept. 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.