2010
DOI: 10.1007/978-3-642-16373-9_32
|View full text |Cite
|
Sign up to set email alerts
|

AuRUS: Automated Reasoning on UML/OCL Schemas

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(10 citation statements)
references
References 9 publications
0
10
0
Order By: Relevance
“…They have in common that the model is translated into a formalism that has a well-defined semantics. Most approaches employ automated reasoning in the target formalism, for example, description logic [23], first-order logic [11], relational logic [19], constraint satisfaction problems [9], or propositional logic [26]. Others, such as [4], use interactive theorem proving.…”
Section: Related Workmentioning
confidence: 99%
“…They have in common that the model is translated into a formalism that has a well-defined semantics. Most approaches employ automated reasoning in the target formalism, for example, description logic [23], first-order logic [11], relational logic [19], constraint satisfaction problems [9], or propositional logic [26]. Others, such as [4], use interactive theorem proving.…”
Section: Related Workmentioning
confidence: 99%
“…These ideas are further developed and formalized in this paper, with additional features as far as computing the explanations is concerned. Some initial ideas regarding the AuRUS tool were outlined in (Queralt et al 2010).…”
Section: Fig 2 Textual Integrity Constraints Of the Schema In Figurmentioning
confidence: 99%
“…Unfortunately, reasoning on OCL is undecidable in general. Therefore, current verification tools either require user interaction with the verification procedure (e.g., HOL-OCL [6], based on the Isabelle theorem prover), restrict the OCL constructs that can be used when writing OCL expressions (e.g., [23], based on query containment checking techniques) or follow a bounded verification approach, where the search space is finite in order to guarantee termination. The bounds in the verification are set by limiting the number of instances and the restricting the attribute domains to explore during the verification.…”
Section: Verification and Validation Tools For Oclmentioning
confidence: 99%
“…The OCL Portal 22 was born with the goal of collecting all information about OCL but unfortunately the activity level is low. OCL is also a topic discussed in the Modeling Languages portal 23 .…”
Section: Establishing An Ocl Communitymentioning
confidence: 99%