activity
20122023
most citedVerification for Machine Learning, Autonomy, and Neural Networks Survey

91 citations · 426 across the 30 of their papers we have counts for

collaborators

32 papers

cs.CR2023★ 7 cited

SUDS: Sanitizing Universal and Dependent Steganography

Preston K. Robinette, Hanchen D. Wang, Nishan Shehadeh +2

Steganography, or hiding messages in plain sight, is a form of information hiding that is most commonly used for covert communication. As modern steganographic mediums include imag…

cs.AI2023

EduSAT: A Pedagogical Tool for Theory and Applications of Boolean Satisfiability

Yiqi Zhao, Ziyan An, Meiyi Ma +1

Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) are widely used in automated verification, but there is a lack of interactive tools designed for educational p…

cs.LG2023

Robustness Verification of Deep Neural Networks using Star-Based Reachability Analysis with Variable-Length Time Series Input

Neelanjana Pal, Diego Manzanas Lopez, Taylor T Johnson

Data-driven, neural network (NN) based anomaly detection and predictive maintenance are emerging research areas. NN-based analytics of time-series data offer valuable insights into…

cs.LG2023★ 65 cited

First Three Years of the International Verification of Neural Networks Competition (VNN-COMP)

Christopher Brix, Mark Niklas Müller, Stanley Bak +2

This paper presents a summary and meta-analysis of the first three iterations of the annual International Verification of Neural Networks Competition (VNN-COMP) held in 2020, 2021,…

cs.RO2022★ 1 cited

BehaVerify: Verifying Temporal Logic Specifications for Behavior Trees

Serena S. Serbinowska, Taylor T. Johnson

Behavior Trees, which originated in video games as a method for controlling NPCs but have since gained traction within the robotics community, are a framework for describing the ex…

cs.LO2022

Model Checking for Rectangular Hybrid Systems: A Quantified Encoding Approach

Luan V. Nguyen, Wesam Haddad, Taylor T. Johnson

Satisfiability Modulo Theories (SMT) solvers have been successfully applied to solve many problems in formal verification such as bounded model checking (BMC) for many classes of s…