skip to main content
10.1145/178243.178477acmconferencesArticle/Chapter ViewAbstractPublication PagespldiConference Proceedingsconference-collections
Article
Free Access

Optimal tracing and incremental reexecution for debugging long-running programs

Published:01 June 1994Publication History
First page image

References

  1. 1.Hiralal Agrawal, Richard A. DeMiUo, and Eugene H. Spafford, "An Execution-Backtracking Approach to Debugging," IEEE Software, pp. 21-26 (May 1991). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Thomas Ball and James R. Larus, "Optimally Profiring and Tracing Programs," Symp. on Principles of Programming Languages, pp. 59-70 (january 1992). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Jong-Deok Choi and Janice M. Stone, "Balancing Runtime and Replay Costs in a Trace-and-Replay System," A CM/ONR Workshop on Parallel and Distributed Debugging, pp. 26-35 Santa Cruz, CA, (May 1991). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Jong-Deok Choi, Barton P. Miller, and Robert H. B. Netzer, "Techniques for Debugging Parallel Programs with Flowback Analysis," A CM Trans. on Programming Languages and Systems 13(4)pp. 491-530 (October 1991). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Stuart i. Feldman and Channing B. Brown, "IGOR: A System for Program Debugging via Reversible Execution," Proc. of the SiGPLAN/SiGOPS Workshop on Parallel and Distributed Debugging, Madison, Wi, (May 1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.James R. Larus, "Abstract Execution: A Technique for Efficiently Tracing Programs," Software Practice and Experience 20(12) pp. 1241-1258 (December 1990). Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.James R. Larus, "Efficient Program Tracing," IEEE Computer 26(5) pp. 52-61 (May 1993). Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Kai Li and W. K. Fuchs, "Compiler Assisted Static Checkpoint Insertion," Proc. of Fault Tolerant Computing Systems, (1992).Google ScholarGoogle Scholar
  9. 9.j.M. MeUor-Crummey and T. J. LeBlanc, "A Software Instruction Counter," Proc. of the Third ASP- LOS, (April, 1989). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.Barton P. Miller and Jong-Deok Choi, "A Mechanism for Efficient Debugging of Parallel Programs," SIGPLAN Conf. on Programming Language Design and implementation, pp. 135-144 Atlanta, GA, (June 1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.James S. Plank and Kai Li, "Faster Checkpointing with N+i Parity," Tech Report CS-93-219, Univ. of Tennessee, (Dec 1993). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Steven P. Reiss, "Trace-Based Debugging," AADE- BUG '93, Linkoping, Sweden, (May 1993). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Robert Wahbe, Steven Lucco, and Susan L. Graham, "Practical Data Breakpoints: Design and Implementation," SIG?LAN'93 Conference on Programming Language Design and Implementation, pp. 1-12 Albuquerque, NM, (June 1993). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.Paul R. Wilson and Thomas G. Moher, "Demonic Memory for Process Histories," Proc. of the SIG- PLAN '89 ?LDI Conf., pp. 330-343 (June 1989). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Optimal tracing and incremental reexecution for debugging long-running programs

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          PLDI '94: Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
          August 1994
          360 pages
          ISBN:089791662X
          DOI:10.1145/178243

          Copyright © 1994 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 June 1994

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate406of2,067submissions,20%

          Upcoming Conference

          PLDI '24

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader