Revising Distributed UNITY Programs Is NP-Complete

Authors:
Borzoo Bonakdarpour;Sandeep S. Kulkarni
Affiliations:
Department of Computer Science and Engineering, Michigan State University, East Lansing, U.S.A. MI 48824;Department of Computer Science and Engineering, Michigan State University, East Lansing, U.S.A. MI 48824
Venue:
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Year:
2008

Citing 14
Cited 3

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Parallel program design: a foundation

Parallel program design: a foundation
On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Component Based Design of Multitolerant Systems

IEEE Transactions on Software Engineering
Synthesis of fault-tolerant concurrent programs

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of Communicating Processes from Temporal Logic Specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of concurrent programs for an atomic read/write model of computation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automating the Addition of Fault-Tolerance

FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
The Complexity of Adding Failsafe Fault-Tolerance

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space

ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
SYCRAFT: A Tool for Synthesizing Distributed Fault-Tolerant Programs

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Program repair as a game

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Revising UNITY programs: possibilities and limitations

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Automated model repair for distributed programs

ACM SIGACT News
A Lightweight Method for Automated Design of Convergence in Network Protocols

ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special Section: Extended Version of SASO 2011 Best Paper
Action-based discovery of satisfying subsets: A distributed method for model correction

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

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.