Source Transformation for Concurrency Analysis

Authors:
Timothy Cassidy;James R. Cordy;Thomas R. Dean;Juergen Dingel
Affiliations:
School of Computing, Queen's University, Kingston, Canada;School of Computing, Queen's University, Kingston, Canada;School of Computing, Queen's University, Kingston, Canada;School of Computing, Queen's University, Kingston, Canada
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 12
Cited 0

Dynamic memory allocation and garbage collection

Computers in Physics
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
On the costs and benefits of using partial-order methods for the verification of concurrent systems (invited paper)

POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Bandera: extracting finite-state models from Java source code

Proceedings of the 22nd international conference on Software engineering
The SLAM project: debugging system software via static analysis

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency

Communication and Concurrency
Software model checking in practice: an industrial case study

Proceedings of the 24th International Conference on Software Engineering
Model Checking Programs

Automated Software Engineering
Uniprocessor Garbage Collection Techniques

IWMM '92 Proceedings of the International Workshop on Memory Management
NuSMV 2: An OpenSource Tool for Symbolic Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The NCSU Concurrency Workbench

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
KISS: keep it simple and sequential

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent programming poses a unique set of problems for quality assurance. These difficulties include the complexities of deadlock, livelock and divergence, which can be extremely difficult to detect and debug. A variety of tools have been developed to assist designers and developers of concurrent applications. Some of these tools, such as VeriSoft, are specific to particular implementation languages, such as C++. The Java Remote Method Invocation (Java RMI) package facilitates the implementation of concurrent applications, including those where processes reside on different hosts and communicate over networks. Unfortunately, it does not relieve the developer from the potential pitfalls of controlling concurrent access to remote objects, and may, in fact, make concurrency problems even more difficult to find. This paper presents an approach that allows the VeriSoft state exploration system to be used to analyze Java RMI programs for deadlock, livelock, divergence, and assertion violations. The system works by transforming Java RMI programs into C++ programs where Java syntax, structure, concurrency and memory management are replaced by C++ equivalents and Java RMI communication has been transformed to VeriSoft C++ inter-process communication. We present the details of this transformation and discuss preliminary results for a number of small examples.