CS 525V : Introduction to Computer-Aided Verification

Readings

Schedule of Class Readings

DateTopicPapersPresenter
1/18Intro to Verification; SMV  
1/25CTL Model Checking; SMV
  1. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications (by Clarke, Emerson, and Sistla)
  2. Verification of the FutureBus+ Cache Coherence Protocol (by Clarke, Grumberg, Hiraishi, Jha, Long, McMillan, and Ness)
  1. Brian Roberts
  2. none - for outside reading
2/1LTL Model Checking Model Checking Using Automata Theory (by Peled), sections 1-4,6. Peter Gilbert
2/8CTL versus LTL Model Checking Branching versus Linear Time: Final Showdown (by Vardi) Kathi
2/15BDDs and Symbolic Model Checking
  1. An Introduction to Binary Decision Diagrams (by Andersen), sections 1 - 4.3, 4.7
  2. Automatic Verification of Sequential Circuit Designs (by Clarke, Burch, Grumberg, Long, and McMillan), sections 1-5
  1. Daniel Vanier
  2. Chris Barratt
2/22Abstraction and Minimization
  1. Online Minimization of Transition Systems (by Lee and Yannakakis), sections 1-3
  2. Some big picture notes on abstraction and symmetry (I wrote these up for reference a couple of years ago. They are a bit out of date, but the portion up through section 3.2 explains what I'll present in class.)
 
3/1Compositional Reasoning and Symmetry  
3/8Introduction to ACL2  
3/15Theorem Proving and ACL2  
3/22Abstraction in Theorem Proving  
3/29Symbolic SimulationSymbolic Simulation: An ACL2 Approach (by Moore) 
4/5No class  
4/12Case Study: The Pentium Bug  
4/19Verification in Practice
Project Presentations		  
4/26Project Presentations  

Related Readings

This page maintained by Kathi Fisler
Department of Computer Science Worcester Polytechnic Institute