Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

, , 1--27 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.

Summary: , , 1--27 ()
fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
Using Integer Programming to Verify General
Safety and Liveness Properties
JAMES C. CORBETT corbett@hawaii.edu
University of Hawaii at Manoa
GEORGE S. AVRUNIN avrunin@math.umass.edu
University of Massachusetts at Amherst
Abstract. Analysis of concurrent systems is plagued by the state explosion problem. We
describe an analysis technique that uses necessary conditions, in the form of linear inequalities, to
verify certain properties of concurrent systems, thus avoiding the enumeration of the potentially
explosive number of reachable states of the system. This technique has been shown to be capable
of verifying simple safety properties, like freedom from deadlock, that can be expressed in terms
of the number of certain events occurring in a finite execution, and has been successfully used
to analyze a variety of concurrent software systems. In this paper, we extend the technique to
the verification of more complex safety properties that involve the order of events and to the
verification of liveness properties, which involve infinite executions.
Keywords: Concurrent systems, automated verification, integer programming, safety, liveness


Source: Avrunin, George S. - Department of Mathematics and Statistics, University of Massachusetts at Amherst


Collections: Mathematics