Summary: Synthesis of Large Concurrent Programs via
Pairwise Composition
Paul C. Attie ?
School of Computer Science, Florida International University, Miami, FL, USA
http://www.cs.fiu.edu/scspage/professor/Attie.html
Abstract. We present a tractable method for synthesizing arbitrar­
ily large concurrent programs from specifications expressed in temporal
logic. Our method does not explicitly construct the global state tran­
sition diagram of the program to be synthesized, and thereby avoids
state explosion. Instead, it constructs a state transition diagram for each
pair of component processes (of the program) that interact. This ``pair­
program'' embodies all possible interactions of the two processes. Our
method proceeds in two steps. First, we construct a pair­program for
every pair of ``connected'' processes, and analyze these pair­programs for
desired correctness properties. We then take the ``pair processes'' of the
pair­programs, and ``compose'' them in a certain way to synthesize the
large concurrent program. We establish a ``large model'' theorem which
shows that the synthesized large program inherits correctness properties
from the pair­programs.
1 Introduction

Source: Attie, Paul - Department of Computer Science, American University of Beirut

Collections: Computer Technologies and Information Sciences