Kuhn, D.
, Raunak, M.
, Kacker, R.
, Chandrasekaran, J.
, Lanus, E.
, cody, T.
and Freeman, L.
(2024),
Assured Autonomy through Combinatorial Methods, Computer (IEEE Computer), [online], https://doi.org/10.1109/MC.2024.3363808, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=957175
(Accessed April 3, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Assured Autonomy through Combinatorial Methods
Published
Author(s)
, , , Jaganmohan Chandrasekaran, Erin Lanus, Tyler Cody, Laura Freeman
Abstract
Autonomous systems are proliferating rapidly, with strong interest in everything from vacuum cleaners and lawnmowers, to self-driving cars and autonomous farm equipment. Can these systems be trusted to function safely? Many conventional software engineering methods for high-trust software are not well suited to assured autonomy, but concepts from combinatorial testing can add confidence.Citation
Computer (IEEE Computer)
Volume
57
Issue
5
Pub Type
Journals
Download Paper
Keywords
autonomy, combinatorial testing, machine learning, software, trust
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created May 2, 2024, Updated March 19, 2025