Abstract
A method is described for systematically deriving from a static formulation of a simple existence constraint the corresponding dynamic formulation. The latter formulation is embedded, under the form of applicability conditions, in a set of axiomatized update operations. A many-sorted first-order predicate calculus is used as the specification language. Update behaviour issues are identified and discussed.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
