basic research in computer science and software engineering at sklcs

The State Key Laboratory of Computer Science (SKLCS) is committed to basic research in computer science and software engineering. The research topics of the laboratory include: concurrency theory, theory and algorithms for real-time systems, formal specifications based on context-free grammars, semantics of programming languages, model checking, automated reasoning, logic programming, software testing, software process improvement, middleware technology, parallel algorithms and parallel software, computer graphics and human-computer interaction. This paper describes these topics in some detail and summarizes some results obtained in recent years.

effect of staffing pattern on software project: an empirical analysis

Univ SE Calif, Ctr Syst & Software Engn, ABB, Microsoft Res, IEEE, ACMSIGSOFT, N Carolina State Univ Comp Sci

the role of software process simulation modeling in software risk management: a systematic review

Univ SE Calif, Ctr Syst & Software Engn, ABB, Microsoft Res, IEEE, ACMSIGSOFT, N Carolina State Univ Comp Sci

a fuzzy-based method for evaluating the trustworthiness of software processes

University of Paderborn; Fraunhofer Inst. Exp. Softw. Eng. (IESE); Chinese Academy of Science (ISCAS)

an efficient method to generate feasible paths for basis path testing

Basis path testing is a very powerful structural testing criterion. The number of test paths equals to the cyclomatic complexity of program defined by McCabe. Traditional test generation methods select the paths either without consideration of the constraints of variables or interactively. In this note, an efficient method is presented to generate a set of feasible basis paths. The experiments show that this method can generate feasible basis paths for real-world C programs automatically in acceptable time.

a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

基于工作流的J2EE遗留系统改造

为了满足用户对软件系统内部业务过程定义的定制需求,针对流行的J2EE平台,以工作流技术为基础设计了对遗留软件系统的改造平台JSPMP。JSPMP利用工作流引擎的过程定义与任务管理能力驱动系统业务流程执行,赋予软件系统在业务过程定义方面的动态可定制性。实践证明,开发者利用此方案能够迅速改造遗留系统,满足用户多样化的过程定制需求,极大地降低了改造、定制成本。

基于ISO9000的软件质量保证模型

IEEE; IEEE Computer Society; IEEE Computer Society Technical Council on Software Engineering