Finding Software Vulnerabilities in Large C Projects via Bounded Model Checking

Bounded model checking (BMC) is a widely used technique for detecting security vulnerabilities and verifying the correctness of critical software components. While highly effective on small to medium-sized codebases, its application to large-scale software systems remains difficult due to scalability limitations. In this work, we present a practical methodology to enable the use of BMC in real-world, complex software projects. Our approach includes automated preprocessing of source code and a guided verification process that helps a model checker systematically explore a codebase. We also introduce a function-level prioritization mechanism that focuses verification efforts on the most critical code parts. We evaluated our method on popular open-source C projects, discovering security vulnerabilities that the respective developers confirmed. The results demonstrate that, with appropriate strategies, BMC can effectively scale to verify large software systems while maintaining low memory usage.

Authors

Publication Details

Journal
Research Explorer (The University of Manchester)
Published
2026-01-13
Primary Topic
Security and Verification in Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finding Software Vulnerabilities in Large C Projects via Bounded Model Checking

Thales Araujo da Silva, Norbert Tihanyi, Richard A. Dubniczky, Lucas; id_orcid 0000-0002-6235-4272 Cordeiro et al.
Research Explorer (The University of Manchester)
Security and Verification in Computing
article

Finding Software Vulnerabilities in Large C Projects via Bounded Model Checking

Thales Araujo da Silva, Norbert Tihanyi, Richard A. Dubniczky, Lucas; id_orcid 0000-0002-6235-4272 Cordeiro, Bruno Carvalho De Farias, Eddie B. De L. Filho, Janislley Oliveira de Sousa
article en

Abstract

Bounded model checking (BMC) is a widely used technique for detecting security vulnerabilities and verifying the correctness of critical software components. While highly effective on small to medium-sized codebases, its application to large-scale software systems remains difficult due to scalability limitations. In this work, we present a practical methodology to enable the use of BMC in real-world, complex software projects. Our approach includes automated preprocessing of source code and a guided verification process that helps a model checker systematically explore a codebase. We also introduce a function-level prioritization mechanism that focuses verification efforts on the most critical code parts. We evaluated our method on popular open-source C projects, discovering security vulnerabilities that the respective developers confirmed. The results demonstrate that, with appropriate strategies, BMC can effectively scale to verify large software systems while maintaining low memory usage.

Research Explorer (The University of Manchester)
Peace, Justice and strong institutions
Openalex Percentile: Top 65%
Security and Verification in Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Finding Software Vulnerabilities in Large C Projects via Bounded Model Checking — Thales Araujo da Silva, Norbert Tihanyi, et al. · Research Explorer (The University of Manchester) (2026) | TGRS Research Map | TGRS