Abstract

Dynamic database behaviour can be specified by dynamic integrity constraints, which determine admissible sequences of database states, and by transaction specifications, which induce executable sequences. Constraints are expressed by formulae of temporal logic, whereas transactions are defined by pre/postconditions in predicate logic. This paper presents concepts and rules for transforming dynamic constraints into transaction specifications in order to prepare integrity monitoring by transactions. At first, such transition graphs must be constructed from temporal formulae that have paths corresponding to admissible sequences. Then these graphs are utilized to refine and to simplify pre/postconditions systematically, so that every executable state sequence becomes admissible, too.

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

Disclaimer: 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.