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

Simple item page
dc.contributor.authorAbdallah, Rasha Mohammad.
dc.contributor.departmentDepartment of Computer Science
dc.contributor.facultyFaculty of Arts and Sciences
dc.contributor.institutionAmerican University of Beirut
dc.date2011
dc.date.accessioned2012-06-13T07:35:52Z
dc.date.available2012-06-13T07:35:52Z
dc.date.issued2011
dc.descriptionThesis (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
dc.descriptionIncludes bibliographical references (leaves 106-110)
dc.description.abstractA concurrent program P = P1
dc.description.abstract…
dc.description.abstractPk 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
dc.format.extentxi, 110 leaves : ill. 30 cm.
dc.identifier.urihttp://hdl.handle.net/10938/8799
dc.language.isoen
dc.relation.ispartofTheses, Dissertations, and Projects
dc.subject.classificationT:005527 AUBNO
dc.subject.lcshOperating systems (Computers).
dc.subject.lcshDistributed operating systems (Computers).
dc.titleTractable verification of large asynchronous concurrent programs - by Rasha Mohammad Abdallah.
dc.typeThesis

Files

Collections

AUB Students' Theses, Dissertations, and Projects