Sciweavers

OPODIS
2008

Revising Distributed UNITY Programs Is NP-Complete

14 years 12 days ago
Revising Distributed UNITY Programs Is NP-Complete
We focus on automated revision techniques for adding Unity properties to distributed programs. We show that unlike centralized programs, where multiple safety properties along with one progress property can be simultaneously added in polynomial-time, addition of only one safety or one progress property to distributed programs is NP-complete. We also propose an efficient symbolic heuristic for adding a leads-to property to a distributed program. We demonstrate the application of this heuristic in automated synthesis of recovery paths in fault-tolerant distributed programs.
Borzoo Bonakdarpour, Sandeep S. Kulkarni
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where OPODIS
Authors Borzoo Bonakdarpour, Sandeep S. Kulkarni
Comments (0)