基于类型理论的继承机制的研究

本文提出了基于构造性类型理论的一种面向对象类型理论中的继承机制,认为类是类规约类型的元素,而且类也是一种类型,继承是类规约和程序开发过程的重用机制.本文提出的理论可用于面向对象程序自动化的研究.     

基于类型理论的面向对象程序设计

构造性类型理论可作为程序开发的理论基础，其中类型作为程序规约，证明过程作为程序开发过程，从证明抽取满足程序规约的程序．本文提出了一种构造性类型理论ＴＴＯＯＰ，引入了类规约类型和类类型的概念．类是类规约类型的元素，它又是一种类型，类的元素为对象．通过证明类规约可构造类，由此构造面向对象软件．     

一种基于面向对象测试模型的测试代码生成方法与工具

在大规模的采用面向对象技术的软件开发过程中,自动化测试能起到重要作用.面向对象的程序设计方法对软件的自动化测试提出了新的问题.例如,多态、继承和动态绑定等在过程式的程序设计中不存在的问题.提出了一种支持面向对象软件测试的自动化测试方法.其中,首先提出了一种面向对象测试模型;对一个被测软件,基于该模型描述其测试特征,并基于反射机制获得对象的结构,可自动生成测试代码;并在此基础上实现了一个微软平台上的对象测试自动化工具.     

基于Selenium和AutoIt的办公系统自动化实现———以青岛核对系统为例

如今各行业诞生了大量的信息管理系统,为数据管理工作带来了便利,但给系统操作人员也带来了大量的数据录入等重复性操作。将其归纳起来,50%以上是点击、输入操作。这些不友好的系统降低了办事效率,影响了工作质量。办公自动化程序能够减少这些低级的重复性劳动,本文介绍了办公自动化产生的业务背景,目标元素的定位方法,列举了目标元素的自动化操作核心代码,最后总结了在开发过程中遇到的问题以及处理经验。     

面向对象分布式Web自动化实现

随着Web开发项目的日益庞大,自动化测试技术的重要性日益突出。自动化测试技术的出现,大大提高了软件测试的效率和测试人员的积极性。本文对自动化测试含义、种类及主流自动化测试框架进行了阐述;并介绍了一种基于Selenium2．0的面向对象分布武Web自动化测试的实现。     

合成语言FOPL基于方程逻辑的语义

程序设计语言ＦＯＰＬ是一种同时支持函数式程序设计风洛和面向对象程序设计风格的合成语言．本义介绍了ＦＯＰＬ的类型思想，并讨论了表达式纯洁性判断规则、表达式附类型规则及表达式等价判断规则，这些规则描述了ＦＯＰＬ基于方程逻辑的语义．     

基于面向对象的变电站实时数据库设计

针对变电站实时数据处理要求，本文论述了利用面向对象技术设计变电站综合自动化系统实时数据库的方法，并讨论了实时数据库的基本数据库操作实现。     

面向对象软件度量自动化参考模型MOOP

评估软件质量涉及到定性和定量两个方面。在定量的度量方面,要考虑两个问题,一是度量什么,二是如何度量。面向对象技术的新特点给软件度量提出了新的要求。本文提出了一种针对面向对象程序分析的度量自动化参考模型MOOP,该模型采用三层结构：翻译层、表示层、分析层,具有可重定编译前端、中间表示与语言无关、度量集可定制等优点。基于MOOP参考模型,我们设计了一种面向对象度量自动化系统MOOP－Kit。     

传统程序设计语言的面向对象扩充的若干技术

本文论述用转换方式实现传统程序设计语言的面向对象扩充，给出了一组关键技术以解决由子类型多态和动态定连所引出的问题，其基本思想是将类和对象类型分开处理，从而避免转换过程中的重复工作．这些技术具有适用性强、功效高的特点，并且在ＰＡＳＣＡＬ语言的面向对象扩充ＮＤＯＯＰ和ＭＯＤＵＬＡ－２语言的面向对象扩充ＮＤＯＯＭ的实现中被采用，效果令人满意.     

广义继承及其在面向对象程序设计语言中的实现*

本文给出一种包含多种继承行为的、非常灵活的代码复用机制——广义继承,通过给出其操作语义和一个支持类间子类型关系确认的类机制．为其在面向对象程序设计语言中的实现奠定了基础．     

面向对象类型理论的比较研究

人们已提出各种支持面向对象程序设计的类型理论。但每种类型理论的侧重点不足相同，它们均能解决面向对象程序设计的某些方面的问题。本文从对象、类、类型和继承角度，着重分析讨论抽象数据类型、记录演算和对象演算，为进一步研究关于面向对象程序设计的类型理论提供基础。     

Architecting and implementing distributed Web applications using the graph‐oriented approach

This paper presents a graph‐oriented framework, called WebGOP, for architecture modeling and programming of Web‐based distributed applications. WebGOP is based on the graph‐oriented programming (GOP) model, under which the components of a distributed program are configured as a logical graph and implemented using a set of operations defined over the graph. WebGOP reshapes GOP with a reflective object‐oriented design, which provides powerful architectural support in the World Wide Web environment. In WebGOP, the architecture graph is reified as an explicit object which itself is distributed over the network, providing a graph‐oriented context for the execution of distributed applications. The programmer can specialize the type of graph to represent a particular architecture style tailored for an application. WebGOP also has built‐in support for flexible and dynamic architectures, including both planned and unplanned dynamic reconfiguration of distributed applications. We describe the WebGOP framework, a prototypical implementation of the framework on top of SOAP, and a performance evaluation of the prototype. The prototype demonstrated the feasibility of our approach. Results of the performance evaluation showed that the overhead introduced by WebGOP over SOAP is reasonable and acceptable. Copyright © 2003 John Wiley & Sons, Ltd.     

AOP中方面冲突自动检测方法研究

为了解决面向方面编程中的方面冲突问题,在分析现有解决方法的基础上,提出了一种基于契约式设计的方面冲突自动检测方案。根据设计文档使用JML给方面和基础程序标注契约,利用契约转换程序生成契约检查程序,契约检查程序与面向方面的应用程序一起编译,生成包含契约检查的目标文件,从而在程序执行时,自动检测出方面与基础程序间的冲突以及方面与方面间冲突。该方案不破坏现有的应用程序,且无需重新设计编译器。通过一个实例表明该方案的可行性。     

A Design for Type-Directed Programming in Java

Type-directed programming is an important and widely used paradigm in the design of software. With this form of programming, an application may analyze type information to determine its behavior. By analyzing the structure of data, many operations, such as serialization, cloning, adaptors and iterators may be defined once, for all types of data. That way, as the program evolves, these operations need not be updated—they will automatically adapt to new data forms. Otherwise, each of these operations must be individually redefined for each type of data, forcing programmers to revisit the same program logic many times during a program's lifetime.The Java language supports type directed programming with the instanceof operator and the Java Reflection API. These mechanisms allow Java programs to depend on the name and structure of the run-time classes of objects. However, the Java mechanisms for type-directed programming are difficult to use. They also do not integrate well with generics, an important new feature of the Java language.In this paper, we describe the design of several expressive new mechanisms for type-directed programming in Java, and show that these mechanisms are sound when included in a language similar to Featherweight Java. Basically, these new mechanisms pattern-match the name and structure of the type parameters of generic code, instead of the run-time classes of objects. Therefore, they naturally integrate with generics and provide strong guarantees about program correctness. As these mechanisms are based on pattern matching, they naturally and succinctly express many operations that depend on type information. Finally, they provide programmers with some degree of protection for their abstractions. Whereas instanceof and reflection can determine the exact run-time type of an object, our mechanisms allow any supertype to be supplied for analysis, hiding its precise structure.     

Function call interception techniques

Function call interception (FCI), or method call interception (MCI) in the object‐oriented programming domain, is a technique of intercepting function calls at program runtime. Without directly modifying the original code, FCI enables to undertake certain operations before and/or after the called function or even to replace the intercepted call. Thanks to this capability, FCI has been typically used to profile programs, where functions of interest are dynamically intercepted by instrumentation code so that the execution control is transferred to an external module that performs execution time measurement or logging operations. In addition, FCI allows for manipulating the runtime behavior of program components at the fine‐grained function level, which can be useful in changing an application's original behavior at runtime to meet certain execution requirements such as maintaining performance characteristics for different input problem sets. Due to this capability, however, some FCI techniques can be used as a basis of many security exploits for vulnerable systems. In this paper, we survey a variety of FCI techniques and tools along with their applications to diverse areas in the computing and software domains. We describe static and dynamic FCI techniques at large and discuss the strengths and weaknesses of different implementations in this category. In addition, we also discuss aspect‐oriented programming implementation techniques for intercepting method calls.     

基于Java的泛型编程

泛型编程是面向对象的进一步发展,从更高的角度对世界进行抽象,为面向对象的不足之处提供了解决之道.它可让你重复运用既有的算法,而不必在环境类似的情况下再重新撰写相同代码,使得处理的问题更加抽象化,是一种优美而又不失效率的通用型程序设计方法.JDK 1.5中引入了对Java语言的多种扩展,泛型(generics)即其中之一.本文讨论JDK 1.5的泛型实现.     

新型的面向对象的编程语言-C#

C#是微软开发的新型编程语言。它具有简单、现代、强大、灵活、面向对象等特性的同时，还提供了自动内存管理、统一类型系统、版本控制及对网络编程新标准的支持等新特性。通过将C#与现阶段较流行的几种编程语言如C 、Java等进行比较，对C#进行了更加详细的剖析。C#能开发多种类型的程序包括Asp．Net工程、Web服务程序、Windows应用程序和控制台应用程序。虽然C#还有一些不足之处，但它仍具有广阔的发展前景。     

基于对象的逻辑设计实现复杂性

ＬＣＰＰ是作者研制的逻辑与对象结合的多范式语言,由于采用以对象为基础、扩充对象的逻辑特征而实现结合,逻辑程序设计就继承了面向对象的继承性、多态性和动态约束的特性,加这对象集合中搜索的进行,大大提高了逻辑搜索实现的复杂性。本文提出并讨论了这一复杂性的表现与解决的方法。     

一个Pascal的面向对象扩充的设计与实现

本文阐述了ＮＤＯＯＰ的设计和实现的主要思想．ＮＤＯＯＰ是一个Ｐａｓｃａｌ的面向对象扩充，是Ｐａｓｃａｌ的超集，既充分支持面向对象程序设计，又保持了Ｐａｓｃａｌ的原有风格．