Verifying Correctness in StAC Specifications
Abstract:
Abstract. Business transactions are prone to failure and to deal with unexpected situations some specification languages, e.g. StAC, introduce notions like compensation handling. Given the importance of verification of correctness in business related software, it is important to fill in the gap between specification languages like StAC and the verification software already available. We report on our work to obtain a translator from StAC to Promela and an analysis concerning different types of behavioral properties related to the notion of compensation itself. We comment on the most interesting challenges we faced during the translation procedure and also on those aspects of the verification procedure directly related to the distinctive features of StAC. Although there is still place for improvement, the translation provides the user with a Promela version of the original specification that is ready to be used in SPIN. 1
Citations
| 1345 | The Temporal Logic of Reactive and Concurrent Systems: Specification – Manna, Pnueli - 1992 |
| 997 | Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications – Clarke, Emerson, et al. - 1986 |
| 490 | The B-Book: Assigning Programs to Meanings – Abrial - 1996 |
| 218 | The SPIN Model Checker – Holzmann - 2003 |
| 21 | Verifying temporal properties of reactive systems: A step tutorial – Bjorner, Browne, et al. - 1999 |
| 17 | A process compensation language – Ferreira, Butler |
| 16 | Extending the concept of transaction compensation – Chessell, Vines, et al. |
| 6 | Animation and model checking of csp and b using prolog technology – Leuschel, Adhianto, et al. - 2001 |
