Dimitrova, R. and Podelski, A. (2008) Is lazy abstraction a decision procedure for broadcast protocols? In: Logozzo, F., Peled, D.A. and Zuck, L.D., (eds.) Verification, Model Checking, and Abstract Interpretation - VMCAI 2008. Verification, Model Checking, and Abstract Interpretation - VMCAI 2008, 07-09 Jan 2008, San Francisco, USA. Lecture Notes in Computer Science (4905). Springer , pp. 98-111. ISBN 9783540781622
Abstract
Lazy abstraction builds up an abstract reachability tree by locally refining abstractions in order to eliminate spurious counterexamples in smaller and smaller subtrees. The method has proven useful to verify systems code. It is still open how good the method is as a decision procedure, i.e., whether the method terminates for already known decidable verification problems. In this paper, we answer the question positively for broadcast protocols and other infinite-state models in the class of so-called well-structured systems. This extends an existing result on systems with a finite bisimulation quotient.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2008 Springer-Verlag. This is an author-produced version of a paper subsequently published in VMCAI 2008 Proceedings. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Decision Procedure; Coverability Problem; Label Transition System; Reachable Region; Broadcast Protocol |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 07 Feb 2020 14:36 |
Last Modified: | 08 Feb 2020 18:48 |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Refereed: | Yes |
Identification Number: | 10.1007/978-3-540-78163-9_12 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:156483 |