Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
Distefano, D.S. and Katoen, J.P. and Rensink, A.
(2006)
Safety and Liveness in Concurrent Pointer Programs.
(Invited)
In: Proceedings of the 4th Internatinal Symposium on Formal Methods for Components and Objects, November 1-4, 2005, Amsterdam, The Netherlands.
pp. 280-312.
Lecture Notes in Computer Science 4111.
Springer Verlag.
ISBN 978-3-540-36749-9
This is the latest version of this eprint. Full text available as:
Official URL: http://dx.doi.org/10.1007/11804192_14  AbstractThe 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.
Available Versions of this Item
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||||
