Refinement-based verification for possibly-cyclic lists

Alexey Loginov, Thomas Reps, Mooly Sagiv

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publicationProgram Analysis and Compilation, Theory and Practice - Essays Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday
PublisherSpringer Verlag
Pages247-272
Number of pages26
ISBN (Print)9783540713159
DOIs
StatePublished - 2007
EventSymposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday -
Duration: 9 Jun 200610 Jun 2006

Publication series

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

Conference

ConferenceSymposium on Program Analysis and Compilation, Theory and Practice. Dedicated to Reinhard Wilhelm on the Occasion of His 60th Birthday
Period9/06/0610/06/06

Fingerprint

Dive into the research topics of 'Refinement-based verification for possibly-cyclic lists'. Together they form a unique fingerprint.

Cite this