Parallel bounded verification of alloy models by tranScoping

Nicolás Rosner, Carlos Gustavo López Pombo, Nazareno Aguirre, Ali Jaoua, Ali Mili, Marcelo F. Frias

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Bounded verification is a technique associated with the Alloy specification language that allows one to analyze Alloy software models by looking for counterexamples of intended properties, under the assumption that data type domains are restricted in size by a provided bound (called the scope of the analysis). The absence of errors in the analyzed models is relative to the provided scope, so achieving verifiability in larger scopes is necessary in order to provide higher confidence in model correctness. Unfortunately, analysis time usually grows exponentially as the scope is increased. A technique that helps in scaling up bounded verification is parallelization. However, the performance of parallel bounded verification greatly depends on the particular strategy used for partitioning the original analysis problem, which in the context of Alloy is a boolean satisfiability problem. In this article we present a novel technique called tranScoping, which aims at improving the scalability of bounded exhaustive analysis by using information mined at smaller scopes to guide decision making at larger ones. In its application to parallel analysis, tranScoping compares different ways to split an Alloy-borne SAT problem at small scopes, and extrapolates this information to select an adequate partitioning criterion for larger scopes. As our experiments show, tranScoping allows us to find suitable criteria that extend the tractability barrier, and in particular leads to successful analysis of models on scopes that have been elusive for years.

Original languageEnglish (US)
Title of host publicationVerified Software
Subtitle of host publicationTheories, Tools, Experiments - 5th International Conference, VSTTE 2013, Revised Selected Papers
EditorsErnie Cohen, Andrey Rybalchenko, Andrey Rybalchenko
PublisherSpringer Verlag
Pages88-107
Number of pages20
ISBN (Electronic)9783642541070
DOIs
StatePublished - 2014
Event5th International Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2013 - Menlo Park, United States
Duration: May 17 2013May 19 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8164
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on Verified Software: Theories, Tools, Experiments, VSTTE 2013
Country/TerritoryUnited States
CityMenlo Park
Period5/17/135/19/13

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Keywords

  • Alloy Analyzer
  • Bounded verification
  • Parallel SAT-solving
  • Parallel analysis

Fingerprint

Dive into the research topics of 'Parallel bounded verification of alloy models by tranScoping'. Together they form a unique fingerprint.

Cite this