Safety Verification of Asynchronous Pushdown Systems with Shaped Stacks


In this paper, we study the program-point reachability problem of con-<lb>current pushdown systems that communicate asynchronously via unbounded and<lb>unordered message buffers. Our goal is to relax the common restriction that mes-<lb>sages can only be retrieved by a pushdown process when its stack is empty. We<lb>introduce a new class of asynchronously… (More)
DOI: 10.1007/978-3-642-40184-8_21

2 Figures and Tables


  • Presentations referencing similar topics