Important copyright notice

The following material is presented to ensure timely dissemination of information among the students in the classes I teach. Further distribution of this material is prohibited, and constitutes a copyright violation.

Syllabus

You can retrieve the syllabus for CS 260 (Fall 2005).

Background

Here is a copy of the foils I use at the beginning of the course.

The following papers are an excellent starting point to improve your background knowledge for this course.

• T. Murata, "Petri nets: properties, analysis and applications", IEEE Proceedings, Vol. 77, No. 4, pp. 541-579, April 1989.
  [A complete survey of Petri nets theory.]


• E. M. Clarke, E. A. Emerson, A. P. Sistla, "Automatic verification of finite-state concurrent systems using temporal logic specifications", ACM TOPLAS, Vol. 8, No. 2, pp. 244-263, 1986.
  [An introduction to temporal logic model checking, with a special emphasis on CTL.]


• R. E. Bryant, "Graph-based algorithms for boolean function manipulation", IEEE TC, Vol. 35, No 8, pp. 677-691, August 1986.
  [The reference for binary decision diagrams.]


• G. Ciardo, A. Blakemore, P. F. Chimento, J. K. Muppala, K. S. Trivedi, "Automated generation and analysis of Markov reward models using Stochastic Reward Nets", Linear Algebra, Markov Chains, and Queueing Models, pp. 145-191, 1993. Springer-Verlag.
  [A brief introduction to Markovian stochastic Petri nets followed by a detailed survey of numerical methods for their analysis.]

Readings (first round)

TOPIC: Variable ordering for efficient decision diagram manipulation

• P. Chauhan, E. Clarke, S. Jha, J. Kukula, H. Veith, D. Wang. "Using combinatorial optimization methods for quantification scheduling". Proc. CHARME 2001, pp. 293-309.
  PRESENTED BY: John Anderson (10 nov 2005)

TOPIC: Approximate solution of large Markov models

• A. Miner, G. Ciardo, and S. Donatelli. "Using the exact state space of a Markov model to compute approximate stationary measures". Proc. SIGMETRICS 2000, pp. 207-216.
  PRESENTED BY: Min Wan (1 nov 2005)

TOPIC: SAT-solver-based logic verification.

• M. Prasad, A. Biere, A. Gupta. "A survey of recent advances in SAT-based formal verification". International Journal on Software Tools for Technology Transfer, Vol. 7, No. 2, pp. 156 - 173, 2005.
  PRESENTED BY: Andy Yu (25 oct 2005)


• A. Biere, A. Cimatti, E. M. Clarke, Y. Zhu. "Symbolic model checking without BDDs". Proc. TACAS 1999, pp. 193-207.
  PRESENTED BY: Nicholas Barton (1 nov 2005)

TOPIC: Model checking Markov models

• C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen. "Model checking algorithms for continuous-time Markov chains". IEEE TSE, Vol. 29, No. 6, pp. 524-541, 2003.
  PRESENTED BY: Ron Feliciano (3 nov 2005)

TOPIC: Model checking real-time systems

• R. Alur. "Timed automata". Proc. CAV 1999, pp. 8-22. Springer-Verlag.
  PRESENTED BY: Mark Porterfield (8 nov 2005)


• T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. "Symbolic model checking for real-time systems". Information and Computation, Vol. 111, pp. 193-244, 1994.
  PRESENTED BY: Teddy Matinde (8 nov 2005)

TOPIC: Techniques to store Markov chains

• R. Bahar et al."Algebraic decision diagrams and their applications", Formal Methods in System Design, Vol. 10, pp. 171-206, 1997.
  PRESENTED BY: Ming-Yin Chung (20 oct 2005)


• A. Miner. "Efficient solution of GSPNs using canonical matrix diagrams". Proc. PNPM 2001, pp. 101-110.
  PRESENTED BY: Adam Meadows (3 nov 2005)


• P. Buchholz, G. Ciardo, P. Kemper, and S. Donatelli. "Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models". INFORMS Journal on Computing, Vol. 13, No. 3, pp. 203-222, 2000.

Readings (second round)

TOPIC: Predicate abstraction

• E. Clarke, D. Kroening, N. Sharygina, K. Yorav. "Predicate abstraction of ANSI-C programs using SAT". Formal Methods in System Design, Vol. 25, pp. 105-127, 2004.
  PRESENTED BY: Andy Yu (17 nov 2005)

TOPIC: Parallel implementation of model checking

• S. Iyer, J. Jain, D. Sahoo, E. Emerson. "Under-approximation heuristics for grid-based bounded model checking". Proc. PDMC, 2005.
  PRESENTED BY: Ming-Yin Chung (17 nov 2005)

TOPIC: Stochastic models with immediate events

• A. Miner. "Implicit GSPN reachability set generation using decision diagrams". Performance Evaluation, Vol. 56, No 1-4, pp. 145-165, 2004.
  PRESENTED BY: Min Wan (22 nov 2005)

TOPIC: Binary moment diagrams

• R. Bryant, Y.-A. Chen. "Verification of arithmetic circuits with binary moment diagrams ". Proc. DAC, pp. 535-541, 1995.
  and
  E. Clarke and M. Fujita and X. Zhao. "Hybrid decision diagrams: overcoming the limitations of MTBDDs and BMDs". CMU Tech. Report 865057.
  PRESENTED BY: Nicholas Barton (22 nov 2005)

TOPIC: Clock difference diagrams

• K. Larsen, J. Pearson, C. Weise, W. Yi. "Clock difference diagrams". Nordic Journal of Computing, pp. 271-298, 1999.
  and
  G. Behrmann, K. Guldstrand, J. Pearson, C. Weise, W. Yi. "Efficient timed reachability analysis using clock difference diagrams". Proc. CAV, pp. 341-353, 1999.
  PRESENTED BY: Adam Meadows and Ron Feliciano (29 nov 2005)

TOPIC: Knowledge representation and model checking

• H. van Ditmarsch, W. van der Hoek, B. Kooi. "Playing cards with Hintikka: an introduction to dynamic epistemic logic". Australasian Journal of Logic, Vol. 3, pp. 108-134, 2005.
  and
  H. van Ditmarsch, W. van der Hoek, R. van der Meyden, J. Ruan. "Model checking Russian cards". Proc. MoChArt, Electronic Notes in Theoretical Computer Science 2005.
  PRESENTED BY: Teddy Matinde (1 dec 2005)

TOPIC: Difference bound matrices

• A. Mine'. "A new numerical abstract domain based on difference-bound matrices". Proc. PADO, pp. 155-172, 2001.
  and
  A. Venet, G. Brat. "Precise and efficient static array bound checking for large embedded C programs". Proc. SIGPLAN, pp. 231-242, 2004.
  PRESENTED BY: Mark Porterfield (6 dec 2005)

TOPIC: Variable reordering

• R. Rudell. "Dynamic variable ordering for ordered binary decision diagrams". Proc. ICCAD, pp. 42-47, 1993.
  and
  H. Higuchi, F. Somenzi. "Lazy group sifting for efficient symbolic state traversal of FSMs". Proc. ICCAD, pp. 45-49, 1999.
  PRESENTED BY: John Anderson (8 dec 2005)