Safety and Liveness in Concurrent Pointer Programs


Distefano, Dino and Katoen, Joost-Pieter and Rensink, Arend (2006) Safety and Liveness in Concurrent Pointer Programs. In: 4th Internatinal Symposium on Formal Methods for Components and Objects, FMCO 2005, November 1-4, 2005, Amsterdam, The Netherlands (pp. pp. 280-312).

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:The incorrect use of pointers is one of the most common source of software errors. Concurrency has a similar characteristic. Proving the correctness of concurrent pointer manipulating programs, let alone algorithmically, is a highly non-trivial task. This paper proposes an automated verification technique for concurrent programs that manipulate linked lists. Key issues of our approach are: automata (with fairness constraints), heap abstractions that are tailored to the program and property to be checked, first-order temporal logic, and a tableau-based model-checking algorithm.
Item Type:Conference or Workshop Item
Additional information:Revised Lectures
Copyright:© 2006 Springer
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 237770