并发软件的图形化设计方法研究(一):并发设计语言CONDL的定义"

这项研究的目标是：为并发软件的设计提供一种图形化的方法和支撑工具，以便用图形表过并发软件的设计，并生成并发程序的框架（并发程序单元的划分和它们之间的通信），这样做的好处在于提高软件的生产率，改善软件质量，在论文的这一部分，给出了并发设计语言CONDL的定义。     

并发软件的图形化设计方法研究(二):并发设计语言CONDL的图形化表示

这项研究的目标是：为并发软件的设计提供一种图形化的方法和支撑工具,以便用图形表达并发软件的设计,并生成并发程序的框架(并发程序单元的划分和它们之间的通信)。这样做的好处在于提高软件的生产率,改善软件质量。在论文的这一部分,给出了并发设计语言OONDL的一种图形化表示,即泳道表示。     

SSACC:一种基于软件科学法的Ada并发复杂性度量

本文致力于将软件科学法应用于Ada程序的并发复杂性度量,描述其方法和基于这种方法的相应工具SSACC。文中为Ada并发程序提出了一个面向度量的操作元-操作符模型,将任务和入口作为操作元,将程序中的并发动作作为对任务施加的操作。SSACC是Ada并发复杂性度量工具MACC的一部分。     

Ada-I:支持保护对象继承的Ada95扩充语言

面向对象并发程序设计语言能够帮助程序员利用面向对象技术编写并发程序,从而获得面向对象技术给软件开发带来的种种好处.然而,由于继承异常现象的存在,影响了并发程序设计语言引入继承特性.Ada95语言是支持并发程序设计的面向对象语言之一,但并不支持保护对象的继承.Ada-I语言在Ada95语言的基础上进行扩充,从而支持保护对象的继承,并且避免了继承异常现象的出现.     

Ada并发程序设计

<正> 该书1984年出版,作者系美国贝尔实验室的Narain Gehani。 该书从公认的第一个提供高级通用并发程序设计设施的Ada语言着手,全面地介绍了Ada语言中的并发程序设汁设施,以及如何有效利用这些设施编写并发程序;概述了在其它     

基于并发程序数据竞争故障的变异策略

针对并发程序变异测试中并发变异算子触发数据竞争故障能力较低的问题,提出了基于数据竞争故障的变异策略。从并发变异算子设计的角度给出了面向锁对象的变异策略（LMS）和面向共享变量的变异策略（SMS）,设计了重置同步锁（SLRO）和移出共享变量操作（MSVO）两个并发变异算子。从变异点选取的角度给出了一种同步关系对变异点选取策略（SMPSS）。在12个Java类库并发程序上,应用SLRO和MSVO算子针对SMPSS选取出的变异点植入故障,生成变异体,并使用JPF检测工具,检测生成的变异体引发数据竞争故障的能力。实验结果表明,新设计的SLRO和MSVO变异算子对12个被测程序分别生成了121和122个有效变异体,变异算子的有效性分别为95.28%和99.19%。由此可知,新设计的并发变异算子能有效触发数据竞争故障。     

Ada并发程序设计

<正> 该书1984年出版,作者系美国贝尔实验室的Narain Gehani。该书从公认的第一个提供高级通用并发程序设计设施的Ada语言着手,全面地介绍了Ada语言中的并发程序设计设施,以及如何有效利用这些设施编写并发程序;概述了在其它语言的并发程序设计设施;讨论了并发程序设计中的一些细节问题;书末还附录了Ada顺序程序设计的概要。目前,各种大小的并行计算机及操作系统都已相继问世并投入实际使用。并行处理将是今后几年计算机工程和应用的发展方向之一,也是新一代计算机的核心技术之一。但是如果缺乏高度并行的程序设计语言和方法,将会给广泛的应用带来很大障碍,这已引起计算机各     

CMuJava:一个面向Java程序并发变异体生成系统

并发程序由多个共享存储空间并发执行的流程组成.由于流程之间执行次序的不确定性,使得并发软件系统的测试比较困难.变异测试是一种基于故障的软件测试技术,广泛用于评估测试用例集的充分性和测试技术的有效性.将变异测试应用于并发程序的一个关键问题是,如何高效地生成大量的模拟并发故障的变异体集合.给出了一种并发程序的变异测试框架,...     

M1750 ADA生成的ALI信息剖析

Ali文件是Ada编译工具生成的文本文件。该文对M1750 Ada编译器所生成的Ali文件作了具体的分析,并介绍了用于Ali分析的工具和Ali的应用,旨在供从事Ada编译器研究和Ada语言编码的工作者参考。     

M1750 ADA生成的ALI信息剖析

Ali文件是Ada编译工具生成的文本文件。该文对M1750Ada编译器所生成的Ali文件作了具体的分析,并介绍了用于Ali分析的工具和Ali的应用,旨在供从事Ada编译器研究和Ada语言编码的工作者参考。     

Structure representation for concurrent analysis of product assembly and disassembly

This paper presents a simple and novel structure representation supporting the assembly and disassembly planning of electromechanical products. The proposed Relationship Matrix derived from a directed graph represents both the information of the component connectivity and the layout precedence of functional elements. The feasible assembly and disassembly sequences and the minimum service steps for the malfunction component can be easily derived with the corresponding inference rules. The structure representation and the inference kernel can be readily applied to future concurrent design review for assemblability, serviceability, and recyclability. A prototype software tool is introduced to demonstrate the application of the proposed scheme.     

Structure representation for concurrent analysis of product assembly and disassembly

This paper presents a simple and novel structure representation supporting the assembly and disassembly planning of electromechanical products. The proposed Relationship Matrix derived from a directed graph represents both the information of the component connectivity and the layout precedence of functional elements. The feasible assembly and disassembly sequences and the minimum service steps for the malfunction component can be easily derived with the corresponding inference rules. The structure representation and the inference kernel can be readily applied to future concurrent design review for assemblability, serviceability, and recyclability. A prototype software tool is introduced to demonstrate the application of the proposed scheme.     

A Graphical Tool for Describing the Temporal Evolution of Clusters in Financial Stock Markets

We propose a methodology for clustering financial time series of stocks’ returns, and a graphical set-up to quantify and visualise the evolution of these clusters through time. The proposed graphical representation allows for the application of well known algorithms for solving classical combinatorial graph problems, which can be interpreted as problems relevant to portfolio design and investment strategies. We illustrate this graph representation of the evolution of clusters in time and its use on real data from the Madrid Stock Exchange market.     

GSPM：一个基于管理信息系统的图形系统

介绍了根据软件工程的基本原理和面向对象的程序设计方法,应用可视 化和图形数据一体化技术,开发一个基于管理信息系统的图形系统GSPM(Graphics System for Pipeline Based on Management Information System)的理论和方法,讨论了系统的框架设 计、主要类的建立和用户界面的设计。该系统采用Windows 7 Ribbon 界面,操作简单、方 便。绘图时,只需用鼠标点击工具栏或菜单栏对应的按钮,选择正确的图元,就可以绘制各 种图。系统设计了与数据库的接口,可以将图形信息和基于文本的管理信息统一管理与表示, 实现了真正的图形化操作和图形、数据一体化。系统还集成了网络功能,能够利用企业网和 互联网协同工作。     

A Methodology And Tool Set For Supporting The Development Of Graphical User Interfaces

A methodology and tool set for building application (assumed to be inherently non-graphical) software with graphical user interface is described. Initially, pure application software is built from a set of basic building blocks; subsequently, graphical representations for application objects are defined without direct coding and then the graphical user interface is generated automatically. This paper concentrates on the graphical representation aspects of the user interface. Portability, configurability and sound software engineering principles are major considerations in the design of the overall system architecture. The prototype implementation is based on VDM (Vienna Development Method), Object-based Design, GKS (Graphical Kernel System) and the programming language ADA. An example from CIM (Computer Integrated Manufacturing) is used to illustrate the methodology presented here.     

基于图文法的动态软件体系结构支撑环境

使用类型化的属性图及其图文法来直观而形式地刻画软件体系结构和体系结构风格,用图转换来刻画动态体系结构的重配置行为.基于这种刻画,构建了一个动态软件体系结构支撑环境.该环境一方面,通过一个基于图文法的编辑器来支持体系结构图模型的可视化构造和操纵;另一方面,基于内置运行时体系结构技术实现了体系结构图模型在具体系统中的物理实施,并使得图模型上的图转换操作可以自动映射到实际系统的动态重配置上.再加上一系列的辅助设施,形成了一个较为完整的基于图文法的动态软件体系结构支撑环境.     

Mapping visual to textual knowledge representation

In this paper, graphical representations for knowledge structures in the design method DESIRE for component-based design of knowledge and multi-agent systems are presented, together with a graphical editor based on the Constraint Graph environment. Moreover, a translator is described which translates these graphical representations to textual representations in DESIRE. The strength of the combined environment is a powerful—yet easy-to-use—framework to support the development of knowledge-based and multi-agent systems. Finally, a mapping is presented from DESIRE to Conceptual Graphs. This provides a unifying perspective on the knowledge representation format of DESIRE and allows the use of conceptual graph tools to specify and maintain the knowledge representation part of a DESIRE specification.     

Design and implementation of a fine-grained software inspection tool

Although software inspection has led to improvements in software quality, many software systems continue to be deployed with unacceptable numbers of errors, even when software inspection is part of the development process. The difficulty of manually verifying that the software under inspection conforms to the rules is partly to blame. We describe the design and implementation of a tool designed to help alleviate this problem. The tool provides mechanisms for fine-grained inspection of software by exposing the results of sophisticated whole-program static analysis to the inspector. The tool computes many static-semantic representations of the program, including an accurate call graph and dependence graph. A whole-program pointer analysis is used to make sure that the representation is precise with respect to aliases induced by pointer usage. Views on the dependence graph and related representations are supported. Queries on the dependence graph allow an inspector to answer detailed questions about the semantics of the program. Facilities for openness and extensibility permit the tool to be integrated with many software development processes. The main challenge of the approach is to provide facilities to navigate and manage the enormous complexity of the dependence graph.