Skip to main navigation Skip to search Skip to main content

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

  • Jianying Xing*
  • , Mengjun Li
  • , Zhoujun Li
  • *Corresponding author for this work
  • National University of Defense Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
PagesV331-V336
DOIs
StatePublished - 2010
Event2010 2nd International Conference on Future Computer and Communication, ICFCC 2010 - Wuhan, China
Duration: 21 May 201024 May 2010

Publication series

NameProceedings of the 2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
Volume3

Conference

Conference2010 2nd International Conference on Future Computer and Communication, ICFCC 2010
Country/TerritoryChina
CityWuhan
Period21/05/1024/05/10

Keywords

  • Optimization problem
  • Program verification
  • Recurrence equations
  • Termination

Fingerprint

Dive into the research topics of 'Automated verification of loops with assignments only by recurrence solving and optimization problems'. Together they form a unique fingerprint.

Cite this