mlsanityData to 7 Oct 2026

Addressing the IEEE AV Test Challenge with Scenic and VerifAI

arXiv 2108.13796 ↗First posted 20 Aug 2021cs.SE cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

This paper summarizes our formal approach to testing autonomous vehicles (AVs) in simulation for the IEEE AV Test Challenge. We demonstrate a systematic testing framework leveraging our previous work on formally-driven simulation for intelligent cyber-physical systems. First, to model and generate interactive scenarios involving multiple agents, we used Scenic, a probabilistic programming language for specifying scenarios. A Scenic program defines an abstract scenario as a distribution over configurations of physical objects and their behaviors over time. Sampling from an abstract scenario yields many different concrete scenarios which can be run as test cases for the AV. Starting from a Scenic program encoding an abstract driving scenario, we can use the VerifAI toolkit to search within the scenario for failure cases with respect to multiple AV evaluation metrics. We demonstrate the effectiveness of our testing framework by identifying concrete failure scenarios for an open-source autopilot, Apollo, starting from a variety of realistic traffic scenarios.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 5 of its 16 references that are in the map. First posted on arXiv 20 Aug 2021.

Builds on

5 of 16 references.

References · 5

  1. 2018Scenic: A Language for Scenario Specification and Scene Generationcited by 79
  2. 2020Scenic: A Language for Scenario Specification and Data Generationcited by 39
  3. 2015Upper-Confidence-Bound Algorithms for Active Learning in Multi-Armed Banditscited by 29
  4. 2020Formal Analysis and Redesign of a Neural Network-Based Aircraft Taxiing System with VerifAIcited by 21
  5. 2021Parallel and Multi-Objective Falsification with Scenic and VerifAIcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 2.

5 papers.