The object constraint language: precise modeling with UML
The object constraint language: precise modeling with UML
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
Expressing UML Class Diagrams Properties with OCL
Object Modeling with the OCL, The Rationale behind the Object Constraint Language
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
USE: A UML-based specification environment for validating UML and OCL
Science of Computer Programming
Verification of UML/OCL Class Diagrams using Constraint Programming
ICSTW '08 Proceedings of the 2008 IEEE International Conference on Software Testing Verification and Validation Workshop
Verifying UML/OCL Operation Contracts
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Consistency, Independence and Consequences in UML and OCL Models
TAP '09 Proceedings of the 3rd International Conference on Tests and Proofs
Kodkod: a relational model finder
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Verifying UML/OCL models using Boolean satisfiability
Proceedings of the Conference on Design, Automation and Test in Europe
Extensive validation of OCL models by integrating SAT solving into USE
TOOLS'11 Proceedings of the 49th international conference on Objects, models, components, patterns
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
UML2Alloy: a challenging model transformation
MODELS'07 Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems
| Hi-index | 0.00 |
The application of formal methods in the detection of inconsistencies and design flaws within models has been intensely studied in recent years. Since consistency checking is in principle undecidable due to the infinite number of possible system states, problem bounds have to be defined making the analysis tractable. However, defining these problem bounds requires detailed design knowledge and, thus, impedes an automatic verification flow. In this paper, we present first ideas and results of how to automatically determine valid problem bounds for consistency checking algorithms. For this purpose, we make use of automatic proof engines for linear integer arithmetic. We describe the approach by means of class diagrams given in the Unified Modeling Language (UML) extended by constraints given in the Object Constraint Language (OCL).