Development of a debugger for a concurrent language

Authors:
F. Baiardi;N. De Francesco;E. Matteoli;S. Stefanini;G. Vaglini
Affiliations:
-;-;-;-;-
Venue:
SIGSOFT '83 Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging
Year:
1983

Citing 4
Cited 6

Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Communicating sequential processes

Communications of the ACM
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory

Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line code

Proceedings of the 5th Colloquium on International Symposium on Programming

Handling Timing Errors in Distributed Programs

IEEE Transactions on Software Engineering
A Kernel for High-Performance Multicast Communications

IEEE Transactions on Computers
A Debugger for Ada Tasking

IEEE Transactions on Software Engineering
Data path debugging: data-oriented debugging for a concurrent programming language

PADD '88 Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging
A bibliography of parallel debuggers, 1990 edition

ACM SIGPLAN Notices
Execution monitoring and debugging tool for Ada using relational algebra

SIGAda '85 Proceedings of the 1985 annual ACM SIGAda international conference on Ada

Quantified Score

Hi-index	0.01

Visualization

Abstract

This work discusses some issues in the debugging of concurrent programs. A set of desirable characteristics of a debugger for concurrent languages is deduced from an examination of the differences between the debugging of concurrent programs and that of sequential ones. A debugger for a concurrent language, derived from CSP, is then presented. It is based upon a semantic model of the supported language. The debugger enables to compare a description of the program behavior to the actual behavior as well as to valuate assertions on the process state. The description of the behavior is given by a formalism whose semantics is also specified. The formalism can specify program behaviors at various abstraction levels. Lastly some guidelines for the implementation of the debugger are shown and a detailed example of program description is analyzed.