Computer Basics
Class1
Chapter 10
Trees
MC0082-MQP
Flat
Finite automata intro
Model Checking Lecture 4. Outline 1 Specifications: logic vs. automata, linear vs. branching, safety vs. liveness 2 Graph algorithms for model checking.
1 Mathematical Preliminaries. 2 Sets Functions Relations Graphs Proof Techniques.
Quicksort Introduction to Algorithms Quicksort CSE 680 Prof. Roger Crawfis.
lecture 9