TY - CPAPER TI - Using a query language to state consistency constraints for repositories AU - Henrich, Andreas AU - Däberitz, Dirk PY - 2025 SP - 59-68 PB - Otto-Friedrich-Universität CY - Bamberg T3 - Lecture notes in computer science UR - https://fis.uni-bamberg.de/handle/uniba/106379 LA - eng AB - Modern system development environments usually deploy the object management facilities of a repository to store the documents created and maintained during system development. In this paper we present a pragmatic approach to express various levels of consistency for the data maintained in such a repository. The levels of consistency are achieved by means of a query language. Consistency constraints are stated as queries searching for inconsistent items in the repository. The queries are handled by a generic analyzer, which checks the defined constraints whenever appropriate. Furthermore, we present a general classification schema for consistency constraints and describe how different classes of constraints are handled by our approach. KW - query language ER -