An introduction to Z and formal specifications
Software Engineering Journal - Special Section on Z
Conceptual schema and relational database design: a fact oriented approach
Conceptual schema and relational database design: a fact oriented approach
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
A Description of Rules through Occurring/Synthetic Cardinalities
Proceedings of the Seventh International Conference on Enity-Relationship Approach: A Bridge to the User
| Hi-index | 0.00 |
Deals with the formal specification of dynamic constraints. First of all, we introduce two dynamic constraints which we formally characterise using the B formal specification method. These two dynamic constraints, namely the faithfulness and existence dependency of a binary relationship, are defined using the three mathematical bases of B, viz. predicate logic, set theory and substitution theory. Moreover, we provide for each constraint what is called a proof obligation against which the system's operation specifications must be checked in order to determine whether or not they obey the constraint. This study has raised a general methodology for supporting the specification of a particular type of dynamic constraints in B. The outline of this methodology is presented. We finally show that the constraints we proposed have real-life applications and especially for formally defining the concept of composition in UML (Unified Modeling Language) as an example.