检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

69 篇 会议
41 篇 期刊文献
2 篇 学位论文

馆藏范围

112 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

104 篇 工学
- 75 篇 计算机科学与技术...
- 61 篇 软件工程
- 26 篇 电气工程
- 7 篇 信息与通信工程
- 7 篇 控制科学与工程
- 3 篇 电子科学与技术（可...
- 2 篇 机械工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 1 篇 网络空间安全
7 篇 管理学
- 5 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
3 篇 理学
- 3 篇 数学

主题

112 篇 program dependen...
22 篇 program slicing
12 篇 dynamic slicing
11 篇 static slicing
9 篇 control flow gra...
6 篇 data dependence
6 篇 program slice
5 篇 program debuggin...
4 篇 refactoring
4 篇 control dependen...
4 篇 software mainten...
4 篇 system dependenc...
3 篇 concurrent progr...
3 篇 noninterference
3 篇 information flow...
3 篇 clone detection
3 篇 path condition
3 篇 abstract syntax ...
3 篇 software securit...
3 篇 automatic parall...

机构

6 篇 indian inst tech...
3 篇 rochester inst t...
2 篇 princeton univ p...
2 篇 univ tokushima g...
2 篇 univ tokushima d...
2 篇 univ karlsruhe t...
2 篇 fernuniversitat ...
2 篇 vrije univ bruss...
2 篇 institute of inf...
1 篇 univ sci & techn...
1 篇 university of sc...
1 篇 linköping univer...
1 篇 osaka univ grad ...
1 篇 amer univ beirut...
1 篇 univ wisconsin d...
1 篇 department of el...
1 篇 telecom paristec...
1 篇 near east univ a...
1 篇 univ sci & techn...
1 篇 zhejiang univ co...

作者

5 篇 mall r
5 篇 snelting gregor
4 篇 marin victor j.
4 篇 de roover coen
4 篇 rivero carlos r.
2 篇 inoue k
2 篇 ben brahim ghass...
2 篇 de koster joeri
2 篇 kurmangaleev sha...
2 篇 shimomura t
2 篇 zhioua zeineb
2 篇 avetisyan arutyu...
2 篇 hajj hazem
2 篇 krinke j
2 篇 chung is
2 篇 adaimy ralph
2 篇 de meuter wolfga...
2 篇 mund gb
2 篇 oh taewook
2 篇 zhang xj

语言

106 篇 英文
5 篇 其他
1 篇 中文

检索条件"主题词=Program Dependence Graph"

共 112 条记录，以下是41-50 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Optimization of Business Processes in Service Oriented Architecture

Optimization of Business Processes in Service Oriented Archi...

引用

16th IEEE International Enterprise Distributed Object Computing Conference (EDOC)

作者： Ratkowski, Andrzej Sacha, Krzysztof Zalewski, Andrzej Warsaw Univ Technol Warsaw Poland

ISBN: (纸本)9780769547862

This paper describes a method for the implementation and optimization of business processes in a service oriented architecture (SOA). A process specification is created by business people, and expressed in Business Process Modeling Notation (BPMN). The specification is then translated into Business Process Execution Language (BPEL), and used by technical people as a reference process, which is subject to a series of transformations that change the internal process structure in order to improve the quality of the process execution. The behavior of each transformed process is verified automatically against the behavior of the reference process. The verification mechanism is based on a mapping from BPEL to Language of Temporal Ordering Specification (LOTOS), followed by a comparison of the trace set that is generated using a program dependence graph of the reference process and the trace set of the transformed one. When the design goals have been reached, the transformed BPEL process can be executed on a target SOA environment using a BPEL engine.

关键词： Business Process BPEL Service Oriented Architecture program dependence graph LOTOS

来源：评论

学校读者我要写书评

暂无评论

Formal Specification and Verification of Security Guidelines 22

Formal Specification and Verification of Security Guidelines

引用

IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

作者： Zhioua, Zeineb Roudier, Yves Ameur, Rabea Boulifa SAP Labs France EURECOM Mougins France Univ Nice Sophia Antipolis I3S CNRS Nice France Telecom ParisTech Paris France

ISBN: (纸本)9781509056521

Ensuring the compliance of developed software with general and application-specific security requirements is a challenging task due to the lack of automatic and formal means to lead this verification. In this paper, we present our approach that aims at integrating the formal specification and verification of security guidelines in early stages of the development lifecycle by combining the model checking together with information flow analysis. We present our framework that is based on an extension of LTS (Labeled Transition Systems) by data dependence information to cover the end-to-end specification and verification of security guidelines.

关键词： Security Guidelines Formal specification Model Checking Information Flow Analysis program dependence graph

来源：评论

学校读者我要写书评

暂无评论

Untangling Composite Commits Using program Slicing 18

Untangling Composite Commits Using Program Slicing

引用

18th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM)

作者： Muylaert, Ward De Roover, Coen Vrije Univ Brussel Software Languages Lab Brussels Belgium

ISBN: (纸本)9781538682906

Composite commits are a common mistake in the use of version control software. A composite commit groups many unrelated tasks, rendering the commit difficult for developers to understand, revert, or integrate and for empirical researchers to analyse. We propose an algorithmic foundation for tool support to identify such composite commits. Our algorithm computes both a program dependence graph and the changes to the abstract syntax tree for the files that have been changed in a commit. Our algorithm then groups these fine-grained changes according to the slices through the dependence graph they belong to. To evaluate our technique, we analyse and refine an established dataset of Java commits, the results of which we also make available. We find that our algorithm can determine whether or not a commit is composite. For the majority of commits, this analysis takes but a few seconds. The parts of a commit that our algorithm identifies do not map directly to the commit's tasks. The parts tend to be smaller, but stay within their respective tasks.

关键词： Changedistiller Changenodes Class dependence graph Commit Inter procedural Intra procedural program dependence graph program slicing Slicing Static analysis System dependence graph Tangled Tinypdg Untangling

来源：评论

学校读者我要写书评

暂无评论

Tracking Dependent Information Flows 3

Tracking Dependent Information Flows

引用

3rd International Conference on Information Systems Security and Privacy (ICISSP) / International Conference on Security and Cryptography (SECRYPT)

作者： Zhioua, Zeineb Roudier, Yves Ameur, Rabea Boulifa Kechiche, Takoua Short, Stuart EURECOM SAP Labs France Mougins France Univ Nice Sophia Antipolis CNRS I3S Biot France Telecom ParisTech Biot France SAP Labs France Mougins France

ISBN: (纸本)9789897582097

Ensuring the compliance of developed software with security requirements is a challenging task due to imprecision on the security guidelines definition, and to the lack of automatic and formal means to lead this verification. In this paper, we present our approach that aims at integrating the formal specification and verification of security guidelines in early stages of the development life cycle by combining the model checking together with information flow analysis. We formally specify security guidelines that involve dependent information flows as a basis to lead formal verification through model checking, and provide precise feedback to the developer.

关键词： Security Guidelines Formal Specification Model Checking Information Flow Analysis program dependence graph Labeled Transition System

来源：评论

学校读者我要写书评

暂无评论

Using computing-all-slices algorithm in measuring functional cohesion

Using computing-all-slices algorithm in measuring functional...

引用

International Conference on Software Engineering

作者： Al Dallal, Jehad Kuwait Univ Dept Informat Sci Safat 13060 Kuwait

ISBN: (纸本)9780889866416

program slicing is the task of finding all statements in a program that directly, or indirectly, influence the value of a variable occurrence. The set of statements that can affect the value of a variable at some point in a program is called a program back-ward slice. In several software engineering applications, such as program debugging and measuring the program cohesion and parallelism, several slices are computed at different program points. Computing-All-Slices algorithm computes all static slices of a program function by traversing the program representation graph once. The program representation graph used in this paper is called program dependence graph (PDG). In this paper, we conduct an experimental comparison study using five software applications to show the effectiveness of the Computing-All-Slices algorithm in computing the functional cohesion of program functions. The effectiveness of the algorithm is measured in terms of the number of traversed PDG edges.

关键词： program slicing static slicing backward slicing program dependence graph cohesion measure

来源：评论

学校读者我要写书评

暂无评论

RELIABILITY ANALYSIS OF TEST CASES FOR program SLICING 1

RELIABILITY ANALYSIS OF TEST CASES FOR PROGRAM SLICING

引用

1st International Conference on Innovation and Challenges in Cyber Security (ICICCS)

作者： Negi, Gaurav Elias, Eldo Kohli, Rashi Bibhu, Vimal Dr APJ AKTU CSE Dept Lucknow Uttar Pradesh India Amity Univ CSE Dept Greater Noida India

ISBN: (纸本)9781509020843

The concept used in the research paper includes program slicing which is referred as the process of computing the chosen set of instructions of the program, The slicing criterion refers to the slice that is likely to affect the values at some point while executing the program. The paper highlights the different test cases and comparative analysis of program slicing methods which corresponds to the applications which are usually utilized in software modification activities i.e. Debugging process, testing analysis and its phases, calculating complexity and program understanding etc. In the approach used in the paper the "slicing" method of the program focus on precise & definedsub-components of a program;which can further be used to produce the instructions needed for the program, relevant to an explicit method of computation. Applying slicing techniques to software's using slicing tools, we can determine which components can be facilitated and reused. The process of designing phase of and the reused patterns are likely to suggest improvement in the respective code.

关键词： Control flow graph Dynamic slicing program dependence graph program slicing Static slicing Test cases

来源：评论

学校读者我要写书评

暂无评论

Slicing, chopping, and path conditions with barriers

Slicing, chopping, and path conditions with barriers

引用

3rd IEEE International Workshop on Source Code Analysis and Manipulation

作者： Krinke, J Fernuniversitat Hagen Germany

One of the critiques on program slicing is that slices presented to the user are hard to understand. This is mainly related to the problem that slicing 'dumps' the results onto the user without any explanation. This work will present an approach that can be used to 'filter' slices. This approach basically introduces 'barriers' which are not allowed to be passed during slice computation. An earlier filtering approach is chopping which is also extended to obey such a barrier. The barrier variants of slicing and chopping provide filtering possibilities for smaller slices and better comprehensibility. The concept of barriers is then applied to path conditions, which provide necessary conditions under which an influence between the source and target criterion exists. Barriers make those conditions more precise.

关键词： program slicing program dependence graph path conditions

来源：评论

学校读者我要写书评

暂无评论

Path-Sensitive Sparse Analysis without Path Conditions 2021

Path-Sensitive Sparse Analysis without Path Conditions

引用

42nd ACM SIGPLAN International Conference on programming Language Design and Implementation (PLDI)

作者： Shi, Qingkai Yao, Peisen Wu, Rongxin Zhang, Charles Hong Kong Univ Sci & Technol Hong Kong Peoples R China Xiamen Univ Xiamen Peoples R China

ISBN: (纸本)9781450383912

Sparse program analysis is fast as it propagates data flow facts via data dependence, skipping unnecessary control flows. However, when path-sensitively checking millions of lines of code, it is still prohibitively expensive because a huge number of path conditions have to be computed and solved via an SMT solver. This paper presents Fusion, a fused approach to inter-procedurally path-sensitive sparse analysis. In Fusion, the SMT solver does not work as a standalone tool on path conditions but directly on the program together with the sparse analysis. Such a fused design allows us to determine the path feasibility without explicitly computing path conditions, not only saving the cost of computing path conditions but also providing an opportunity to enhance the SMT solving algorithm. To the best of our knowledge, Fusion, for the first time, enables whole program bug detection on millions of lines of code in a common personal computer, with the precision of inter-procedural path-sensitivity. Compared to two state-of-the-art tools, Fusion is 10x faster but consumes only 10% of memory on average. Fusion has detected over a hundred bugs in mature open-source software, some of which have even been assigned CVE identifiers due to their security impact.

关键词： Sparse analysis path sensitivity program dependence graph SMT solving

来源：评论

学校读者我要写书评

暂无评论

JavaPDG: A New Platform for program dependence Analysis

JavaPDG: A New Platform for Program Dependence Analysis

引用

6th IEEE International Conference on Software Testing, Verification and Validation (ICST)

作者： Shu, Gang Sun, Boya Henderson, Tim A. D. Podgurski, Andy Case Western Reserve Univ Dept Elect Engn & Comp Sci Cleveland OH 44106 USA

ISBN: (纸本)9780769549682

dependence analysis is a fundamental technique for program understanding and is widely used in software testing and debugging. However, there are a limited number of analysis tools available despite a wide range of research work in this field. In this paper, we present JavaPDG(1), a static analyzer for Java bytecode, which is capable of producing various graphical representations such as the system dependence graph, procedure dependence graph, control flow graph and call graph. As a program-dependence-graph based analyzer, JavaPDG performs both intra- and inter-procedural dependence analysis, and enables researchers to apply a wide range of program analysis techniques that rely on dependence analysis. JavaPDG provides a graphical viewer to browse and analyze the various graphs and a convenient JSON based serialization format.

关键词： program dependence graph system dependence graph procedure dependence graph call graph Java Virtual Machine Java bytecode

来源：评论

学校读者我要写书评

暂无评论

A Novel Speculative Multithreading Parallelization Method in Chip Multiprocessor Systems

A Novel Speculative Multithreading Parallelization Method in...

引用

9th International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES 2010)

作者： Wu, Yue Xu, Lei Yang, Hongbin Shanghai Univ Sch Engn & Comp Sci Shanghai 200041 Peoples R China

ISBN: (纸本)9780769541105

Chip multiprocessors have become mainstream processors in recent years. In this paper, we propose a novel speculative multithreading parallelization method for parallelizing a sequential program into multiple threads. In our method, extended program dependence graph and topological sort are used to analyze code dependency. With the help of dynamic profiling, we exploit thread level parallelism in loops and the remaining code regions by analyzing control and data speculation in general purpose applications. Using an initial automatic compiler implementation and a validated processor model, this paper demonstrates significant gains using speculation for 4-core chip multiprocessor models running a variety of applications.

关键词： speculative multithreading parallelization chip multiprocessor thread level parallelism program dependence graph profiling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共12页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：