Abstract
We present a method to discharge proof obligations from Atelier B using multiple SMT solvers. It is based on a faithful modeling of B’s set theory into polymorphic first-order logic. We report on two case studies demonstrating a significant improvement in the ratio of obligations that are automatically discharged.
This work is partly funded by the U3CAT project (ANR-08-SEGI-021, http://frama-c.com/u3cat/ ) of the French national research organization (ANR).
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 (1996)
Badeau, F., Amelot, A.: Using B as a High Level Programming Language in an Industrial Project: Roissy VAL. In: Treharne, H., King, S., C. Henson, M., Schneider, S. (eds.) ZB 2005. LNCS, vol. 3455, pp. 334–354. Springer, Heidelberg (2005)
Barras, B.: Sets in Coq, Coq in sets. Journal of Formalized Reasoning (2010)
Barrett, C.W., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298–302. Springer, Heidelberg (2007)
Behm, P., Benoit, P., Faivre, A., Meynadier, J.-M.: Météor: A Successful Application of B in a Large Project. In: Wing, J.M., Woodcock, J. (eds.) FM 1999. LNCS, vol. 1708, pp. 369–387. Springer, Heidelberg (1999)
Bobot, F., Filliâtre, J.-C., Marché, C., Paskevich, A.: Why3: Shepherd your herd of provers. In: Workshop on Intermediate Verification Languages (2011)
Bobot, F., Paskevich, A.: Expressing Polymorphic Types in a Many-Sorted Language. In: Tinelli, C., Sofronie-Stokkermans, V. (eds.) FroCos 2011. LNCS, vol. 6989, pp. 87–102. Springer, Heidelberg (2011)
Bodeveix, J.-P., Filali, M., Muñoz, C.: A formalization of the B-method in Coq and PVS. In: B-User Group Meeting, Formal Methods, pp. 33–49 (1999)
ClearSy. Language Keywords and Operators, 1.8.5 edn., http://www.tools.clearsy.com/images/3/33/Symboles_en.pdf
Colin, S., Mariano, G.: Coq, l’alpha et l’omega de la preuve pour B ? (February 2009), http://hal.archives-ouvertes.fr/hal-00361302/PDF/bicoax.pdf
Colin, S., Petit, D., Mariano, G., Poirriez, V.: BRILLANT: an open source platform for B. In: Workshop on Tool Building in Formal Methods (February 2010)
Conchon, S., Contejean, E., Kanig, J., Lescuyer, S.: CC(X): Semantic combination of congruence closure with solvable theories. ENTCS 198(2), 51–69 (2008)
de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008)
Déharbe, D.: Integration of SMT-solvers in B and Event-B development environments. Science of Computer Programming (2011)
Jacquel, M., Berkani, K., Delahaye, D., Dubois, C.: Verifying B Proof Rules Using Deep Embedding and Automated Theorem Proving. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 253–268. Springer, Heidelberg (2011)
Milner, R.: A theory of type polymorphism in programming. Journal of Computer and System Sciences 17 (1978)
Rocheteau, J., Colin, S., Mariano, G., Poirriez, V.: Évaluation de l’extensibilité de PhoX: B/PhoX un assistant de preuves pour B. In: JFLA, pp. 139–153 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mentré, D., Marché, C., Filliâtre, JC., Asuka, M. (2012). Discharging Proof Obligations from Atelier B Using Multiple Automated Provers. In: Derrick, J., et al. Abstract State Machines, Alloy, B, VDM, and Z. ABZ 2012. Lecture Notes in Computer Science, vol 7316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30885-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-30885-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30884-0
Online ISBN: 978-3-642-30885-7
eBook Packages: Computer ScienceComputer Science (R0)