Automated Revision of Distributed and Real-Time Programs

March 7, 2008
Borzoo Bonakdarpour | Michigan State University

The theory of automated program revision studies possibilities and limitations of revising existing programs. We require that such revision must be achieved within the given program’s current state space so that the revised program satisfies newly identified requirements while it continues to satisfy its current properties. The main focus of this theory is to identify instances where automated revision of programs can be achieved efficiently (possibly in polynomial-time) and where it is difficult (i.e., hard in some class of complexity). Thus far, the theory has been established in two contexts: (1) adding properties to existing programs in closed systems where programs do not interact with the environment, and (2) adding properties to programs in open systems where programs are subject to a set of faults imposed by the environment. In this talk, I will present our results on automated synthesis of fault-tolerant distributed programs. Our synthesis algorithms have been implemented in the tool SYCRAFT which is capable of synthesizing fault-tolerant distributed programs with state space of size 10³⁰ and beyond.

Speaker Details

Borzoo Bonakdarpour is currently a Ph.D. candidate of computer science at Michigan State University. He joined the Department of Computer Science and Engineering at Michigan State University in 2002 as an MS and subsequently in 2004 as a Ph.D. student. He completed his Bachelor of Science in computer engineering at the Department of Computer Engineering in the University of Esfahan, Iran, in 1998. His BS project on queuing theoretic analysis and implementation of voice over Ethernet won the President of Iran Khawrazmi Research Prize. Borzoo Bonakdarpour’s Ph.D. research has focused on the theory of local redesign which studies synthesis techniques for revising existing programs with respect to a desired property that the program does not satisfy.