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
CollegeLectures 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
The weekly individual programming assignments are absolutely killer. Half the time the TAs had no idea how to help you so you were on your own. They were extremely time consuming so I suggest you start immediately. Tests were fairly easy but he promised to curve the class at the end and he did not, so don't expect any curve.
Decent teacher but much room for improvement. Lectures can feel confusing and drawn out. Half the homework was graded by a buggy and unreliable website.
Bultan is a very wise and experienced computer programmer who is unfit at teaching a lower division computer science class. His expertise better suits upper division CS classes with students who are pursuing the major. He is a friendly, approachable guy, but he just wasn't the best at teaching CS 16. Expect three killer group programs.