Ranking abstractions

Aziem Chawdhary; Byron Cook; Sumit Gulwani; Mooly Sagiv; Hongseok Yang

doi:10.1007/978-3-540-78739-6_13

Ranking abstractions

Aziem Chawdhary^*
, Byron Cook
, Sumit Gulwani
, Mooly Sagiv
, Hongseok Yang

^*Corresponding author for this work

School of Computer Science and AI

Queen Mary University of London
Microsoft USA

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

23 Scopus citations

Abstract

We propose an abstract interpretation algorithm for proving that a program terminates on all inputs. The algorithm uses a novel abstract domain which uses ranking relations to conservatively represent relations between intermediate program states. One of the attractive aspects of the algorithm is that it abstracts information that is usually not important for proving termination such as program invariants and yet it distinguishes between different reasons for termination which are not usually maintained in existing abstract domains. We have implemented a prototype of the algorithm and shown that in practice it is fast and precise.

Original language	English
Title of host publication	Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings
Publisher	Springer Verlag
Pages	148-162
Number of pages	15
ISBN (Print)	3540787380, 9783540787389
DOIs	https://doi.org/10.1007/978-3-540-78739-6_13
State	Published - 2008
Event	17th European Symposium on Programming, ESOP 2008 - Budapest, Hungary Duration: 29 Mar 2008 → 6 Apr 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4960 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	17th European Symposium on Programming, ESOP 2008
Country/Territory	Hungary
City	Budapest
Period	29/03/08 → 6/04/08

Funding

Funders	Funder number
Engineering and Physical Sciences Research Council	EP/E053041/1

Access to Document

10.1007/978-3-540-78739-6_13

Cite this

Chawdhary, A., Cook, B., Gulwani, S., Sagiv, M., & Yang, H. (2008). Ranking abstractions. In Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings (pp. 148-162). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4960 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-78739-6_13

Chawdhary, Aziem ; Cook, Byron ; Gulwani, Sumit et al. / Ranking abstractions. Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings. Springer Verlag, 2008. pp. 148-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{664c7ad018594a3ca86127ab1d6c8557,

title = "Ranking abstractions",

abstract = "We propose an abstract interpretation algorithm for proving that a program terminates on all inputs. The algorithm uses a novel abstract domain which uses ranking relations to conservatively represent relations between intermediate program states. One of the attractive aspects of the algorithm is that it abstracts information that is usually not important for proving termination such as program invariants and yet it distinguishes between different reasons for termination which are not usually maintained in existing abstract domains. We have implemented a prototype of the algorithm and shown that in practice it is fast and precise.",

author = "Aziem Chawdhary and Byron Cook and Sumit Gulwani and Mooly Sagiv and Hongseok Yang",

year = "2008",

doi = "10.1007/978-3-540-78739-6\_13",

language = "אנגלית",

isbn = "3540787380",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "148--162",

booktitle = "Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings",

address = "גרמניה",

note = "17th European Symposium on Programming, ESOP 2008 ; Conference date: 29-03-2008 Through 06-04-2008",

}

Chawdhary, A, Cook, B, Gulwani, S, Sagiv, M & Yang, H 2008, Ranking abstractions. in Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4960 LNCS, Springer Verlag, pp. 148-162, 17th European Symposium on Programming, ESOP 2008, Budapest, Hungary, 29/03/08. https://doi.org/10.1007/978-3-540-78739-6_13

Ranking abstractions. / Chawdhary, Aziem; Cook, Byron; Gulwani, Sumit et al.
Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings. Springer Verlag, 2008. p. 148-162 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4960 LNCS).

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

TY - GEN

T1 - Ranking abstractions

AU - Chawdhary, Aziem

AU - Cook, Byron

AU - Gulwani, Sumit

AU - Sagiv, Mooly

AU - Yang, Hongseok

PY - 2008

Y1 - 2008

N2 - We propose an abstract interpretation algorithm for proving that a program terminates on all inputs. The algorithm uses a novel abstract domain which uses ranking relations to conservatively represent relations between intermediate program states. One of the attractive aspects of the algorithm is that it abstracts information that is usually not important for proving termination such as program invariants and yet it distinguishes between different reasons for termination which are not usually maintained in existing abstract domains. We have implemented a prototype of the algorithm and shown that in practice it is fast and precise.

AB - We propose an abstract interpretation algorithm for proving that a program terminates on all inputs. The algorithm uses a novel abstract domain which uses ranking relations to conservatively represent relations between intermediate program states. One of the attractive aspects of the algorithm is that it abstracts information that is usually not important for proving termination such as program invariants and yet it distinguishes between different reasons for termination which are not usually maintained in existing abstract domains. We have implemented a prototype of the algorithm and shown that in practice it is fast and precise.

UR - https://www.scopus.com/pages/publications/47249095020

U2 - 10.1007/978-3-540-78739-6_13

DO - 10.1007/978-3-540-78739-6_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:47249095020

SN - 3540787380

SN - 9783540787389

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 148

EP - 162

BT - Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings

PB - Springer Verlag

T2 - 17th European Symposium on Programming, ESOP 2008

Y2 - 29 March 2008 through 6 April 2008

ER -

Chawdhary A, Cook B, Gulwani S, Sagiv M, Yang H. Ranking abstractions. In Programming Languages and Systems - 17th European Symposium on Programming, ESOP 2008 - Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Proceedings. Springer Verlag. 2008. p. 148-162. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-78739-6_13

Ranking abstractions

Abstract

Publication series

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this