Super－Object模型：在分布存储器多计算机上实现共享存储器程序设计模式

Ｓｕｐｅｒ－Ｏｂｊｅｃｔ模型提出了一种新的方法，在分布存储器多计算机上实现语言级虚拟共享存储器以支持共享存储器通信模式．Ｓｕｐｅｒ－Ｏｂｊｅｃｔ模型引入新的概念ｓｕｐｅｒ－ｏｂｊｅｃｔ，不同于其它模型，基于ｓｕｐｅｒ－ｏｂｊｅｃｔ，它提出了新的共享数据定位方法，全局地址标识（ｎａｍｅ，ｏｆｆ－ｓｅｔ）．Ｓｕｐｅｒ－Ｏｂｊｅｃｔ模型与Ｆｏｒｔｒａｎ７７结合，我们实现了一个运行时间系统和库调用，支持程序员使用Ｆｏｒｔｒａｎ语言编写并行程序，最后介绍了系统的实现和取得的性能．     

C^＋＋语言在操作站仿真软件中的应用

本文介绍了面向对象的程序设计（ＯＯＰ—ＯｂｊｅｃｔＯｎｖｉｅｎｔｅｄＰｒｏｇｒａｍ．ｍｉｎｇ）语言的主要特征，并详细讨论了用具有ＯＯＰ特征的Ｃ＋＋语言来设计一个集散控制系统仿真器开发环境软件包中操作站仿真软件的一些思想。     

Dual-Object: 面向对象的并行程序设计

面向对象的并行程序设计提供了类似于共享内存模型对通讯和计算的抽象能力，从而非常适合于大型并行软件系统的开发．但是基于远程对象调用的分布式对象的实现效率一直是面向对象方法在分布式／并行程序设计中得到广泛应用的障碍．本文介绍了并行机ＭＡＮＮＡ上所采用的面向对象的并行程序设计模型——Ｄｕａｌ－Ｏｂｊｅｃｔ模型．该模型通过引入从语义角度出发给出的数据一致特性的描述，在一定程度上解决了实现效率低下的问题．其次，文章通过程序设计实例详细地讨论了基于Ｄｕａｌ－Ｏｂｊｅｃｔ模型的扩展Ｃ＋＋并行程序设计，并给出了部分实际测试结果．     

OOSDM的对象模型与系统构造

随着面向对象实现技术的快速发展，面向对象的各种软件开发方法正在相互融合，并进入实施应用阶段，从而有力地促使了这一方法逐步走向成熟，基于“青鸟工程”和现有的面向对象方法，我们提出了ＯＯＳＤＭ（Ｏｂｊｅｃｔ－ＯｒｉｅｎｔｅｄＳｏｆｔｗａｒｅＤｅｖｅｌｏｐｉｎｇＭｅｔｈｏｄ）。本文主要介绍ＯＯＳＤＭ的对象模型──结合事件对象，以及如何以这一对象模型进行软件系统构造。     

在OOA中如何确定对象及如何用对象建模

面向对象技术（Ｏｂｊｅｃｔ－ｏｒｉｅｎｔｅｄ）已成为九十年代系统分析和软件工程的核心技术，面向对象的系统分析ＯＯＡ（Ｏｂｊｅｃｔ－ｏｒｉｅｎｔｅｄＡｎａｌｙｓｉｓ）已经日益引起人们的重视和取得了一定进展，．然而在ＯＯＡ中如何确定对象及如何用对象建模却始终未获合理的解决，成了ＯＯＡ技术推行的瓶颈之所在。本文试图探索确定对象及用对象建模的若干实用规则，并以具体的案例予以说明，或许会对ＯＯＡ的使用者有所裨益。     

面向对象油气勘探综合数据平台的开发实践

面向对象技术正在油气勘探大型应用软件系统开发中得到越来越广泛的应用。本文介绍了应用面向对象技术对油气勘探数据进行分析建模，并在面向对象数据库ＯｂｊｅｃｔＳｔｏｒｅ基础上建立油气勘探综合数据平台的过程，指出了面向对象数据平台相对于关系数据平台的优越性。     

对象技术在分布式系统中的作用

对象管理集团公司（ＯｂｊｅｃｔＭａｎａｇｍｅｎｔＧｒｏｕｐ－ＯＭＧ）是一个致力于解决分布式环境中互操作问题的非盈利性协作组织，它遵循一个新的技术途径，即对象技术，产生了公认的基于可商用对象技术的事实标准。它的一套面向对象的标准化语言、接口和协议的基础是一种称作通用对象请求代理结构（ＣｏｍｍｏｎＯｂｊｅｃｔＲｅｑｕｅｓｔＢｒｏｋｅｒＡｒｃｈｉ－ｔｅｃｔｕｒｅ—ＣＯＲＢＡ）的通信约定。ＣＯＲＢＡ在具有不同的操作系统、语言、网络协议和硬件结构的系统间提供了应用层的互操作性。ＯＭＧ未来的计划是运用这些有力的服务和功能支持应用程序员的设计开发。     

面向对象的WINDOWS编程技术

本文从面向对象技术的基本概念出发，详细讨论了该技术在ＷＩＮＤＯＷＳ程序设计中的应用，并结合具体实例对传统的ＷＩＮＤＯＷＳ程序设计方法和面向对象的Ｏｂｊｅｃｔ Ｗｉｎｄｏｗｓ程序设计方法进行了比较。     

运用Object Windows编写WINDOWS程序

本文从面向对象技术的基本概念出发，详细讨论了该技术在ＷＩＮＤＯＷＳ程序设计中的应用。并结合具体实例对传统的ＷＩＮＤＯＷＳ程序设计方法和面向对象的Ｏｂｊｅｃｔ Ｗｉｎｄｏｗｓ程序设计方法进行了比较。     

对象类型作为对象和对象作为对象类型

对象类型作为对象和对象作为对象类型Ｏｂｊｅｃｔｔｙｐｅａｓｏｂｊｅｃｔｓ—ａｎｄｖｉｃｅｖｅｒｓ￥ＪａｍｅｓＯｄｅｌｌ正确的对象类型是对象这个事实是面向对象的一个基本概念。然而，大多数面向对象环境都不能很好地支持这个概念。但是这个概念对许多面向对象技...     

程序变换在程序语言中的一种表示——兼论变换型语言

本文首先引入了“变换型语言”的概念,给出了代表这种语言特征的机制:“变换模块”和“变换控制命令”的具体定义;举例说明了如何使用“变换模块”描述一个抽象数据类型的部分实现,并通过“变换控制命令”来完成程序中抽象变量及有关操作的变换过程;最后,讨论了变换型语言表示的抽象性,一般性和控制的灵活性,以及变换型程序的正确性等问题。     

Goedel语言类型系统

Goedel语言是一种说明性逻辑程序设计语言。该语言基于一阶逻辑，引入了一个多态多类的类型系统和多种新的语言成分，支持抽象数据类型和模块化程序设计等技术，语言本身也具有很强的说明性语义。详细介绍了Goedel语言的类型系统及其构造，对在逻辑程序设计语言中引入类型系统的作用进行了一些深入的分析和讨论。     

基于UML的面向C4ISR能力需求分析的对象建模语言

军事电子信息系统是一种典型的大规模复杂系统,如何获取这种复杂系统的需求仍然是一个难题。提出了一种新的能力需求分析方法。该方法从领域概念化入手,构造了C4ISR能力概念化的元本体;利用UML元层扩展机制,提出了一种用于定义C4ISR能力概念的对象建模语言,并给出了该语言的抽象语法和详细语法,利用OWL DL定义了形式语义。最后以一个C4ISR体系结构仿真建模为案例,说明了该方法的有效性和可用性。     

: A distributed real-time logic language

This paper presents a new language that integrates the real-time and distributed paradigms within the framework of a concurrent logic language. Concurrent logic languages (CLLs) are capable of expressing concurrence, communication and nondeterminism in a natural way. That is, the intrinsic parallel semantics of the concurrent logic languages makes them well-suited for distributed programming. The proposed language is particularly suitable for loosely coupled systems and it contains mechanisms for distributed and real-time process control. A new execution model for concurrent logic languages is presented, which enables efficient distributed execution and real-time control. The model is introduced by giving an operational semantics for the language and the new model's implementation is discussed, including the definition of a new abstract machine and its implementation on a network of Unix workstations. Although the sequential core is not optimized, some previous results are discussed, showing the feasibility of the language's execution model for distributed real-time systems. The language is currently being used as the kernel language for a distributed simulation and validation tool for communication protocols.     

: A distributed real-time logic language

This paper presents a new language that integrates the real-time and distributed paradigms within the framework of a concurrent logic language. Concurrent logic languages (CLLs) are capable of expressing concurrence, communication and nondeterminism in a natural way. That is, the intrinsic parallel semantics of the concurrent logic languages makes them well-suited for distributed programming. The proposed language is particularly suitable for loosely coupled systems and it contains mechanisms for distributed and real-time process control. A new execution model for concurrent logic languages is presented, which enables efficient distributed execution and real-time control. The model is introduced by giving an operational semantics for the language and the new model's implementation is discussed, including the definition of a new abstract machine and its implementation on a network of Unix workstations. Although the sequential core is not optimized, some previous results are discussed, showing the feasibility of the language's execution model for distributed real-time systems. The language is currently being used as the kernel language for a distributed simulation and validation tool for communication protocols.     

Toward an abstract theory of data compression

This paper extends the usual notion of abstract program size complexity, studied by Kolmogorov, Chaitin and others, to a theory that can better model the concept of a ‘practical’ compression method. The contraction of a string is defined, as in standard program size complexity, to be the shortest program which produces that string. However, this is in general an undecidable problem. Here, a model for an abstract compression ‘scheme’ is proposed. An abstract compression scheme not only allows the programming language and cost function to be specified, but also a restricted domain of programs that may be used as compressed forms. Limitations and inherent trade-offs are discussed and a class of ‘good’ schemes is considered.     

Integrating deductive verification and symbolic execution for abstract object creation in dynamic logic

We present a fully abstract weakest precondition calculus and its integration with symbolic execution. Our assertion language allows both specifying and verifying properties of objects at the abstraction level of the programming language, abstracting from a specific implementation of object creation. Objects which are not (yet) created never play any role. The corresponding proof theory is discussed and justified formally by soundness theorems. The usage of the assertion language and proof rules is illustrated with an example of a linked list reachability property. All proof rules presented are fully implemented in a version of the KeY verification system for Java programs.     

MontiCore: a framework for compositional development of domain specific languages

Domain specific languages (DSLs) are increasingly used today. Coping with complex language definitions, evolving them in a structured way, and ensuring their error freeness are the main challenges of DSL design and implementation. The use of modular language definitions and composition operators are therefore inevitable in the independent development of language components. In this article, we discuss these arising issues by describing a framework for the compositional development of textual DSLs and their supporting tools. We use a redundance-free definition of a readable concrete syntax and a comprehensible abstract syntax as both representations significantly overlap in their structure. For enhancing the usability of the abstract syntax, we added concepts like associations and inheritance to a grammar-based definition in order to build up arbitrary graphs (as known from metamodeling). Two modularity concepts, grammar inheritance and embedding, are discussed. They permit compositional language definition and thus simplify the extension of languages based on already existing ones. We demonstrate that compositional engineering of new languages is a useful concept when project-individual DSLs with appropriate tool support are defined.     

Polymorphic programming I. Another language designed on semantic principles

We wish to illustrate the potential of a thus far little explored avenue of programming language design–-namely the employment of types and routines as values in their own right within the framework of an Algol. In this first paper we pay particular attention to the development of highly orthogonal self-initializing data structures, and to the advantageous expressive power of polymorphism when combined with routine values so as to provide abstract data structures. The emphasis is on the design phase, rather than on the implementation details or precise syntactic structure of the envisaged language. A second, companion paper? discusses the design of a high-level orthogonal abstract architecture intended to support polymorphic languages in which routines are ‘first class’ values. The relationship of the abstract machine architecture to the programming language vis-a-vis the ‘semantic gap’ is then discussed from the viewpoint of compiling programs which are strongly typed while exploiting polymorphism. We feel that polymorphism is essential if truly general purpose programs, software tools, are to be written easily. The research reported herein is an effort towards realizing this goal.     

Defining Database Views as Data Abstractions

The concept of data abstraction is utilized in database systems to define user interfaces via database views in database application languages and to describe the architecture of database systems. Differences between the specification and use of database views and other data abstractions realized as abstract data types are discussed. Database views are formally specified using both the algebraic specification method and the abstract model specification method. The use of database views is demonstrated via the EXT_Pascal database application language.