loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st IEEE International Conference on Automated Software Engineering (ASE'06)
Contradiction Finding and Minimal Recovery for UML Class Diagrams
Tokyo, Japan
September 18-September 22
ISBN: 0-7695-2579-2
Ken Satoh, National Institute of Informatics, Japan
Ken Kaneiwa, National Institute of Information and Communications Technology, Japan
Takeaki Uno, National Institute of Informatics, Japan

UML (Unified Modeling Language) is the de facto standard model representation language in software engineering. We believe that automated contradiction detection and repair of UML become very important as UML has been widely used. In this paper, we propose a debugging system using logic programming paradigm for UML class diagram with class attributes, multiplicity, generalization relation and disjoint relation.

We propose a translation method of a UML class diagram into a logic program, and using a meta-interpreter we can find (set-inclusion-based) minimal sets of rules which leads to contradiction. Then, we use a minimal hitting set algorithm developed by one of the authors to show minimal sets of deletion of rules in order to avoid contradiction.

Citation:
Ken Satoh, Ken Kaneiwa, Takeaki Uno, "Contradiction Finding and Minimal Recovery for UML Class Diagrams," ase, pp.277-280, 21st IEEE International Conference on Automated Software Engineering (ASE'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.