By Topic

Automated verification of loops with assignments only by recurrence solving and optimization problems

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
$33 $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

3 Author(s)
Jianying Xing ; School of Computer Science, National University of Defense Technology, Changsha, China ; Mengjun Li ; Zhoujun Li

Based on techniques of solving recurrence equations and optimization problems, we present a practical approach for verifying program including loops with assignments only. We implement this approach on the platform of Mathmatica. The experimental results demonstrate the power of our approach.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

21-24 May 2010