Sciweavers

Share
HASE
1997
IEEE

Automated Computation of Decomposable Synchronization Conditions

10 years 4 months ago
Automated Computation of Decomposable Synchronization Conditions
: The most important aspect of concurrent and distributed computation is the interaction between system components. Integration of components into a system requires some synchronization that prevents the components from interacting in ways that may endanger the system users, its correctness or performance. The undesirable interactions are usually described using temporal logic, or safety and liveness assertions. Automated synthesis of synchronization conditions is a portable alternative to the manual design of system synchronization, and it is already widespread in the hardware CAD domain. The automated synchronization for concurrent software systems is hindered by their excessive complexity, because their state spaces can rarely be exhaustively analyzed to compute the synchronization conditions. The analysis of global state spaces is required for liveness and real{time properties, but simple safety rules depend only on the referenced components and not on the rest of the system or its...
Gilberto Matos, James M. Purtilo, Elizabeth L. Whi
Added 06 Aug 2010
Updated 06 Aug 2010
Type Conference
Year 1997
Where HASE
Authors Gilberto Matos, James M. Purtilo, Elizabeth L. White
Comments (0)
books