Proving Termination by Divergence.

Authors:
Domagoj Babic;Alan J. Hu;Zvonimir Rakamaric;Byron Cook
Affiliations:
University of British Columbia;University of British Columbia;University of British Columbia;Microsoft Research
Venue:
SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Year:
2007

Citing 0
Cited 5

A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proving program termination

Communications of the ACM
Termination of loop programs with polynomial guards

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Ranking function synthesis for bit-vector relations

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Termination proofs from tests

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Quantified Score

Hi-index	0.02

Visualization

Abstract

A key challenge for software engineering is to learn how to reconcile the formal world of the machine and its software with the non-formal real world. In this paper, we discuss elements of Problem Oriented Software Engineering (POSE), an approach that ...