VeriAbs: Verification by abstraction and test generation
M Afzal, A Asia, A Chauhan… - 2019 34th IEEE/ACM …, 2019 - ieeexplore.ieee.org
Verification of programs continues to be a challenge and no single known technique
succeeds on all programs. In this paper we present VeriAbs, a reachability verifier for C …
succeeds on all programs. In this paper we present VeriAbs, a reachability verifier for C …
Sound and Partially-Complete Static Analysis of Data-Races in GPU Programs
D Liew, T Cogumbreiro, J Lange - Proceedings of the ACM on …, 2024 - dl.acm.org
GPUs are progressively being integrated into modern society, playing a pivotal role in
Artificial Intelligence and High-Performance Computing. Programmers need a deep …
Artificial Intelligence and High-Performance Computing. Programmers need a deep …
BMC+ Fuzz: Efficient and effective test generation
R Metta, RK Medicherla… - 2022 Design, Automation …, 2022 - ieeexplore.ieee.org
Coverage Guided Fuzzing (CGF) is a greybox test generation technique. Bounded Model
Checking (BMC) is a whitebox test generation technique. Both these have been highly …
Checking (BMC) is a whitebox test generation technique. Both these have been highly …
VeriAbs: Verification by Abstraction and Test Generation: (Competition Contribution)
VeriAbs is a portfolio software verifier for ANSI-C programs. To prove properties with better
efficiency and scalability, this version implements output abstraction with k-induction in the …
efficiency and scalability, this version implements output abstraction with k-induction in the …
VeriAbs: Verification by abstraction (competition contribution)
B Chimdyalwar, P Darke, A Chauhan, P Shah… - … 2017, Held as Part of the …, 2017 - Springer
VeriAbs verifies C programs by transforming them to abstract programs. The transformation
replaces loops in the original code by abstract loops of small known bounds. Bounded …
replaces loops in the original code by abstract loops of small known bounds. Bounded …
Scaling bounded model checking by transforming programs with arrays
Abstract Bounded Model Checking is one the most successful techniques for finding bugs in
program. However, model checkers are resource hungry and are often unable to verify …
program. However, model checkers are resource hungry and are often unable to verify …
Computing partially path-sensitive MFP solutions in data flow analyses
K Pathade, UP Khedker - … of the 27th International Conference on …, 2018 - dl.acm.org
Data flow analysis traverses paths in a control flow graph (CFG) representation of programs
to compute useful information. Many of these paths are infeasible, ie they cannot arise in any …
to compute useful information. Many of these paths are infeasible, ie they cannot arise in any …
OLA: Property Directed Outer Loop Abstraction for Efficient Verification of Reactive Systems
P Darke, B Chimdyalwar - 2023 IEEE International Conference …, 2023 - ieeexplore.ieee.org
Reactive systems, designed for embedded applications, commonly feature an outer infinite
loop that captures environmental input and according to the inputs decides the system's …
loop that captures environmental input and according to the inputs decides the system's …
Efficient safety proofs for industry-scale code using abstractions and bounded model checking
P Darke, B Chimdyalwar, A Chauhan… - … on Software Testing …, 2017 - ieeexplore.ieee.org
Loop Abstraction followed by Bounded Model Checking, or LABMC in short, is a promising
recent technique for proving safety of large programs. In an experimental setup proposed …
recent technique for proving safety of large programs. In an experimental setup proposed …
[PDF][PDF] Impactful research and tooling for program correctness
Impactful research and tooling for program correctness Page 1 india region hot topics 52
COMMUNICATIONS OF THE ACM | NOVEMBER 2022 | VOL. 65 | NO. 11 with complex …
COMMUNICATIONS OF THE ACM | NOVEMBER 2022 | VOL. 65 | NO. 11 with complex …