[PDF][PDF] Solving constrained Horn clauses modulo algebraic data types and recursive functions.

HG VK, S Shoham, A Gurfinkel - Proc. ACM Program. Lang., 2022 - tau.ac.il
Authors' addresses: Hari Govind VK, Department of Electrical and Computer Engineering,
University of Waterloo, Canada, hgvk94@ gmail. com; Sharon Shoham, Tel-Aviv University …

Data-Driven Template-Free Invariant Generation

Y Xia, JV Deshmukh, M Raghothaman… - arXiv preprint arXiv …, 2023 - arxiv.org
Automatic verification of concurrent programs faces state explosion due to the exponential
possible interleavings of its sequential components coupled with large or infinite state …

Reachability Analysis for Multiloop Programs Using Transition Power Abstraction

K Britikov, M Blicha, N Sharygina… - … Symposium on Formal …, 2024 - Springer
A wide variety of algorithms is employed for the reachability analysis of programs with loops
but most of them are restricted to single loop programs. Recently a new technique called …

A K-Induction Method Extended with Value Analysis for C Program Safety Verification

G Hui, H Chunyan, W Jinsong… - 2022 IEEE International …, 2022 - ieeexplore.ieee.org
The k-induction algorithm is a well-known verification technique that combines bounded
model checking with an inductive approach to verify program safety. Many software …

Towards Scalable Fully Automatic Program Verification

HG Vediramana Krishnan - 2024 - uwspace.uwaterloo.ca
Formal verification is a rigorous way to establish software quality. After more than 50 years of
research, we are at a point where formal verification is starting to be used in industrial …