On the complexities of consistency checking for restricted UML class diagrams

DOI10.1016/J.TCS.2009.04.030MaRDI QIDQ1044829zbMATH OpenOpenAlexFDO

Authors Ken Kaneiwa, Ken Satoh

Publication date 15 December 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.04.030

zbMATH Keywords

tractable consistency checking of UML class diagrams

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of software (68N99)

Recommendations

• Foundations of Information and Knowledge Systems
• Checking consistency in UML diagrams: classes and state machines.
• A formal methodology for semantics and time consistency checking of UML dynamic diagrams

Cites work

• EXPtime tableaux for ALC
• Foundations of Information and Knowledge Systems
• Generalized quantifiers and pebble games on finite structures
• scientific article; zbMATH DE number 566081 (Why is no real title available?)
• On the complexity of inferring functional dependencies
• Reasoning on UML class diagrams

Cited in

(5)

• Paraconsistent computation tree logic
• scientific article; zbMATH DE number 5004762 (Why is no real title available?)
• scientific article; zbMATH DE number 1839450 (Why is no real title available?)
• Foundations of Information and Knowledge Systems
• Checking consistency in UML diagrams: classes and state machines.

This page was built for publication: On the complexities of consistency checking for restricted UML class diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044829)