CMPT 263

Apply mathematical logic to applications in computer science, leading to program interpretation and understanding; including pre-/post-conditions, invariants, Hoare logic, relational algebra, and verification. Develop skills and knowledge for designing, debugging, documenting, verifying and testing code, and understand programs including open-source code. Topics are introduced using standard examples including stacks and queues; extended examples are drawn from string-matching algorithms and finite state automata. An introduction to reasoning about concurrency, pitfalls, and language/library-level solutions.