An efficient method of computing static single assignment form
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Presburger arithmetic with unary predicates is P11 complete
Journal of Symbolic Logic
APSEC '02 Proceedings of the Ninth Asia-Pacific Software Engineering Conference
A subset of precise UML for model-based testing
Proceedings of the 3rd international workshop on Advances in model-based testing
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
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
SMT-based enumeration of object graphs from UML class diagrams
ACM SIGSOFT Software Engineering Notes
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
In the Model Based Testing domain, one of the bottleneck elements is the tests generation (time or reachability). In literature, one of the efficient solutions to evaluate a formula is to use an SMT solver. However the input language, SMT-lib, used by the solvers is not adapted to human modelling. To model we choose to use a sufficient sub-part of UML/OCL for Model Based Testing generation, called UML4MBT. This sub-part has been formalized with a meta-model. In this paper, we define the SMT meta-model and we describe the transformation rules from the UML4MBT meta-model to the SMT meta-model. We give the results of the experiments on a first implementation of the rules.