Temporal Debugging for Concurrent Systems

  • Elsa Gunter
  • Doron Peled
Conference paper

DOI: 10.1007/3-540-46002-0_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2280)
Cite this paper as:
Gunter E., Peled D. (2002) Temporal Debugging for Concurrent Systems. In: Katoen JP., Stevens P. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Lecture Notes in Computer Science, vol 2280. Springer, Berlin, Heidelberg

Abstract

Temporal logic is often used as the specification formalism for the automatic verification of finite state systems. The automatic temporal verification of a system is a procedure that returns a yes/no answer, and in the latter case also provides a counterexample. In this paper we suggest a new application for temporal logic, as a way of assisting the debugging of a concurrent or a sequential program. We employ temporal logic over finite sequences as a constraint formalism that is used to control the way we step through the states of the debugged system. Using such temporal specification and various search strategies, we are able to traverse the executions of the system and obtain important intuitive information about its behaviors. We describe an implementation of these ideas as a debugging tool.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Elsa Gunter
    • 1
  • Doron Peled
    • 2
  1. 1.Department of Computer ScienceNew Jersey Institute of TechnologyNewarkUSA
  2. 2.Dept. of Elect. and Computer Eng.The University of Texas at AustinAustinUSA

Personalised recommendations