Brief Announcement: Verification of Stabilizing Programs with SMT Solvers

  • Jingshu Chen
  • Sandeep Kulkarni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7596)


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.


Verification Stabilization Model checking 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Communications of the ACM 17(11) (1974)Google Scholar
  2. 2.
    Orna, G., Clarke, M.E., Peled, D.A.: Model Checking. The MIT press (2000)Google Scholar
  3. 3.
    Chen, J., Abujarad, F., Kulkarni, S.: Effect of Fairness in Model Checking of Self-stabilizing Programs. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 135–138. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Tsuchiya, T., Nagano, S., Paidi, R.B., Kikuno, T.: Symbolic model checking for self-stabilizing algorithms. IEEE Trans. Parallel Distrib. Syst 12, 81–95 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jingshu Chen
    • 1
  • Sandeep Kulkarni
    • 1
  1. 1.Michigan State UniversityEast LansingUS

Personalised recommendations