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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Distefano, D., Katoen, J. P., & Rensink, A. (2006). Safety and liveness in concurrent pointer programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4111 LNCS, pp. 280–312). Springer Verlag. https://doi.org/10.1007/11804192_14
Mendeley helps you to discover research relevant for your work.