FORMAL METHODS FOR CONCURRENT AND REACTIVE SYSTEMS

Temporal Verification of Reactive Systems: Safety

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS256/Winter 2007 — Lecture #1 Zohar Manna FORMAL METHODS FOR CONCURRENT AND REACTIVE SYSTEMS Instructor: Zohar Manna Email: zm@cs Office hours: by appointment TA: Matteo Slanina Email: matteo@cs Office hours: TTh 1:30–2:30 Web page: http://cs256.stanford.edu Course Meetings: TTh 11:00–12:15, Gates B12 1-1 Course work • Weekly homeworks • Final exam • Participation in class No collaboration on homeworks & exam (but welcome otherwise). HW policy : two free late days (see info sheet) Reading : Read Chapter 0 of book. 1-2 (CS256) Practical- Pentium Bug- Ariane Bug- expected government regulation for formal methods in signalling systems medical equipment power plants highway control Concurrent Programs (Hardware/Software) Mathematical Logic (CS157) Mur , SMV, VIS,- STeP- others: model checking: KRONOS, ... deductive: ACL2, PVS, EVES, HOL, ... SPIN, UPPAAL, Tools- Model checking- Deductive verification- Combining model checking and deduction- Specification methods Theory Automata Temporal Logic Specifications Verification 1-3 Textbooks Manna & Pnueli Springer Vol. I: “The Temporal Logic of Reactive and Con- current Systems: Specification ” Springer 1992 Vol II: “Temporal Verification of Reactive Systems: Safety ” Springer 1995 Vol. III: “Temporal Verification of Reactive Systems: Progress ” Chapters 1–3, on Manna’s web site. Copies of lecture slides. Papers. 1-4 Textbook Overview (Volume II) Chapter 0: Preliminary Concepts [Summary of volume I] Chapter 1: Invariance: Proof Methods Chapter 2: Invariance: Applications Chapter 3: Precedence [Chapter 4: General Safety ] Chapter 5: Algorithmic Verification (“Model Checking”) Extra: • ω-automata • branching time logic CTL 1-5 Transformational Systems Observable only at the beginning and the end of their execution (“black box”) input-→ system output-→ with no interaction with the environment....
View Full Document

Page1 / 7

FORMAL METHODS FOR CONCURRENT AND REACTIVE SYSTEMS -...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online