Multicore Constraint-Based Automated Stabilization

Given the non-determinism and race conditions in distributed programs, the ability to provide assurance about them is crucial Our work focuses on incremental synthesis where we modify a distributed programs to add self-stabilization We concentrate On reducing the time complexity of such synthesis using parallelism We apply these techniques in context, of constraint, satisfaction In particular incremental synthesis of self-stabilizing programs requires adding recovery actions to satisfy the constraint, that arc time in the legitimate states We consider two approaches to speedup the synthesis algorithm first, the use of the multiple constraints that, have to be satisfied during synthesis: second, the use of the distributed nature of the programs being synthesized We show that, our approaches provide significant reductions in the synthesis time