supported by the National Basic Research Program of China (Grant No. 2004CB719406);the National Natural Science Foundation of China (Grant Nos. 60635020, 90718039, 60763004)
The paper presents a new approach to computing the abstract state and a maximum weight heuristic method for finding the shortest counter-example in verification of imperative programs. The strategy is incorporated in ...
Project supported by the National Natural Science Foundation of China (Nos 60635020 and 90718039);the National Basic Research Program (973) of China (No 2004CB719406)
Satisfiability modulo theories (SMT) play a key role in verification applications. A crucial SMT problem is to combine separate theory solvers for the union of theories. In previous work, the simplex method is used to...