Covers automated verification algorithms and tools. Topics include: temporal logics, fixpoint characterizations of temporal properties, model checking, symbolic verification, explicit-state verification, verification using automated theorem provers, automated abstraction.
4
UnitsLetter
Grading1, 2, 3
PasstimeNone
Level LimitEngineering
Collegedeserves much higher ratings. He makes difficult stuff so graspable and easy to understand. Kruegel guest taught 1 lecture & made the stuff sound like a foreign language. The lecture slides are crazy detailed, great to study from, and he's funny. Ask questions in lecture and DON'T PROCRASTINATE ON PROJECTS. 160 is hard, be focused. prof b da 🐐
I loved CS160 and Bultan was a caring, passionate, and knowledgeable instructor. However, you need to bring your A game to the lectures. Really pay attention and ask more questions than you're used to asking. He goes fast and sometimes gets lost or confused. If you don't develop deep understanding, the homework will punish you for it.
He must've changed a lot bc the other reviews arent accurate. You can tell he puts a lot of effort into teaching the course. EXTREMELY detailed lecture slides, thorough ELI5 & generous w late hw. Kruegel is bad at explaining and Ben H had impossible projects, so def take 160 with Bultan if you can. 160 is hard in general but he's great at teaching.
Lectures are boring & not related to homework. Class content is all over the place and not very useful to be honest. Thankfully, course is not required anymore.
The material is quite difficult and he expects us to apply it fully in tests, despite not covering applying it during lecture. Lectures are too theoretical compared to the tests. Homework assignments are a bit messy, but not too bad.
Really great CS professor! Very good at explaining complicated concepts