creators_name: Plagge, Daniel creators_name: Leuschel, Michael creators_id: leuschel@cs.uni-duesseldorf.de type: conference_item datestamp: 2012-09-11 18:47:59 lastmod: 2012-09-12 07:11:23 metadata_visibility: show title: Validating B, Z and TLA+ using ProB and Kodkod ispublished: pub subjects: ADVANCE full_text_status: none pres_type: paper note: LNCS 7436, Springer. abstract: We present the integration of the Kodkod high-level interface to SAT-solvers into the kernel of ProB. As such, predicates from B, Event-B, Z and TLA+ can be solved using a mixture of SAT-solving and ProB's own constraint-solving capabilities developed using constraint logic programming: the first-order parts which can be dealt with by Kodkod and the remaining parts solved by the existing ProB kernel. We also present an extensive empirical evaluation and analyze the respective merits of SAT-solving and classical constraint solving. We also compare to using SMT solvers via recently available translators for Event-B. date: 2012 date_type: published pagerange: 372-386 event_title: Proceedings FM'2012 event_location: Paris event_dates: August, 2012 event_type: conference refereed: TRUE official_url: http://www.stups.uni-duesseldorf.de/mediawiki/images/8/8f/Pub-PlaggeLeuschel_Kodkod2012.pdf citation: Plagge, Daniel and Leuschel, Michael (2012) Validating B, Z and TLA+ using ProB and Kodkod. In: Proceedings FM'2012, August, 2012, Paris.