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
2008
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Bonakdarpour B, Abujarad F, Kulkarni S. Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs. 2008 DOI: 10.21236/ada487982.Peer-Reviewed Original ResearchSymbolic synthesisDeadlock statesPresence of faultsEfficient parallelParallel algorithmDistributed programDeadlock resolutionMultiple threadsEfficient heuristicSymbolic techniquesComplexity barrierSymbolic algorithmSet of statesSynthesis algorithmTransition relationAlgorithmPerformance improvementExperimental resultsOutgoing transitionsPrevious workAforementioned obstaclesParallelizationHeuristicsThreads