Safety and liveness in concurrent pointer programs

Authors:
Dino Distefano;Joost-Pieter Katoen;Arend Rensink
Affiliations:
Dept. of Computer Science, Queen Mary, University of London, United Kingdom;Software Modeling and Verification Group, RWTH Aachen, Germany;Formal Methods and Tools, University of Twente, The Netherlands
Venue:
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Year:
2005

Citing 31
Cited 2

Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Interprocedural may-alias analysis for pointers: beyond k-limiting

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Automatic verification of pointer programs using monadic second-order logic

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On quantified modal logic

Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Resolution of dynamic memory allocation and pointers for the behavioral synthesis form C

DATE '00 Proceedings of the conference on Design, automation and test in Europe
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The pointer assertion logic engine

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
An assertion language for data structures

POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Handbook of Process Algebra

Handbook of Process Algebra
Verifying reachability invariants of linked structures

POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Labelled Modal Logics: Quantifiers

Journal of Logic, Language and Information
Static Detection of Pointer Errors: An Axiomatisation and a Checking Algorithm

ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
A Spatial Logic for Querying Graphs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Automated Verification of Concurrent Linked Lists with Counters

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Model Checking Birth and Death

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Storeless semantics and alias logic

Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Separation and information hiding

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Static analysis of accessed regions in recursive data structures

SAS'03 Proceedings of the 10th international conference on Static analysis
Verifying temporal heap properties specified via evolution logic

ESOP'03 Proceedings of the 12th European conference on Programming
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
A parametric model for the analysis of mobile ambients

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Predicate abstraction and canonical abstraction for singly-linked lists

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Verifying programs with dynamic 1-selector-linked structures in regular model checking

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A decidable fragment of separation logic

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Who is pointing when to whom?

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science

Verifying Dynamic Pointer-Manipulating Threads

FM '08 Proceedings of the 15th international symposium on Formal Methods
A local greibach normal form for hyperedge replacement grammars

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications

Quantified Score

Hi-index	0.00

Visualization

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.