@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",
note = "null ; Conference date: 09-06-2006 Through 10-06-2006",
}