Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Proceedings of the 2nd VDM-Europe Symposium on VDM---The Way Ahead
Journal of Symbolic Computation
Efficient dataflow analysis of logic programs
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A safe approximate algorithm for interprocedural aliasing
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Observations on industrial practice using formal methods
ICSE '93 Proceedings of the 15th international conference on Software Engineering
The Definition of Standard ML
Formal specification in the development of industrial applications: Subway speed control system
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
| Hi-index | 0.00 |
Formal methods are more frequently used in the realization of industrial safety-critical systems[10]. From the specification to the code, through a refinement process, all the steps are mathematically proved, generally with the help of automatic tools such as provers. This paper addresses the problem of the verification of such tools in the framework of the B formal development technique. The tools are written in a language called Theory Language for which the basic proof mechanism is pattern-matching. We propose a technique, based on a unification mechanism, for verifying programs written in this language. Some figures concerning the experimentation of this technique on real-life programs are given.