2014
The complexity of automated addition of fault-tolerance without explicit legitimate states
Abujarad F, Lin Y, Bonakdarpour B, Kulkarni S. The complexity of automated addition of fault-tolerance without explicit legitimate states. Distributed Computing 2014, 28: 201-219. DOI: 10.1007/s00446-014-0227-2.Peer-Reviewed Original Research
2011
Symbolic synthesis of masking fault-tolerant distributed programs
Bonakdarpour B, Kulkarni S, Abujarad F. Symbolic synthesis of masking fault-tolerant distributed programs. Distributed Computing 2011, 25: 83-108. DOI: 10.1007/s00446-011-0139-3.Peer-Reviewed Original ResearchHigh worst-case complexityFault-intolerant versionState explosion problemProgram state spaceWorst-case complexityPresence of faultsProgram synthesisTime complexitySymbolic synthesisExplosion problemState spaceLiveness specificationsSynthesis heuristicsTypes of faultsReasonable amountDecision procedureSynthesis problemComplexityHeuristicsAlgorithmChallenging barriersBottleneckFaultsVerificationSpecification