Abstract
Previously, we have found that incremental refinement, using the event based B method, supports the effective management of proof complexity when verifying properties of IO protocols, such as PCI. In the context of IO protocols, another important verification task is to show that a new protocol can be made compatible with an existing protocol. In this article, we report on our efforts to show that RapidIO, a new IO standard, can be made compatible with the transaction ordering property expected by PCI, a legacy standard. This is done by creating a refinement sequence for RapidIO as a branch in our previously completed PCI refinement chain. We found that incremental refinement simplifies specification reuse and allows a precise statement of compatibility. Ongoing work seeks to identify proof engineering methods to increase proof reuse for compatibility proofs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrial, J.-R.: The B Book - Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)
Abrial, J.-R., Cansell, D.: Clink’n Prove: Interactive proofs within set theory. In: Basin, D., Wolff, B. (eds.) TPHOLs 2003. LNCS, vol. 2758, pp. 1–24. Springer, Heidelberg (2003)
Abrial, J.-R., Cansell, D., Laffitte, G.: “Higher-order” mathematics in B. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, pp. 370–393. Springer, Heidelberg (2002)
Bryant, R., Lahiri, S.K., Seshia, S.A.: Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 78–92. Springer, Heidelberg (2002)
Aix-en-Provence (F) ClearSy. Atelier B, 2002. Version 3.5
Cansell, D., Mery, D.: Abstraction and refinement of features. In: Language Constructs for Describing Features, pp. 65–84. Springer, Heidelberg (2001)
Cohn, A.: The notion of proof in hardware verification. Journal of Automated Reasoning 5(2), 127–139 (1989)
Mokkedem, A., Hosabettu, R., Jones, M.D., Gopalakrishnan, G.: Formalization and proof of a solution to the PCI 2.1 bus transaction ordering problem. Formal Methods in Systems Design 16(1), 93–119 (2000)
PCISIG. PCI Special Interest Group–PCI Local Bus Specification, Revision 2.1 (June 1995)
RapidIO Trade Association. RapidIO interconnect specification, revision 1.1,3/2001 (2001)
Weinzoepflen, A., Jones, M., Mery, D., Cansell, D., Gopalakrishnan, G.: Incremental construction of a proof the producer/consumer property for the PCI protocol. In: Bert, D., Bowen, J.P., Henson, M.C., Robinson, K. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, pp. 22–42. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jones, M., Benson, A., Delorey, D. (2004). Proving Compatibility Using Refinement. In: Slind, K., Bunker, A., Gopalakrishnan, G. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2004. Lecture Notes in Computer Science, vol 3223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30142-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-30142-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23017-5
Online ISBN: 978-3-540-30142-4
eBook Packages: Springer Book Archive