Loading...
Loading...

Go to the content (press return)

Proving termination of imperative programs using Max-SMT

Author
Larraz, D.; Oliveras, A.; Rodriguez, E.; Rubio, A.
Type of activity
Presentation of work at congresses
Name of edition
Formal Methods in Computer-Aided Design
Date of publication
2013
Presentation's date
2013-10-23
Book of congress proceedings
FMCAD 2013 : Formal Methods in Computer–Aided Design : Portland, OR, USA, 20–23 October 2013
First page
218
Last page
225
Project funding
Sweetlogics-UPC
Repository
http://hdl.handle.net/2117/20895 Open in new window
URL
http://www.cs.utexas.edu/users/hunt/FMCAD/FMCAD13/proceedings.shtml Open in new window
Abstract
We show how Max-SMT can be exploited in constraint-based program termination proving. Thanks to expressing the generation of a ranking function as a Max-SMT optimization problem where constraints are assigned different weights, quasi-ranking functions --functions that almost satisfy all conditions for ensuring well-foundedness-- are produced in a lack of ranking functions. By means of trace partitioning, this allows our method to progress in the termination analysis where other approaches would ...
Citation
Larraz, D. [et al.]. Proving termination of imperative programs using Max-SMT. A: FMCAD 2013 Formal Methods in Computer-Aided Design. "International Conference on Formal Methods in Computer-Aided Design". Portland, Oregon: 2013, p. 218-225.
Keywords
Invariant synthesis, Max-SMT, Program correctness, Termination analysis
Group of research
LOGPROG - Logic and Programming

Participants

Attachments