AUB ScholarWorks
Tractable verification of large asynchronous concurrent programs - by Rasha Mohammad Abdallah.
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Abdallah, Rasha Mohammad. |
| dc.date.accessioned | 2012-06-13T07:35:52Z |
| dc.date.available | 2012-06-13T07:35:52Z |
| dc.date.issued | 2011 |
| dc.identifier.uri | http://hdl.handle.net/10938/8799 |
| dc.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 |
| dc.description | Includes bibliographical references (leaves 106-110) |
| dc.description.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 |
| dc.format.extent | xi, 110 leaves : ill. 30 cm. |
| dc.language.iso | eng |
| dc.relation.ispartof | Theses, Dissertations, and Projects |
| dc.subject.classification | T:005527 AUBNO |
| dc.subject.lcsh | Operating systems (Computers). |
| dc.subject.lcsh | Distributed operating systems (Computers). |
| dc.title | Tractable verification of large asynchronous concurrent programs - by Rasha Mohammad Abdallah. |
| dc.type | Thesis |
| dc.contributor.department | American University of Beirut. Faculty of Arts and Sciences. Department of Computer Science. |
