TY - GEN
T1 - Verifying Multi-vendor IoT Deployments Using Conditional Tables
AU - Anwar, Mubashir
AU - Caesar, Matthew
AU - Wang, Anduo
N1 - This work was supported by National Science Foundation Award CNS-1909450, CNS-2145242.
PY - 2026
Y1 - 2026
N2 - In recent years, IoT devices have seen widespread deployments in critical environments such as healthcare, military, and home security systems. These deployments often involve managing a heterogeneous collection of devices by non-expert users, increasing the risk of errors that could lead to significant monetary and physical damage. Unfortunately, such deployments face unique challenges such as incomplete visibility (e.g., need to interoperate with closed software systems), incompatibility (e.g., need to interact across different protocols and control logic created by different vendors), and management complexity (e.g., need to express complex and diverse intentions in ways that can be understood by inexperienced users). While system verification has been crucial in catching errors early in other domains, these challenges complicate its application in IoT. To perform verification under these conditions, we propose Pyotr, a system based on a mathematical framework from the theory of database systems called incomplete databases. Pyotr can integrate data from heterogeneous devices, perform data analysis under failures and uncertain knowledge, verify intended behavior using easy-to-use database-styled queries, and provide a generalized algebraic framework for reasoning about IoT systems in a rigorous and intuitive way. Our experiments on large IoT networks show that Pyotr can scalably answer complex queries on thousands of connected IoT devices within a few milliseconds.
AB - In recent years, IoT devices have seen widespread deployments in critical environments such as healthcare, military, and home security systems. These deployments often involve managing a heterogeneous collection of devices by non-expert users, increasing the risk of errors that could lead to significant monetary and physical damage. Unfortunately, such deployments face unique challenges such as incomplete visibility (e.g., need to interoperate with closed software systems), incompatibility (e.g., need to interact across different protocols and control logic created by different vendors), and management complexity (e.g., need to express complex and diverse intentions in ways that can be understood by inexperienced users). While system verification has been crucial in catching errors early in other domains, these challenges complicate its application in IoT. To perform verification under these conditions, we propose Pyotr, a system based on a mathematical framework from the theory of database systems called incomplete databases. Pyotr can integrate data from heterogeneous devices, perform data analysis under failures and uncertain knowledge, verify intended behavior using easy-to-use database-styled queries, and provide a generalized algebraic framework for reasoning about IoT systems in a rigorous and intuitive way. Our experiments on large IoT networks show that Pyotr can scalably answer complex queries on thousands of connected IoT devices within a few milliseconds.
KW - Conditional Tables
KW - Formal verification
KW - IoT
UR - https://www.scopus.com/pages/publications/105027063219
UR - https://www.scopus.com/pages/publications/105027063219#tab=citedBy
U2 - 10.1007/978-3-032-10554-7_8
DO - 10.1007/978-3-032-10554-7_8
M3 - Conference contribution
AN - SCOPUS:105027063219
SN - 9783032105530
T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST
SP - 145
EP - 168
BT - Mobile and Ubiquitous Systems
A2 - Soylu, Ahmet
A2 - Liu, Fan
A2 - Mitra, Karan
A2 - Zhang, Yan
A2 - Grønli, Tor-Morten
PB - Springer
T2 - 21st EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, MobiQuitous 2024
Y2 - 12 November 2024 through 14 November 2024
ER -