uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Block me if you can!: Context-sensitive parameterized verification
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2014 (English)In: Static Analysis: SAS 2014, Springer, 2014, 1-17 p.Conference paper, Published paper (Refereed)
Abstract [en]

We present a method for automatic verification of systems with a parameterized number of communicating processes, such as mutual exclusion protocols or agreement protocols. To that end, we present a powerful abstraction framework that uses an efficient and precise symbolic encoding of (infinite) sets of configurations. In particular, it generalizes downward-closed sets that have successfully been used in earlier approaches to parameterized verification. We show experimentally the efficiency of the method, on various examples, including a fine-grained model of Szymanski’s mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.

Place, publisher, year, edition, pages
Springer, 2014. 1-17 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 8723
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-260087DOI: 10.1007/978-3-319-10936-7_1ISI: 000360204700001ISBN: 978-3-319-10935-0 (print)OAI: oai:DiVA.org:uu-260087DiVA: diva2:846306
Conference
21st International Symposium, SAS 2014, September 11–13, Munich, Germany
Projects
UPMARC
Available from: 2014-09-13 Created: 2015-08-15 Last updated: 2015-12-16Bibliographically 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. 123 p.
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 1302
Keyword
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

fulltext(588 kB)80 downloads
File information
File name FULLTEXT01.pdfFile size 588 kBChecksum SHA-512
964ee1476ecb2083a384c7c816b4f7542a0f3d8a9a9bf73a0a060a941b284f5a00d62634d515ce406b4483ae6d907df83803cde7a59690d1734fd858a54b56cb
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Abdulla, Parosh AzizHaziza, Frédéric

Search in DiVA

By author/editor
Abdulla, Parosh AzizHaziza, Frédéric
By organisation
Computer Systems
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 80 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: 1801 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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