Constraint diagrams: visualizing invariants in object-oriented models
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Operational constraints in diagrammatic reasoning
Logical reasoning with diagrams
Towards the principled design of software engineering diagrams
Proceedings of the 22nd international conference on Software engineering
Logic and Visual Information
Towards a Formalization of Constraint Diagrams
HCC '01 Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01)
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
A Decidable Constraint Diagram Reasoning System
Journal of Logic and Computation
Towards Overcoming Deficiencies in Constraint Diagrams
VLHCC '07 Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing
Evaluating and generalizing constraint diagrams
Journal of Visual Languages and Computing
Verifying UML/OCL Operation Contracts
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
A Survey of Reasoning Systems Based on Euler Diagrams
Electronic Notes in Theoretical Computer Science (ENTCS)
The semantics of augmented constraint diagrams
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
Constraint diagrams were introduced by Kent, in 1997, as an alternative to the OCL for placing formal constraints on software models. Since their introduction, constraint diagrams have evolved and, after a careful analysis of their positive and negative features, generalized constraint diagrams were proposed. An important benefit of providing a formal model of a software system (diagrammatically or otherwise) is the ability to determine whether that model is consistent (i.e. satisfiable). However, determining satisfiability in an algorithmic, terminating, way is only possible in decidable logics. In this paper, we consider the so-called unitary existential fragment (UEF) of generalized constraint diagrams and, within this fragment, identify a decision procedure for the satisfiability of a particular class of diagrams. We then demonstrate how to extend the decision procedure to the UEF as a whole. This work lays the foundations for providing decision procedures for larger fragments of generalized constraint diagrams and we discuss how this might be achieved in the paper.