The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types and programming languages
Types and programming languages
ProB: an automated analysis toolset for the B method
International Journal on Software Tools for Technology Transfer (STTT)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Implementing polymorphism in SMT solvers
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
veriT: An Open, Trustable and Efficient SMT-Solver
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Satisfiability Modulo Theories: An Appetizer
Formal Methods: Foundations and Applications
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Combinations of theories for decidable fragments of first-order logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Modeling in Event-B: System and Software Engineering
Modeling in Event-B: System and Software Engineering
Decision procedures for the formal analysis of software
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Automatic verification for a class of proof obligations with SMT-solvers
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
| Hi-index | 0.00 |
Software development in B and Event-B generates proof obligations that have to be discharged using theorem provers. The cost of such developments depends directly on the degree of automation and efficiency of theorem proving techniques for the logics in which these lemmas are expressed. This paper presents and formalizes an approach to transform a class of proof obligations essentially similar to those generated in the Rodin platform into the input language of a category of automatic theorem provers known as SMT-solvers. The work presented in the paper handles proof obligations with Booleans, integer arithmetics, basic sets and relations and has been implemented as a plug-in for Rodin.