Tractable verification of large asynchronous concurrent programs - by Rasha Mohammad Abdallah.

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

A concurrent program P = P1

Pk consists of k processes executing in parallel. These processes interact through shared memory or message passing. Concurrency introduces many complications, especially non-deterministic behavior. Factors such as the n

Description

Thesis (M.S.)--American University of Beirut, Department of Computer Science, 2011.;"Advisor : Dr. Paul Attieh, Associate Professor, Computer Science--Members of Committee: Dr. George Turkiyyah, Professor, Computer Science Dr. Walid Keyrouz, Assistant Pr
Includes bibliographical references (leaves 106-110)

Keywords

Citation

Endorsement

Review

Supplemented By

Referenced By