COM SCI 233B

Verification of Concurrent Programs

Computer Science · 4 units · Graduate courses (200-299)

Open the requisite map View official UCLA course listing ↗Find on Bruinwalk ↗

Formal techniques for verification of concurrent programs. Topics include safety, liveness, program and state assertion-based techniques, weakest precondition semantics, Hoare logic, temporal logic, UNITY, and axiomatic semantics for selected parallel languages.

Letter grading.

Requisites

Official UCLA wording
Requisite: course 233A.

BruinTree reads · Prerequisite

confidence 1.00 · from text

COM SCI 233A

Requires

Everything that has to come before this course, not just the courses named in the requisite above.

COM SCI 233B

COM SCI 233AParallel Programming
- COM SCI 111Operating Systems Principles
  - COM SCI 32Introduction to Computer Science II1 more beneath
  - COM SCI 33Introduction to Computer Organizationanother path to it
  - COM SCI 35LSoftware Constructionanother path to it
- COM SCI 131Programming Languages

1 direct requisite. Showing 8 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.

Unlocks

What this course is a requisite for, and what those courses lead to in turn.

No course in the catalog lists this as a requisite.