Refinement-based verification for possibly-cyclic lists

Alexey Loginov; Thomas Reps; Mooly Sagiv

doi:10.1007/978-3-540-71322-7_12

Refinement-based verification for possibly-cyclic lists

Alexey Loginov^*, Thomas Reps, Mooly Sagiv

^*Corresponding author for this work

School of Computer Science

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

4 Scopus citations

Abstract

In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an acyclic linked list [10]. This paper reports on the automatic verification of the total correctness (partial correctness and termination) of the same list-reversal algorithm, when applied to a possibly-cyclic linked list. A key contribution that made this result possible is an extension of the finite-differencing technique [14] to enable the maintenance of reachability information for a restricted class of possibly-cyclic data structures, which includes possiblycyclic linked lists.

Original language	English
Title of host publication	Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday
Publisher	Springer Verlag
Pages	247-272
Number of pages	26
ISBN (Print)	9783540713159
DOIs	https://doi.org/10.1007/978-3-540-71322-7_12
State	Published - 2007
Event	Symposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday - Duration: 9 Jun 2006 → 10 Jun 2006

Publication series

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

Conference

Conference	Symposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday
Period	9/06/06 → 10/06/06

Access to Document

10.1007/978-3-540-71322-7_12

Cite this

Loginov, A., Reps, T., & Sagiv, M. (2007). Refinement-based verification for possibly-cyclic lists. In Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday (pp. 247-272). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4444 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-540-71322-7_12

Loginov, Alexey ; Reps, Thomas ; Sagiv, Mooly. / Refinement-based verification for possibly-cyclic lists. Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday. Springer Verlag, 2007. pp. 247-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{354253970df04dbaacb3c6fd22d575e9,

title = "Refinement-based verification for possibly-cyclic lists",

abstract = "In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an acyclic linked list [10]. This paper reports on the automatic verification of the total correctness (partial correctness and termination) of the same list-reversal algorithm, when applied to a possibly-cyclic linked list. A key contribution that made this result possible is an extension of the finite-differencing technique [14] to enable the maintenance of reachability information for a restricted class of possibly-cyclic data structures, which includes possiblycyclic linked lists.",

author = "Alexey Loginov and Thomas Reps and Mooly Sagiv",

year = "2007",

doi = "10.1007/978-3-540-71322-7_12",

language = "אנגלית",

isbn = "9783540713159",

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

publisher = "Springer Verlag",

pages = "247--272",

booktitle = "Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday",

address = "גרמניה",

note = "Symposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday ; Conference date: 09-06-2006 Through 10-06-2006",

}

Loginov, A, Reps, T & Sagiv, M 2007, Refinement-based verification for possibly-cyclic lists. in Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4444 LNCS, Springer Verlag, pp. 247-272, Symposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday, 9/06/06. https://doi.org/10.1007/978-3-540-71322-7_12

Refinement-based verification for possibly-cyclic lists. / Loginov, Alexey; Reps, Thomas; Sagiv, Mooly.
Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday. Springer Verlag, 2007. p. 247-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4444 LNCS).

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

TY - GEN

T1 - Refinement-based verification for possibly-cyclic lists

AU - Loginov, Alexey

AU - Reps, Thomas

AU - Sagiv, Mooly

PY - 2007

Y1 - 2007

N2 - In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an acyclic linked list [10]. This paper reports on the automatic verification of the total correctness (partial correctness and termination) of the same list-reversal algorithm, when applied to a possibly-cyclic linked list. A key contribution that made this result possible is an extension of the finite-differencing technique [14] to enable the maintenance of reachability information for a restricted class of possibly-cyclic data structures, which includes possiblycyclic linked lists.

AB - In earlier work, we presented an abstraction-refinement mechanism that was successful in verifying automatically the partial correctness of in-situ list reversal when applied to an acyclic linked list [10]. This paper reports on the automatic verification of the total correctness (partial correctness and termination) of the same list-reversal algorithm, when applied to a possibly-cyclic linked list. A key contribution that made this result possible is an extension of the finite-differencing technique [14] to enable the maintenance of reachability information for a restricted class of possibly-cyclic data structures, which includes possiblycyclic linked lists.

UR - http://www.scopus.com/inward/record.url?scp=39149084710&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-71322-7_12

DO - 10.1007/978-3-540-71322-7_12

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

AN - SCOPUS:39149084710

SN - 9783540713159

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

SP - 247

EP - 272

BT - Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday

PB - Springer Verlag

T2 - Symposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday

Y2 - 9 June 2006 through 10 June 2006

ER -

Loginov A, Reps T, Sagiv M. Refinement-based verification for possibly-cyclic lists. In Program Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday. Springer Verlag. 2007. p. 247-272. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-71322-7_12

Refinement-based verification for possibly-cyclic lists

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this