Formats for representing and manipulating verification problems are extr...
State-of-the-art model-checking algorithms like IC3/PDR are based on
uni...
Quantifier elimination (qelim) is used in many automated reasoning tasks...
Having reliable specifications is an unavoidable challenge in achieving
...
An uninterpreted program (UP) is a program whose semantics is defined ov...
Solidity smart contracts are programs that manage up to 2^160 users on a...
A recent case study from AWS by Chong et al. proposes an effective
metho...
Automated program verification is a difficult problem. It is undecidable...
SMT-based model checkers, especially IC3-style ones, are currently the m...
Pointer analysis is indispensable for effectively verifying heap-manipul...
The principle of strong induction, also known as k-induction is one of t...
We address the problem of verifying k-safety properties: properties that...
First Order Logic (FOL) is a powerful reasoning tool for program
verific...
Automated synthesis of reactive systems from spe- cifications has been a...