Exhaustive branch coverage with TreeFrog - CEA - Commissariat à l’énergie atomique et aux énergies alternatives Access content directly
Conference Papers Year : 2023

Exhaustive branch coverage with TreeFrog

Abstract

Concolic methods efficiently generate test inputs for exhaustive path coverage. However, exhaustive path coverage is not often required or even realistic whereas exhaustive branch coverage is at the heart of many verification tasks. We explain how, in TreeFrog, we have tried to find an efficient solution to this very different problem. We have kept the efficient aspects of depthfirst concolic generation but combined it with multi-threading for breadth-first search, conflict learning lifted to branches and finally, some controlled path enumeration. First results show dramatic improvements over concolic methods
Fichier principal
Vignette du fichier
final_camera_ready.pdf (1.01 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

cea-04057580 , version 1 (04-04-2023)

Identifiers

Cite

Nicky Williams. Exhaustive branch coverage with TreeFrog. SAC'23 - The 38th ACM/SIGAPP Symposium On Applied Computing, ACM (SIgapp), Mar 2023, Tallinn (Virtual event), Estonia. ⟨10.1145/3555776.3577738⟩. ⟨cea-04057580⟩
36 View
60 Download

Altmetric

Share

Gmail Facebook X LinkedIn More