We describe an approach to mechanically prove the correctness of BURS specifications and show how such a tool can be connected with BURS based back-end generators. The proofs are based on an operational semantics of both source and target system languages specified by means of Abstract State Machines (ASM's). The correctness condition based on these operational semantics is decomposed into local correctness conditions for each BURS rule and the rules can be proved independently. The specification and verification system PVS is used to mechanically verify BURS-rules based on formal representations of the languages involved. In particular, we have defined PVS proof strategies which enable an automatic verification of the rules. Using PVS, several erroneous rules have been found. Moreover, from failed proof attempts we were able to correct them.

 

Online Copy

Postscript (283 KB)