Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
All for the price of few: (Parameterized verification through view abstraction)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Algorithmic Program Verification)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Algorithmic Program Verification)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2013 (English)In: Verification, Model Checking, and Abstract Interpretation, Springer Berlin/Heidelberg, 2013, p. 476-495Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. p. 476-495
Series
Lecture Notes in Computer Science ; 7737
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-190003DOI: 10.1007/978-3-642-35873-9_28ISBN: 978-3-642-35872-2 (print)OAI: oai:DiVA.org:uu-190003DiVA, id: diva2:582745
Conference
VMCAI 2013, January 20-22, Rome, Italy
Projects
UPMARCAvailable from: 2013-01-09 Created: 2013-01-07 Last updated: 2015-11-10Bibliographically approved
In thesis
1. Few is Just Enough!: Small Model Theorem for Parameterized Verification and Shape Analysis
Open this publication in new window or tab >>Few is Just Enough!: Small Model Theorem for Parameterized Verification and Shape Analysis
2015 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees.

The task is to show correctness regardless of the size of the system and we consider two methods to prove safety:(i) a backward reachability analysis, using the well-quasi ordered framework and monotonic abstraction, and (ii) a forward analysis which only needs to inspect a small number of components in order to show correctness of the whole system. The latter relies on an abstraction function that views the system from the perspective of a fixed number of components. The abstraction is used during the verification procedure in order to dynamically detect cut-off points beyond which the search of the state-space need not continue.

Our experimentation on a variety of benchmarks demonstrate that the method is highly efficient and that it works well even for classes of systems with undecidable property. It has been, for example, successfully applied to verify a fine-grained model of Szymanski's mutual exclusion protocol. Finally, we applied the methods to solve the complex problem of verifying highly concurrent data-structures, in a challenging setting: We do not a priori bound the number of threads, the size of the data-structure, the domain of the data to store nor do we require the presence of a garbage collector. We successfully verified the concurrent Treiber's stack and Michael & Scott's queue, in the aforementioned setting.

To the best of our knowledge, these verification problems have been considered challenging in the parameterized verification community and could not be carried out automatically by other existing methods.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2015. p. 123
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1302
Keywords
program verification, model checking, parameterized systems, infinite-state systems, reachability, approximation, safety, tree systems, shape analysis, small model properties, view abstraction, monotonic abstraction
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:uu:diva-264171 (URN)978-91-554-9366-0 (ISBN)
Public defence
2015-11-18, ITC 2446, Lägerhyddsvägen 2, Uppsala, 13:00 (English)
Opponent
Supervisors
Available from: 2015-10-28 Created: 2015-10-06 Last updated: 2015-12-17

Open Access in DiVA

vmcai2013(199 kB)322 downloads
File information
File name FULLTEXT01.pdfFile size 199 kBChecksum SHA-512
6362943c5303bde4d2489b05bf4dcc5758a580df22adfa72a3956ca7a6bebb7fa39673b4ec911f6679cd6a61bfab4d3132cce27da17cb41bd796ed6781edb481
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Abdulla, Parosh AzizHaziza, FrédéricHolík, Lukáš
By organisation
Computer Systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 322 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 919 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf