Abstract
B is a language with a three-valued semantics: terms like min(0) or 1/0 are ill-defined, consequently formulas containing ill-defined terms may also be ill-defined. Therefore the deduction system we use to discharge the proof obligations should be constructed from a three-valued logic. In this paper, we introduce a deduction system that allows to reason in a two-valued logic if new proof obligations called well-definedness lemmas are also proved. We define this deduction s ystem and the new proof obligations that ensure the well-definedness of B components. The practical benefits on the proof mechanisms are then outlined.KeywordsDeduction SystemProof ObligationAbstract MachineProof MechanismTotal PredicateThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
