Automated Verification of Szymanski's Algorithm
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
The Industrial Success of Verification Tools Based on Stålmarck's Method
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
CAVEAT: Technique and Tool for Computer Aided VErification And Transformation
Proceedings of the 7th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
The verification conditions associated with concurrent systems and their invariants are usually instances of the VC-scheme, i.e., (Λi=1nhi⇒c. Besides, the following assumptions are often satisfied : 1. The set of hypotheses H = {h1,..., hn} is rather large; 2. The hypotheses and the conclusion are small quantifier-free formulas; 3. They are based on a large set of booleans and a smaller set of predicates; 4. If H⊧ c, then there is a small subset H0 ⊂ H such that H0⊧ c. We demonstrate a specific, OBDD-based technique for validating instances of the VC-scheme. The main task of the tool is to construct an upper bound for H0, as tight as possible. The technique is illustrated with an example.