Query-based debugging of object-oriented programs
Authors:
Open Access
- 9 October 1997
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 32 (10) , 304-317
Abstract
Object relationships in modem software systems are becoming increasingly numerous and complex. Programmers who try to find violations of such relationships need new tools that allow them to explore objects in a large system more efficiently. Many existing debuggers present only a low-level, one-object-at-a-time view of objects and their relationships. We propose a new solution to overcome these problems: query-based debugging. The implementation of the query-based debugger described here offers programmers an effective query tool that allows efficient searching of large object spaces and quick verification of complex relationships. Even for programs that have large numbers of objects, the debugger achieves interactive response times for common queries by using a combination of fast searching primitives, query optimization, and incremental result delivery.Keywords
This publication has 24 references indexed in Scilit:
- Object-oriented program tracing and visualizationComputer, 1997
- Reconciling responsiveness with performance in pure object-oriented languagesACM Transactions on Programming Languages and Systems, 1996
- DDD—a free graphical front-end for UNIX debuggersACM SIGPLAN Notices, 1996
- Pavane: a system for declarative visualization of concurrent computationsJournal of Visual Languages & Computing, 1992
- Join processing in relational databasesACM Computing Surveys, 1992
- PortiaACM SIGPLAN Notices, 1991
- Object identity as a query language primitiveACM SIGMOD Record, 1989
- Efficiently updating materialized viewsACM SIGMOD Record, 1986
- On the optimal nesting order for computing N -relational joinsACM Transactions on Database Systems, 1984
- Efficiently monitoring relational databasesACM Transactions on Database Systems, 1979