检索结果-南通市图书馆

第十一届中国通信学会学术年会

作者： Fu xiufeng Ai Yunfeng Institute 706 Second of China Aerospace Science and Industry Corporation College of Engineering & Information Technology University of Chinese Academy of Sciences

In recent years, the complexity of designing real-time embedded systems continues to increase with their growing automation. concurrent programming methods have been widely used in designing. However, due to real-time embedded system interrupts and threads overlap, there is always a lack of effective program testing tools. Therefore we design a testing tool for real-time embedded systems dynamic concurrent programs, in which we use Labeled Transition Systems as a system model of concurrent programs, give formal definition for common concurrency errors, and use partial order reduction algorithm to reduce the state space of programs. Finally we realize the testing tool which can detect multi-threaded and multi-interrupt concurrent program errors.

关键词： concurrent program Multiple Interrupts Multithread Concurrency Errors

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A formal semantics for debugging synchronous message passing-based concurrent programs

引用

Science China(Information Sciences) 2014年第12期57卷 198-215页

作者： LI He LUO Jie LI Wei State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang University

In this paper,we propose a semantic framework to debug synchronous message passing-based concurrent programs,which are increasingly useful as parallel computing and distributed systems become more and more *** first design a concurrent programming language model to uniformly represent existing concurrent programming *** to sequential programming languages,this model contains communication statements,i.e.,sending and receiving statements,and a concurrent structure to represent communication and *** then propose a debugging process consisting of a tracing and a locating *** tracing procedure re-executes a program with a failed test case and uses specially designed data structures to collect useful execution information for locating *** provide for the tracing procedure a structural operational semantics to represent synchronous communication and *** locating procedure backward locates the ill-designed statement by using information obtained in the tracing procedure,generates a fix equation,and tries to fix the bug by solving the fix *** also propose a structural operational semantics for the locating *** supply two examples to test our proposed operational semantics.

关键词： debugging synchronous message passing concurrent program operational semantics

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

SYN-Sequence Selection Strategy for Testing concurrent programs Based on Little Strong Happened-Before

引用

Wuhan University Journal of Natural Sciences 2009年第4期14卷 317-320页

作者： PU Fangli,LU Yansheng College of Computer Science and Technology,Huazhong University of Science and Technology,Wuhan 430074,Hubei,China College of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

This paper defines a new relation--little strong happened-before（LSHB） and presents the algorithm for LSHB. Compared with strong happened-before （SHB） and weak happened- before （WHB）, LSHB supports keeping-read-result and ensures definite sufficiency of testing. Equivalence partitioning the set of SYN-sequences based on LSHB can efficiently reduce the number of testing SYN-sequences. The case studies prove that LSHB has high practicability.

关键词： happened-before SYN-sequence concurrent program software testing

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Comparative Study on Test Case Generation of concurrent programs

引用

World Journal of Engineering and Technology 2016年第2期4卷 273-280页

作者： Bidush Kumar Sahoo Mitrabinda Ray Department of Computer Science and Engineering I.T.E.R. Siksha “O” Anusandhan University Bhubaneshwar India

This paper deals with a comparative study on testing of concurrent programs based on different techniques. The various challenges in testing concurrent programming are: defining test coverage criteria based on control flow, generating control flow graph of nondeterministic programs, investigating the applicability of sequential testing criteria to parallel program testing etc. For solving these issues, some existing techniques are discussed in this study. Various researchers use an intermediate graph called Event Inter Actions Graph (EIAG) to solve the problem of generating the control flow graph of nondeterministic programs. Some researches propose an intermediate graph called Interaction Sequence Testing Criteria (ISTC) approach based on sequence of interactions to solve the problem of test coverage criteria based on control and data flow. Another method to solve the problem of generating test coverage based on control flow graph of nondeterministic programs is constraint based approach. It needs constrained elements to generate test case which includes structural element and constraint. The selection of good test cases has been addressed by test data generation technique. The technique of concurrent path analysis approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It reduces the number of combined concurrent test paths. The sequential test paths are combined to form concurrent test path. The Integration and System Test Automation (ISTA) approach is used to solve the problem of applicability of sequential testing criteria to parallel program testing. It is used for automated test case generation and execution by using high-level Petri net is a finite state test model.

关键词： concurrent program EIAG Dead Statement Control Flow Graph Nondeterministic program

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Ada concurrent complexity metrics based on rendezvous relations

引用

Progress in Natural Science:Materials International 1996年第3期 105-114页

作者：王振宇陈利王志江 Central China Normal University China Department of Computer Science Wuhan 430070 Wuhan 430074 Wuhan Digital Engineering Institute

Concurrency of a multi-task program is presented by its communicating and synchronizing behavior between tasks. In Ada, this behavior is expressed as rendezvous relations between them. Difficulties in understanding a program lie in understanding their rendezvouses and relations between them. Rendezvous successive and nesting relations are introduced. Successive graph and nesting tree are used for modeling these relations. Finally, it is proposed that concurrent complexity CC(P) of an Ada program P is a weighted sum of successive complexity SC(P) and nesting complexity NC(P), and SC(P) is the sum of edge numbers of rendezvous successive graphs and NC(P) is the sum of weighted node numbers on rendezvous nesting trees constructed from rendezvous relations which can be identified statically in Ada program text.

关键词： Ada program complexity concurrent program rendezvous successive relation nesting rela-tion.

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

An Empirical Study of Data Race Detector Tools

An Empirical Study of Data Race Detector Tools

引用

第25届中国控制与决策会议

作者： Jalal S Alowibdi Leon Stenneth Department of Computer Science University of Illinois at Chicago Faculty of Computing and Information Technology King Abdulaziz University

ISBN: (纸本)9781467355339

The industry of software applications has been increased significantly because of the high demand of using the software applications. This revolution leads on developing many concurrent software systems. Noticeably, some of these concurrent software systems have falsely report data race condition to one or more of their shared variables. Debugging such concurrent software systems to find the race condition is a challenge, especially for large and complex software systems. Since the race condition concerned mostly ignored in the concurrent software systems, adopting it could help to ensure the efficiency of these software systems. There are few detector tools that have been known in the industry focusing on data race detectors. This paper aims to study those tools. We are going to conduct empirical study of data race using well known tools in order to measure the correctness, performances and effectiveness of those tools in practical by using some benchmarks. Those benchmarks will be tested on each tool and compare it with others to see the similarity and differentiate.

关键词： Data race Performance Correctness concurrent program

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：