SMT-Based verification of parameterized systems

Arie Gurfinkel, Sharon Shoham, Yuri Meshman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

It is well known that verification of safety properties of sequential programs is reducible to satisfiability modulo theory of a first-order logic formula, called a verification condition (VC). The reduction is used both in deductive and automated verification, the difference is only in whether the user or the solver provides candidates for inductive invariants. In this paper, we extend the reduction to parameterized systems consisting of arbitrary many copies of a user-specified process, and whose transition relation is definable in firstorder logic modulo theory of linear arithmetic and arrays. We show that deciding whether a parameterized system has a universally quantified inductive invariant is reducible to satisfiability of (non-linear) Constraint Horn Clauses (CHC). As a consequence of our reduction, we obtain a new automated procedure for verifying parameterized systems using existing PDR and CHC engines. While the new procedure is applicable to a wide variety of systems, we show that it is a decision procedure for several decidable fragments.

Original languageEnglish
Title of host publicationFSE 2016 - Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering
EditorsZhendong Su, Thomas Zimmermann, Jane Cleland-Huang
PublisherAssociation for Computing Machinery
Pages338-348
Number of pages11
ISBN (Electronic)9781450342186
DOIs
StatePublished - 1 Nov 2016
Event24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2016 - Seattle, United States
Duration: 13 Nov 201618 Nov 2016

Publication series

NameProceedings of the ACM SIGSOFT Symposium on the Foundations of Software Engineering
Volume13-18-November-2016

Conference

Conference24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, FSE 2016
Country/TerritoryUnited States
CitySeattle
Period13/11/1618/11/16

Keywords

  • Invariant Inference
  • Model Checking
  • Parameterized Systems
  • Safety Verification

Fingerprint

Dive into the research topics of 'SMT-Based verification of parameterized systems'. Together they form a unique fingerprint.

Cite this