DocumentCode
2315720
Title
Automated Methods for Proving Program Termination and Liveness
Author
Rybalchenko, Andrey
fYear
2009
fDate
26-29 Sept. 2009
Firstpage
17
Lastpage
17
Abstract
Proving program termination is an important step towards ensuring software reliability. The programmers expect that the majority of code fragments, including procedures, event handles, or other program components, always terminates. Unfortunately, until recently there were no viable approaches for automatically proving termination of programs written in imperative programming languages.
Keywords
programming languages; software reliability; imperative programming language; proving program termination; software reliability; Computational modeling; Computer languages; Machinery; Programming profession; Safety; Scientific computing; Software algorithms; Software reliability; Synthetic aperture sonar; Program termination; Ranking functions; Transition predicate;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2009 11th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4244-5910-0
Electronic_ISBN
978-1-4244-5911-7
Type
conf
DOI
10.1109/SYNASC.2009.70
Filename
5460873
Link To Document