{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:31Z","timestamp":1725535831083},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Currently, there are no approaches 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. We present a \ufb01rst approach to prove non-termination for such programs. In addition to integers, the programs that we consider may contain queues as data structures. We present a representation of queues and the operations on them in the domain of integers, and generate invariants that help us prove non-termination of selected control \ufb02ow loops using a theorem proving approach. We illustrate this approach by applying a prototype tool implementation to a number of case studies.<\/jats:p>","DOI":"10.29007\/c7v2","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T16:38:54Z","timestamp":1516725534000},"page":"132-115","source":"Crossref","is-referenced-by-count":0,"title":["Extending Non-Termination Proof Techniques to Asynchronously Communicating Concurrent Programs"],"prefix":"10.29007","volume":"1","author":[{"given":"Matthias","family":"Kuntz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Leue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Scheben","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"WING 2010. Workshop on Invariant Generation 2010"},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T16:38:58Z","timestamp":1516725538000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/nND"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/c7v2","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}