Size-change termination and transition invariants

Matthias  Heizmann; Neil Jones; Andreas Podelski

doi:10.1007/978-3-642-15769-1_4

Size-change termination and transition invariants

Matthias Heizmann, Neil Jones, Andreas Podelski

Department of Computer Science

21 Citations (Scopus)

Abstract

Two directions of recent work on program termination use the concepts of size-change termination resp. transition invariants. The difference in the setting has as consequence the inherent incomparability of the analysis and verification methods that result from this work. Yet, in order to facilitate the crossover of ideas and techniques in further developments, it seems interesting to identify which aspects in the respective formal foundation are related. This paper presents initial results in this direction.

Original language	English
Title of host publication	Static Analysis : 17th International Symposium, SAS 2010, Perpignan, France, September 14-16, 2010. Proceedings
Editors	Radhia Cousot, Matthieu Martel
Number of pages	29
Publisher	Springer
Publication date	2010
Pages	22-50
ISBN (Print)	978-3-642-15768-4
ISBN (Electronic)	978-3-642-15769-1
DOIs	https://doi.org/10.1007/978-3-642-15769-1_4
Publication status	Published - 2010
Event	17th International Symposium on Static Analysis - Perpignan, France Duration: 14 Sept 2010 → 16 Sept 2010 Conference number: 17

Conference

Conference	17th International Symposium on Static Analysis
Number	17
Country/Territory	France
City	Perpignan
Period	14/09/2010 → 16/09/2010

Series	Lecture notes in computer science
Volume	6337
ISSN	0302-9743

Access to Document

10.1007/978-3-642-15769-1_4

Cite this

Size-change termination and transition invariants. / Heizmann, Matthias ; Jones, Neil; Podelski, Andreas.

Static Analysis: 17th International Symposium, SAS 2010, Perpignan, France, September 14-16, 2010. Proceedings. ed. / Radhia Cousot; Matthieu Martel. Springer, 2010. p. 22-50 (Lecture notes in computer science, Vol. 6337).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Heizmann, M, Jones, N & Podelski, A 2010, Size-change termination and transition invariants. in R Cousot & M Martel (eds), Static Analysis: 17th International Symposium, SAS 2010, Perpignan, France, September 14-16, 2010. Proceedings. Springer, Lecture notes in computer science, vol. 6337, pp. 22-50, 17th International Symposium on Static Analysis, Perpignan, France, 14/09/2010. https://doi.org/10.1007/978-3-642-15769-1_4

@inproceedings{f3fb8271a0fe461cbbff6add5cd56277,

title = "Size-change termination and transition invariants",

abstract = "Two directions of recent work on program termination use the concepts of size-change termination resp. transition invariants. The difference in the setting has as consequence the inherent incomparability of the analysis and verification methods that result from this work. Yet, in order to facilitate the crossover of ideas and techniques in further developments, it seems interesting to identify which aspects in the respective formal foundation are related. This paper presents initial results in this direction.",

author = "Matthias Heizmann and Neil Jones and Andreas Podelski",

year = "2010",

doi = "10.1007/978-3-642-15769-1_4",

language = "English",

isbn = "978-3-642-15768-4",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "22--50",

editor = "Radhia Cousot and Matthieu Martel",

booktitle = "Static Analysis",

note = "17th International Symposium on Static Analysis ; Conference date: 14-09-2010 Through 16-09-2010",

}

TY - GEN

T1 - Size-change termination and transition invariants

AU - Heizmann, Matthias

AU - Jones, Neil

AU - Podelski, Andreas

N1 - Conference code: 17

PY - 2010

Y1 - 2010

N2 - Two directions of recent work on program termination use the concepts of size-change termination resp. transition invariants. The difference in the setting has as consequence the inherent incomparability of the analysis and verification methods that result from this work. Yet, in order to facilitate the crossover of ideas and techniques in further developments, it seems interesting to identify which aspects in the respective formal foundation are related. This paper presents initial results in this direction.

AB - Two directions of recent work on program termination use the concepts of size-change termination resp. transition invariants. The difference in the setting has as consequence the inherent incomparability of the analysis and verification methods that result from this work. Yet, in order to facilitate the crossover of ideas and techniques in further developments, it seems interesting to identify which aspects in the respective formal foundation are related. This paper presents initial results in this direction.

U2 - 10.1007/978-3-642-15769-1_4

DO - 10.1007/978-3-642-15769-1_4

M3 - Article in proceedings

SN - 978-3-642-15768-4

T3 - Lecture notes in computer science

SP - 22

EP - 50

BT - Static Analysis

A2 - Cousot, Radhia

A2 - Martel, Matthieu

PB - Springer

T2 - 17th International Symposium on Static Analysis

Y2 - 14 September 2010 through 16 September 2010

ER -