Revising Distributed UNITY Programs Is NP-Complete

Abstract

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.

DOI: 10.1007/978-3-540-92221-6_26

Extracted Key Phrases

8 Figures and Tables