Stanford Root

Schedule

Stanford Root

Schedule

CS 238V

Validation of Safety Critical Systems (AA 228V)

UNITS:3-4
GRADING:Letter or Credit/No Credit
LEVEL:Graduate
GER:—

Before deploying autonomous decision-making systems in high-stakes applications, it is important to ensure that they will operate as intended. This course presents a variety of mathematical concepts and algorithms that can be used to validate their performance in simulation. The course first introduces a framework for setting up validation problems using topics from model fitting, model validation, and property specification. The course then covers sampling-based validation techniques for tasks such as falsification and probability of failure estimation. The course concludes with an overview of formal methods for tasks such as reachability analysis. Topics include but are not limited to: mathematical modeling, temporal logic specifications, optimization-based falsification, Markov chain Monte Carlo, importance sampling, reachability analysis, model checking, satisfiability, and explainability. Applications are drawn from air traffic control, autonomous systems, and self-driving cars. Prerequisites: basic probability theory, multivariable calculus, and fluency in a high-level programming language

Syllabus for selected term:
View Winter 2027 Syllabus

Sections

1 Term
Lecture 1Open
ID: 6208
0 / 78 enrolled
DAYS:Tuesday, Thursday
TIME:4:30 PM – 5:50 PM
LOCATION:TBD
INSTRUCTOR:
Katz, Sydney, Lasic-Ellis, Ian, Valentin, Romeo
units

CS 238V: Validation of Safety Critical Systems (AA 228V)

3-4 units · Letter or Credit/No Credit

Before deploying autonomous decision-making systems in high-stakes applications, it is important to ensure that they will operate as intended. This course presents a variety of mathematical concepts and algorithms that can be used to validate their performance in simulation. The course first introduces a framework for setting up validation problems using topics from model fitting, model validation, and property specification. The course then covers sampling-based validation techniques for tasks such as falsification and probability of failure estimation. The course concludes with an overview of formal methods for tasks such as reachability analysis. Topics include but are not limited to: mathematical modeling, temporal logic specifications, optimization-based falsification, Markov chain Monte Carlo, importance sampling, reachability analysis, model checking, satisfiability, and explainability. Applications are drawn from air traffic control, autonomous systems, and self-driving cars. Prerequisites: basic probability theory, multivariable calculus, and fluency in a high-level programming language

Offered in Winter 2027 at Stanford University.

Winter 2027 sections

  • Lecture — Tuesday Thursday 4:30 PM – 5:50 PM — Katz, Sydney, Lasic-Ellis, Ian, Valentin, Romeo (Graduate)

More CS courses

  • CS 234: Reinforcement Learning
  • CS 235: Computational Methods for Biomedical Image Analysis and Interpretation (BMDS 260, BMP 260, RAD 260)
  • CS 236G: Generative Adversarial Networks
  • CS 237A: Principles of Robot Autonomy I (AA 274A, EE 260A, ME 274A)
  • CS 237B: Principles of Robot Autonomy II (AA 174B, AA 274B, EE 260B, ME 274B)
  • CS 238: Decision Making under Uncertainty (AA 228)
  • CS 239: Advanced Topics in Sequential Decision Making (AA 229)
  • CS 240: Advanced Topics in Operating Systems
  • CS 240LX: Advanced Systems Laboratory, Accelerated
  • CS 241: Embedded Systems Workshop (EE 285)
  • CS 242: Programming Languages
  • CS 243: Program Analysis and Optimizations

All CS courses · All departments