Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Model checking
How many recursive calls does a recursive function make?
ACM SIGCSE Bulletin
Reconciling Axiomatic and Model-Based Specifications Using the B Method
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
"Higher-Order" Mathematics in B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
On Using Conditional Definitions in Formal Theories
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Concepts, Techniques, and Models of Computer Programming
Concepts, Techniques, and Models of Computer Programming
Validating Z specifications using the PROB animator and model checker
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Automatic refinement checking for b
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
Partial recursive functions in higher-order logic
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
ProB is an animation and model checking tool for the B Method, which can deal with many interesting specifications. Some specifications, however, contain complicated functions which cannot be represented explicitly by a tool. We present a scheme with which higher-order recursive functions can be encoded in B, and establish soundness of this scheme. We then describe a symbolic representation for such functions. This representation enables ProB to successfully animate and model check a new class of relevant specifications, where animation is especially important due to the involved nature of the specification.