Extending Non-Termination Proof Techniques to Asynchronously Communicating Concurrent Programs

Free registration required

Executive Summary

Currently, no approaches are known that allow for non-termination proofs of concurrent programs which account for asynchronous communication via FIFO message queues. Those programs may be written in high-level languages such as Java or Promela. The authors present a first approach to prove non-termination for such programs. In addition to integers, the programs that they consider may contain queues as data structures. They present a representation of queues and the operations on them in the domain of integers, and generate invariants that help one prove non-termination of selected control flow loops using a theorem proving approach.

  • Format: PDF
  • Size: 458.19 KB