UC Berkeley Academic Calendar: Spring Semester 2005 |
||
SPRING SEMESTER BEGINS |
January 11, 2005 |
Tuesday |
Fee Payment Due |
January 14, 2005 |
Friday |
Martin Luther King Holiday |
January 17, 2005 |
Monday |
Instruction Begins |
January 18, 2005 |
Tuesday |
Presidents' Day |
February 21, 2005 |
Monday |
Spring Recess |
March 21, 2005 - March 25, 2005 |
Monday-Friday |
Cesar Chavez Holiday |
March 25, 2005 |
Friday |
Cal Day |
April 16, 2005 |
Saturday |
Instruction Ends |
May 10, 2005 |
Tuesday |
Final Examinations |
May 13, 2005 - May 20, 2005 |
Friday-Friday |
SPRING SEMESTER ENDS |
May 20, 2005 |
Friday |
Memorial Day |
May 30, 2005 |
Monday |
Jan 18: Introduction, latches, clock schedules (Bob) PPT
Jan 20: Basics of reachability analysis. Project overview. (Alan) PPT
Jan 25: Cyclic circuits – Part 1 (Roland) PPT
Jan 27: Cyclic circuits – Part 2 (Roland) PPT
Feb 1: Asynchronous synthesis – Part 1 (Alex Kondratyev, CBL) PPT
Feb 3: Asynchronous synthesis – Part 2 (Alex Kondratyev, CBL) PPT
Feb 8: Asynchronous synthesis – part 3 (Alex Kondratyev, CBL) PPT
Feb 10: Clocking networks (Rajeev Murgai, Fujitsu) PPT
Feb 15: State-based FSM manipulations – Advanced reachability (Alan) PPT
Feb 17: State-based FSM manipulations – Sequential flexibility (Bob) PPT
Feb 22: State-based FSM manipulations – State minimization (Alan) PPT
Feb 24: Structure-based FSM manipulations – Clock skewing (Alan) PPT
Mar 1: Structure-based FSM manipulations – Retiming (Alan) PPT
Mar 3: Preliminary project presentations (290A students)
Mar 8: Structure-based FSM manipulations – Initialization sequences, peripheral retiming (Roland) PPT
Mar 10: Structure-based FSM manipulations – Inherent power of retiming and resynthesis (Roland) PPT
Mar 15: Structure-based FSM manipulations – Sequential testing and redundancy removal – part 1 (Bob) PPT
Mar 17: Structure-based FSM manipulations – Sequential testing and redundancy removal – part 2 (Bob) PPT
Mar 29: Structure-based FSM manipulations – Retiming and technology mapping (Alan) PPT
Mar 31: Structure-based FSM manipulations – Temporal logic, language containment (Bob) PPT
Apr 5: Formal verification – Bounded model checking – Part 1 (Alan) PPT
Apr 7: Formal verification – Bounded model checking – Part 2 (Alan) PPT
Apr 12: Formal verification – Unbounded model checking – Part1 (Ken McMillan, CBL) PPT
Apr 14: Formal verification – Unbounded model checking – Part2 (Ken McMillan, CBL) (see Part 1)
Apr 19: Formal verification – Sequential equivalence checking – Part1 (Roland) PPT
Apr 21: Formal verification – Sequential equivalence checking – Part2 (Roland) PPT
Apr 26: Formal verification – Sequential equivalence checking – Part3 (Roland) (see Part 2)
Apr 28: Continuous retiming (Alan) PPT
May 3: Sequential verification in an industrial setting (Vigyan Singhal, Harry Foster, Jasper Design Automation) PPT PPT
May 5: Developing a commercially viable sequential equivalence checker (Anmol Mathur, Calypto Design Systems) PPT
May 10: Final project presentations – Part1 (290A students)
May 12: Final project presentations – Part2 (290A students)
Mike Case, Inductively Finding a Reachable State Space Over-Approximation. PDF PPT
Shauki Elassaad, Choice Node Generation and Retiming for Sequential Optimization. PDF PPT
Juliet Holwill, Retiming of the AND/INVERTER Graphs with Latches. PDF PPT
Aaron Hurst, Latch/Register Scheduling for Process Variation. PDF PPT
Kelvin Lwin, Power Reduction using Approximation Function. PDF PPT
Trevor Meyerowitz, Transaction-Level Modeling Definitions and Approximations. PDF PPT