COM SCI 233B · CS 233BVerification of Concurrent Programs
Computer Science · 4 units · Graduate courses (200-299)
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.
When it runs
Not on the schedule for any of Fall 2025 through Spring 2027. UCLA publishes only that window, so this does not mean the course is gone — check the official listing.
Requisites
Official UCLA wording
Requisite: course 233A.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
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 131Programming Languages
- COM SCI 33Introduction to Computer Organization
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.