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
2007
Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model
Bonakdarpour B, Kulkarni S, Abujarad F. Distributed Synthesis of Fault-Tolerant Programs in the High Atomicity Model. Lecture Notes In Computer Science 2007, 4838: 21-36. DOI: 10.1007/978-3-540-76627-8_5.Peer-Reviewed Original Research
2006
Brief Announcement: Distributed Synthesis of Fault-Tolerance
Bonakdarpour B, Kulkarni S, Abujarad F. Brief Announcement: Distributed Synthesis of Fault-Tolerance. Lecture Notes In Computer Science 2006, 4280: 566-567. DOI: 10.1007/978-3-540-49823-0_40.Peer-Reviewed Original Research