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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
43 篇 期刊文献
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

114 篇 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 篇 dependence analy...

机构

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

语言

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

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

共 114 条记录，以下是51-60 订阅

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

详细简洁

排序：

Clustering Recurrent and Semantically Cohesive program Statements in Introductory programming Assignments 19

Clustering Recurrent and Semantically Cohesive Program State...

引用

28th ACM International Conference on Information and Knowledge Management (CIKM)

作者： Marin, Victor J. Rivero, Carlos R. Rochester Inst Technol Rochester NY USA

ISBN: (纸本)9781450369763

Students taking introductory programming courses are typically required to complete assignments and expect timely feedback to advance their learning. With the current popularity of these courses in both traditional and online versions, graders are seeing themselves overwhelmed by the sheer amount of student programs they have to handle, and the quality of the educational experience provided is often compromised for promptness. Thus, there is a need for automated approaches to effectively increase grading productivity. Existing approaches in this context fail to support flexible grading schemes and customization based on the assignment at hand. This paper presents a data-driven approach for clustering recurrent program statements performing similar but not exact semantics across student programs, which we refer to as core statements. We rely on structural graph clustering over the program dependence graph representations of student programs. Such clustering is performed over the graph resulting from the pairwise approximate graph alignments of programs. Core statements help graders understand solution variations at a glance and, since they group program statements present in individual student programs, can be used to propagate feedback, thus increasing grading productivity. Our experimental results show that, on average, we discover core statements covering more than 50% of individual student programs, and that program statements grouped by core statements are semantically cohesive, which ensures effective grading.

关键词： program dependence graph Approximate graph Alignment Structural graph Clustering

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Towards Summarizing program Statements in Source Code Search 20

Towards Summarizing Program Statements in Source Code Search

引用

35th Annual ACM Symposium on Applied Computing (SAC)

作者： Marin, Victor J. Bansal, Iti Rivero, Carlos R. Rochester Inst Technol Rochester NY 14623 USA

ISBN: (纸本)9781450368667

A common practice among programmers is to find pieces of source code using search engines. programs retrieved by these engines are typically semantically but not necessarily syntactically similar. As a result, ranking methods are exploited to present relevant programs to users. However, due to implementation variability, users need to understand such programs. In this paper, we propose a method to group statements into clusters from a set of programs retrieved by a source code search engine. Each cluster comprises a number of program statements that have similar but not exact semantics and are pervasive. Our hypothesis is that such clusters help understand at a glance a set of semantically-related programs. We use approximate graph alignment to find correspondences among statements in two program dependence graphs that are similar with respect to their control and data flows, as well as operations they perform. We then build a graph with pairwise comparisons of program dependence graphs, and cast the problem of clustering statements as finding communities of statements that consistently align. Our evaluation using programs collected by BigCloneBench shows that clusters of statements discovered by our approach help discern implementation variations.

关键词： Source Code Search program dependence graph Approximate graph Alignment Community Detection

来源：评论

学校读者我要写书评

暂无评论

Scalable Detection of Semantic Clones 08

Scalable Detection of Semantic Clones

引用

30th International Conference on Software Engineering

作者： Gabel, Mark Jiang, Lingxiao Su, Zhendong Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

ISBN: (纸本)9781605580791

Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant code, locate bugs, or gain insight into program design. Existing scalable approaches to clone detection are limited to finding program fragments that are similar only in their contiguous syntax. Other, semantics-based approaches are more resilient to differences in syntax, such as reordered statements, related statements interleaved with other unrelated statements, or the use of semantically equivalent control structures. However, none of these techniques have scaled to real world code bases. These approaches capture semantic information from program dependence graphs (PDGs), program representations that encode data and control dependencies between statements and predicates. Our definition of a code clone is also based on this representation: we consider program fragments with isomorphic PDGs to be clones. In this paper, we present the first scalable clone detection algorithm based on this definition of semantic clones. Our insight is the reduction of the difficult graph similarity problem to a simpler tree similarity problem by mapping carefully selected PDG subgraphs to their related structured syntax. We efficiently solve the tree similarity problem to create it scalable analysis. We have implemented this algorithm in a practical tool and performed evaluations on several million-line open source projects, including the Linux kernel. Compared with previous approaches, our tool locates significantly more clones, which are often more semantically interesting than simple copied and pasted code fragments.

关键词： Clone detection program dependence graph software maintenance refactoring

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

New Types of program dependences and Interprocedural Relations in Ada 2012 programs

New Types of Program Dependences and Interprocedural Relatio...

引用

4th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Wang, Bo Goto, Yuichi Cheng, Jingde Saitama Univ Dept Informat & Comp Sci Saitama 3388570 Japan

ISBN: (纸本)9781467350006

System dependence net is a formal model to explicitly represent program dependences and interprocedural relations in a concurrent program with multiple procedures. It is useful for development and maintenance of concurrent programs, such as program slicing, testing, debugging, and complexity measuring. By now, although system dependence nets for Ada 95 and Ada 2005 programs were proposed respectively, they cannot be used for Ada 2012 programs, because Ada 2012 has a lot of changes and extensions from Ada 2005. As the first step to extend the current model of system dependence nets for Ada 2012 programs, it is indispensable to identify all new program dependences and interprocedural relations in Ada 2012 programs. This paper presents some new types of program dependences and interprocedural relations in Ada 2012 programs, and shows their real examples.

关键词： program dependence program dependence graph system dependence net concurrent program Ada 2012 program

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CALI: Compiler-Assisted Library Isolation 21

CALI: Compiler-Assisted Library Isolation

引用

16th ACM ASIA Conference on Computer and Communications Security (ACM ASIACCS)

作者： Bauer, Markus Rossow, Christian CISPA Helmholtz Ctr Informat Secur Saarbrucken Saarland Germany

ISBN: (纸本)9781450382878

Software libraries can freely access the program's entire address space, and also inherit its system-level privileges. This lack of separation regularly leads to security-critical incidents once libraries contain vulnerabilities or turn rogue. We present Cali, a compiler-assisted library isolation system that fully automatically shields a program from a given library. Cali is fully compatible with main-line Linux and does not require supervisor privileges to execute. We compartmentalize libraries into their own process with well-defined security policies. To preserve the functionality of the interactions between program and library, Cali uses a program dependence graph to track data flow between the program and the library during link time. We evaluate our open-source prototype against three popular libraries: Ghostscript, OpenSSL, and SQLite. Cali successfully reduced the amount of memory that is shared between the program and library to 0.08% (ImageMagick) - 0.4% (Socat), while retaining an acceptable program performance.

关键词： Library Isolation Memory Isolation Privilege Separation program dependence graph Compiler LLVM Cali

来源：评论

学校读者我要写书评

暂无评论

Information Flow Analysis via Path Condition Refinement

Information Flow Analysis via Path Condition Refinement

引用

7th International Workshop on Formal Aspects of Security and Trust

作者： Taghdiri, Mana Snelting, Gregor Sinz, Carsten Karlsruher Inst Technol D-76128 Karlsruhe Germany

ISBN: (纸本)9783642197505

We present a new approach to information flow control (WC), which exploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existing IFC analysis in which illegal flows are characterized using program dependence graphs (PDG) and path conditions (as described in [12]). Although path conditions provide an already precise abstraction that can be used to generate witnesses to the illegal flow, they may still cause false alarms. Our CEGAR process recognizes false witnesses by executing them and monitoring their executions, and eliminates them by automatically refining path conditions in an iterative way as needed. The paper sketches the foundations of CEGAR and PDG-based IFC, and describes the approach in detail. An example shows how the approach finds illegal flow, and demonstrates how CEGAR eliminates false alarms.

关键词： Information flow control CEGAR program dependence graph path condition abstraction refinement constraint solving

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：