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

A new algorithm for low-deterministic security

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2015年第3期14卷 263-287页

作者： Giffhorn, Dennis Snelting, Gregor Karlsruhe Inst Technol D-76021 Karlsruhe Germany

We present a new algorithm for checking probabilistic noninterference in concurrent programs. The algorithm, named RLSOD, is based on the Low-Security Observational Determinism criterion. It utilizes program dependence graphs for concurrent programs and is flow-sensitive, context-sensitive, object-sensitive, and optionally time-sensitive. Due to a new definition of low-equivalency for infinite traces, the algorithm avoids restrictions or soundness leaks of previous approaches. A soundness proof is provided. Flow sensitivity turns out to be the key to precision and avoids prohibition of useful nondeterminism. The algorithm has been implemented for full Java byte code with unlimited threads. Precision and scalability have been experimentally validated.

关键词： Software security Noninterference program dependence graph Information flow control

来源：评论

学校读者我要写书评

暂无评论

TPCaps: a framework for code clone detection and localization based on improved CapsNet

引用

APPLIED INTELLIGENCE 2023年第13期53卷 16594-16605页

作者： Li, Yuancheng Yu, Chaohang Cui, Yaqi North China Elect Power Univ Sch Control & Comp Engn 2 Beinong Rd Beijing 102206 Peoples R China

In this paper, we propose TPCaps, a new code clone detection framework for addressing the inefficiency of semantic clone detection and the difficulty in locating code clones. Based on CapsNet with tokens and program dependence graph (PDG), TPCaps can improve the processing rate and the capability for detecting. Firstly, TPCaps determines tokens by dataset partitioning and semantic signature, filtering out the valid code clone. Then, using the tokens mentioned above, it can detect Type-1 and Type-2 clones effectively. In addition, TPcaps generates PDG that is composed of data dependencies and control dependencies extracted from codes. Using PDG as input, the improved capsule network, we called RCapsNet, is able to detect Type-3 and Type-4 clones. Based on the CapsNet, RCapsNet introduces selective search algorithm combines with the Regional Proposal Network (RPN), where CapsNet handles the clone features to achieve detection and classification, and RPN processes the location information and updates trains the candidate frames to obtain a specific clone location. In the experimental section, we evaluate the recall and precision of the model. TPCaps shows its high accuracy compared to other models.

关键词： CapsNet program dependence graph Semantic code clones Tokens

来源：评论

学校读者我要写书评

暂无评论

AUTOMATIC EXTRACTION OF COARSE-GRAINED DATA-FLOW THREADS FROM IMPERATIVE programS

引用

IEEE MICRO 2012年第4期32卷 19-31页

作者： Li, Feng Pop, Antonio Cohen, Albert Ecole Normale Super DI 45 Rue Ulm F-75230 Paris 05 France

THIS ARTICLE PRESENTS A GENERAL ALGORITHM FOR TRANSFORMING SEQUENTIAL IMPERATIVE programS INTO PARALLEL DATA-FLOW programS. THE ALGORITHM OPERATES ON A program dependence graph IN STATIC-SINGLE-ASSIGNMENT FORM, EXTRACTING TASK, PIPELINE, AND DATA PARALLELISM FROM ARBITRARY CONTROL FLOW, AND COARSENING ITS GRANULARITY USING A GENERALIZED FORM OF TYPED FUSION. A PROTOTYPE BASED ON GNU COMPILER COLLECTION (GCC) IS APPLIED TO THE AUTOMATIC PARALLELIZATION OF RECURSIVE C programS.

关键词： automatic parallelization data-flow model Instruction sets loop fusion Parallel processing Pipeline processing program dependence graph Radiation detectors Sequential analysis sequential imperative programs SSA form Synchronization

来源：评论

学校读者我要写书评

暂无评论

An algorithm for computing slices for recursive program

引用

SYSTEMS AND COMPUTERS IN JAPAN 1996年第3期27卷 46-59页

作者： Ueda, R Lian, L Torii, K OSAKA UNIV FAC ENGN SCITOYONAKAOSAKA 560JAPAN NARA WOMENS UNIV DEPT FOOD SCI & NUTRIKOMANARA 630JAPAN

program slicing is a useful technique for debugging, testing and program integration. Intuitively, by the slice of a program P is meant, for a point n and a variable v in P, the set of statements and expressions in P that affect the value of v at n. To determine a slice, there must be a precise analysis of the dependencies among the statements in the program. It is difficult, on the other hand, to analyze the program containing recursions.

关键词： program dependence graph reaching definition set recursion control dependence graph data dependence

来源：评论

学校读者我要写书评

暂无评论

An information-leak analysis system based on program slicing

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2002年第15期44卷 903-910页

作者： Yokomori, R Ohata, F Takata, Y Seki, H Inoue, K Osaka Univ Grad Sch Engn Sci Toyonaka Osaka 5608531 Japan Nara Inst Sci & Technol Grad Sch Informat Sci Nara 6300101 Japan

For programs using secret information such as credit card numbers, preventing information-leaks is important. Denning, for example, has proposed a mechanism to certify that a given program does not violate a security policy. Kuninobu, on the other hand, has proposed a more practical framework for calculating the secrecy level of each output value from the secrecy level set to each input value, but no implementation has been yet explored. In this paper, we propose an implementation method for information-leak analysis, and show a system we have implemented based on program slicing. We have applied this system to a credit card program. Our results show that information-leak analysis before practical use of the program is important. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： program slice information-leak analysis program dependence graph procedural language

来源：评论

学校读者我要写书评

暂无评论

Flow analysis of class relationships for object-oriented programs

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2000年第4期16卷 619-647页

作者： Chen, JL Wang, FJ Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 300 Taiwan

program analysis techniques have been widely applied in various fields of software engineering, such as debugging, testing, and proof of simple correctness properties. In object-oriented (OO) programs, inheritance, association, and aggregation relationships may introduce complicated dependencies concealed within classes that might obstruct program analysis. This paper proposes a class relationship flow models to provide analysis for inheritance, association, and aggregation of class relationships. The flow model consists of three flows, inheritance, association, and aggregation flows, corresponding to these relationships. A sequence of class relationships is represented as a flow path from one class to another. Along a flow path, each member within a class is associated with an operation, define or use, to represent whether its status is changed or referenced. Thereby, the concealed dependencies introduced by class relationships can be analyzed according to the flow operations. The analysis might be used as a technique for program understanding, anomaly detection, and program testing.

关键词： program analysis class relationship object-oriented software engineering program dependence graph

来源：评论

学校读者我要写书评

暂无评论

Computing dynamic slices of concurrent object-oriented programs

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2005年第12期47卷 805-817页

作者： Mohapatra, DP Mall, R Kumar, R Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India

We propose a novel dynamic program slicing technique for concurrent object-oriented programs. Our technique uses a Concurrent System dependence graph (CSDG) as the intermediate program representation. We mark and unmark the edges in the CSDG appropriately as and when the dependencies arise and cease during run-time. We mark an edge when its associated dependence exists and unmark an edge when the dependence ceases to exist. Our approach eliminates the use of trace files. Another advantage of our approach is that when a request for a slice is made, it is already available. This appreciably reduces the response time of slicing commands. C (c) 2005 Elsevier B.V. All rights reserved.

关键词： program slicing static slicing dynamic slicing program dependence graph debugging concurrent object-oriented programs threads

来源：评论

学校读者我要写书评

暂无评论

dependence Analysis Based on Dynamic Slicing for Debugging

引用

Wuhan University Journal of Natural Sciences 2001年第Z1期6卷 398-404页

作者： Chen Zhen qiang 1, Xu Bao wen 1,2 1 Department of Computer Science & Engineering, Southeast University, Nanjing 210096, China 2 State Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, China Department of Computer Science & Engineering Southeast University Nanjing 210096 China

Dynamic program slicing is an effective technique for narrowing the errors to the relevant parts of a program when debugging. Given a slicing criterion, the dynamic slice contains only those statements that actually affect the variables in the slicing criterion. This paper proposes a dynamic slicing method based on static dependence analysis. It uses the program dependence graph and other static information to reduce the information needed to be traced during program execution. Thus, the efficiency is dramatically improved while the precision is not depressed. The slicing criterion is modified to fit for debugging. It consists of file name and the line number at which the statement is.

关键词： program slice slicing criterion program dependence graph

来源：评论

学校读者我要写书评

暂无评论

Loop-invariant Optimization in the Pifagor Language

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2018年第7期52卷 843-849页

作者： Vasilev, V. S. Legalov, A. I. Siberian Fed Univ Inst Space & Informat Technol Krasnoyarsk 660074 Russia

The paper considers methods of program transformation equivalent to optimizing the cycle invariant, applied to the functional data-flow model implemented in the Pifagor programming language. Optimization of the cycle invariant in imperative programming languages is reduced to a displacement from the cycle of computations that do not depend on variables that are changes in the loop. A feature of the functional data flow parallel programming language Pifagor is the absence of explicitly specified cyclic computations (the loop operator). However, recurring calculations in this language can be specified recursively or by applying specific language constructs (parallel lists). Both mechanisms provide the possibility of parallel execution. In the case of optimizing a recursive function, repeated calculations are carried out into an auxiliary function, the main function performing only the calculation of the invariant. When optimizing the invariant in computations over parallel lists, the calculation of the invariant moves from the function that executes over the list items to the function containing the call. The paper provides a definition of invariant applied to the Pifagor language, algorithms for its optimization, and examples of program source codes, their graph representations (the program dependence graph) before and after optimization. The algorithm shown for computations over parallel lists is applicable only to the Pifagor language, because it rests upon specific data structures and the computational model of this language. However, the algorithm for transforming recursive functions may be applied to other programming languages.

关键词： data driven functional parallel programming Pifagor programming language code optimization loop optimization invariant optimization program dependence graph

来源：评论

学校读者我要写书评

暂无评论

dependence-Driven Delimited CPS Transformation for JavaScript 2016

Dependence-Driven Delimited CPS Transformation for JavaScrip...

引用

15th ACM International Conference on Generative programming - Concepts and Experiences (GPCE)

作者： Philips, Laure De Koster, Joeri De Meuter, Wolfgang De Roover, Coen Vrije Univ Brussel Software Languages Lab Brussels Belgium

ISBN: (纸本)9781450344463

In today's web applications asynchronous requests to remote services using callbacks or futures are omnipresent. The continuation of such a non-blocking task is represented as a callback function that will later be called with the result of the request. This style of programming where the remainder of a computation is captured in a continuation function is called continuation-passing style (CPS). This style of programming can quickly lead to a phenomenon called "callback hell", which has a negative impact on the maintainability of applications that employ this style. Several alternatives to callbacks are therefore gaining traction within the web domain. For example, there are a number of frameworks that rely on automatically transforming sequential style code into the continuation-passing style. However, these frameworks often employ a conservative approach in which each function call is transformed into CPS. This conservative approach can sequentialise requests that could otherwise be run in parallel. So-called delimited continuations can remedy, but require special marks that have to be manually inserted in the code for marking the beginning and end of the continuation. In this paper we propose an alternative strategy in which we apply a delimited CPS transformation that operates on a program dependence graph instead to find the limits of each continuation. We implement this strategy in JavaScript and demonstrate its applicability to various web programming scenarios.

关键词： CPS transformation program dependence graph JavaScript

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：