Brief Announcement: Verification of Stabilizing Programs with SMT Solvers Jingshu Chen and Sandeep Kulkarni Michigan State University, 3115 Engineering Building, 48824 East Lansing, US Abstract. We focus on the verification of stabilizing programs using SMT solvers. SMT solvers have the potential to convert the verification problem into a satisfiability problem of a Boolean formula and utilize efficient techniques to determine whether it is satisfiable. In this work, we study the approach of utilizing techniques from bounded model checking to determine whether the given program is stabilizing. Key words: Verification, Stabilization, Model checking 1 Introduction One of the successful automated approaches is model checking [2]. Model check- ing is a technique to automatically verify whether a given model meets a given property. If the program does not meet the given property, the process of model checking typically produces a counterexample. In this paper, we evaluate the effectiveness of SMT solvers in verifying stabi- lization with the use of bounded model checking. The process of using bounded model checking stabilization to verify consists of two parts, (1) verification of closure and (2) verification of convergence. Specifically, the former requires that if the program begins in a legitimate state then it remains in legitimate states. And, the latter requires that if the program starts in a state outside its set of legitimate states then it eventually reaches a legitimate state. 2 Approach for Verifying Stabilization with SMT Solvers In this section, we present the approach of verifying self-stabilization properties with SMT solvers by utilizing techniques from bounded model checking. Verification of stabilization consists of two parts: (1) verifying closure and (2) verifying convergence. In Section 2.1, we identify the formula whose satisfiability can be used to determine whether closure property is satisfied. In Section 2.2, we identify the formula whose satisfiability can be used to determine whether convergence property is satisifed. 2.1 Verifying Closure Let P be the given program and let I be the legitimate state predicate to con- clude that P is stabilizing. Let T be the predicate that characterizes transitions of P .