基于本体的虚拟空间模型的研究

虚拟空间模型是由空间对象及其之间的空间关系构成,它为虚拟场景的构建提供了重要的语义信息。然而,由于空间对象和空间关系本身的复杂性,构建的虚拟空间模型通常是不全面的、非具体的。针对这种问题,在充分研究本体以及UML的基础上,提出了利用本体标记虚拟空间对象及对象之间的空间关系,从而构建了虚拟空间本体。论文首先提出虚拟空间中方向关系的计算方法,然后使用UML描述虚拟空间本体的空间结构,并使用OCL描述虚拟空间本体中虚拟对象的约束信息。最后通过一个虚拟办公室的实例,证明了该方法的可行性以及有效性。     

基于UML模型驱动的数据库设计与开发

面向对象的数据库开发框架对大型数据库应用的开发有重要作用 ,本文首先介绍了面向数据库开发框架的基本要求 ,然后介绍了UML对面向对象的数据库开发的支持 ,重点是介绍了OCL语言 ,最后用BorlandEco这样一个数据库开发框架开发了一个简易的模型 ,来显示UML模型驱动的数据库开发的巨大潜力。     

基于MSP430F5438的数字低频功率放大器的设计

本文提出了一种新型的传统低频功率放大器的数字化设计方法——利用高性能OCL功率放大电路及信号处理电路、MSP430F5438单片机、液晶显示器等模块组成智能低功耗功率放大器,采用单片机自带的12位ADC功能模块,实时检测功率放大器输出功率和整机效率等参数。电路结构简单,所选器件价格合理,并给出了测试结果。实验结果表明,该功率放大器在带宽、失真度、效率等方面具有较好的指标、较高的实用性。     

An analysis of metamodeling practices for MOF and OCL

The definition of a metamodel that precisely captures domain knowledge for effective know-how capitalization is a challenging task. A major obstacle for domain experts who want to build a metamodel is that they must master two radically different languages: an object-oriented, MOF-compliant, modeling language to capture the domain structure and first order logic (the Object Constraint Language) for the definition of well-formedness rules. However, there are no guidelines to assist the conjunct usage of both paradigms, and few tools support it. Consequently, we observe that most metamodels have only an object-oriented domain structure, leading to inaccurate metamodels. In this paper, we perform the first empirical study, which analyzes the current state of practice in metamodels that actually use logical expressions to constrain the structure. We analyze 33 metamodels including 995 rules coming from industry, academia and the Object Management Group, to understand how metamodelers articulate both languages. We implement a set of metrics in the OCLMetrics tool to evaluate the complexity of both parts, as well as the coupling between both. We observe that all metamodels tend to have a small, core subset of concepts, which are constrained by most of the rules, in general the rules are loosely coupled to the structure and we identify the set of OCL constructs actually used in rules.     

Validating a size measure for effort estimation in model-driven Web development

Web development is moving towards model-driven processes whose goal is the development of Web applications at a higher level of abstraction based on models and model transformations. This brings new opportunities to the Web project manager to make early estimates of the size and the effort required to produce Web applications based on their conceptual models. In the last few years, several studies for size and effort estimation have been performed. However, there are no studies regarding effort estimation in model-driven Web development. In this paper, we present the validation of a model-based size measure (OO-HFP) for Web effort estimation in the context of a model-driven Web development method. The validation is performed by comparing the prediction accuracy that OO-HFP provides with the accuracy provided by the standard function point analysis (FPA) method. The results of the study (using industrial data gathered from 31 Web projects) show that the effort estimates obtained for projects that are sized using OO-HFP are more accurate than the effort estimates obtained using the standard FPA method. This suggests that by following a model-driven development approach, the size measure obtained at the conceptual model of a Web application can be considered a suitable predictor of effort.     

The KeY tool

KeY is a tool that provides facilities for formal specification and verification of programs within a commercial platform for UML based software development. Using the KeY tool, formal methods and object-oriented development techniques are applied in an integrated manner. Formal specification is performed using the Object Constraint Language (OCL), which is part of the UML standard. KeY provides support for the authoring and formal analysis of OCL constraints. The target language of KeY based development is Java Card DL, a proper subset of Java for smart card applications and embedded systems. KeY uses a dynamic logic for Java Card DL to express proof obligations, and provides a state-of-the-art theorem prover for interactive and automated verification. Apart from its integration into UML based software development, a characteristic feature of KeY is that formal specification and verification can be introduced incrementally.     

UML/OCL工具的一致性检查研究

UML作为一种通用的可视化建模语言已被广泛应用,但UML模型的一致性问题一直限制着在软件开发中更有效地应用UML。本文阐述了UML模型一致性的相关概念,介绍了一种以OCL表示模型的一致性规则、并基于这些对模型进行一致性检查的方法。将此方法实现为一致性检查工具,提供了模型分析、语法检查和模型一致性检查等功能。     

形式化语言B与UML／OCL的比较

该文介绍了形式化方法中B语言和UML／OCL语言,从软件开发生命周期的角度对B语言和OCL语言进行了比较,归纳了这两种形式化语言的异同和各自的适用范围。     

基于OCL的面向方面监控框架

基于面向方面编程技术提出一种软件性质监控框架。该框架根据对象约束语言的约束条件生成监控方面,对监控方面与被监控软件进行编织,使软件在运行时具备发现约束违背的能力。使用模型约束检查工具USE可以进一步分析违约信息,实现其在模型上的可视化呈现。     

Incremental integrity checking of UML/OCL conceptual schemas

Integrity constraints play a key role in the specification and development of software systems since they state conditions that must always be satisfied by the system at runtime. Therefore, software systems must include some kind of integrity checking component that ensures that all constraints still hold after the execution of any operation that modifies the system state. Integrity checking must be as efficient as possible not to seriously slow down the system performance at runtime. In this sense, this paper proposes a set of techniques to facilitate the efficient integrity checking of UML-based software specifications, usually complemented with a set of integrity constraints defined in Object Constraint Language (OCL) to express all rules that cannot be graphically defined. In particular, our techniques are able to determine, at design-time, when and how each constraint must be checked at runtime to avoid irrelevant verifications. We refer to these techniques as incremental because they minimize the subset of the system state that needs to be checked after each change by assuming that the system was initially in a consistent state and just reevaluating the elements that may have been affected by that change. We also show how the techniques can be integrated in a model-driven development framework to automatically generate a final implementation that automatically checks all constraints in an incremental way.