Introducing robust reachability

Guillaume Girol (1) , Benjamin Farinier (2) , Sébastien Bardin (1)

1 DILS (CEA, LIST) - Département Ingénierie Logiciels et Systèmes
2 TU Wien - The Institute of Computer Graphics and Algorithms [Vienna]

We introduce a new property called robust reachability which refines the standard notion of reachability in order to take replicability into account. A bug is robustly reachable if a controlled input can make it so the bug is reached whatever the value of uncontrolled input. Robust reachability is better suited than standard reachability in many realistic situations related to security (e.g., criticality assessment or bug prioritization) or software engineering (e.g., replicable test suites and flakiness). We propose a formal treatment of the concept, and we revisit existing symbolic bug finding methods through this new lens. Remarkably, robust reachability allows differentiating bounded model checking from symbolic execution while they have the same deductive power in the standard case. Finally, we propose the first symbolic verifier dedicated to robust reachability: we use it for criticality assessment of 5 existing vulnerabilities, and compare it with standard symbolic execution.

Domaines: Sciences de l'ingénieur [physics]; Informatique [cs]

Guillaume Girol, Benjamin Farinier, Sébastien Bardin. Introducing robust reachability. Formal Methods in System Design, 2022, ⟨10.1007/s10703-022-00402-x⟩. ⟨cea-04102731⟩