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.

PDF
Restricted to UT campus only: Request a copy
905Kb

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
Copyright:	© 2006 Springer
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Formal Methods and Tools (FMT)
Link to this item:	http://purl.utwente.nl/publications/63805
Official URL:	http://dx.doi.org/10.1007/11804192_14
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 237770