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

control flow analysis for BioAmbients

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第3期180卷 65-79页

作者： Nielson, Flemming Nielson, Hanne Riis Priami, Corrado Rosa, Debora Tech Univ Denmark Kongens Lyngby Denmark Univ Trento Trento Italy

This paper presents a static analysis for investigating properties of biological systems specified in BioAmbients. We exploit the control flow analysis to decode the bindings of variables induced by communications and to build a relation of the ambients that can interact with each other. We eventually apply our analysis to an example of gene regulation by positive feedback taken from the literature.

关键词： control flow analysis BioAmbients gene regulation

来源：评论

学校读者我要写书评

暂无评论

control flow analysis for Brane Calculi

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2009年第C期227卷 59-75页

作者： Bodei, Chiara Bracciali, Andrea Chiarugi, Davide Univ Pisa Dipartimento Informat I-56127 Pisa Italy Univ Siena Dipartimento Sci Matemat Informat I-53100 Siena Italy

We introduce a control flow analysis for Brane Calculi. This verification technique allows properties regarding the behaviour of biological systems to be checked. This is an approximate technique that focusses on the static specification of a system, rather than on its dynamics, striving for effectiveness. Examples illustrate the approach.

关键词： Brane calculi control flow analysis systems biology

来源：评论

学校读者我要写书评

暂无评论

ANOVUL: Detection of logic vulnerabilities in annotated programs via data and control flow analysis

引用

IET INFORMATION SECURITY 2020年第3期14卷 352-364页

作者： Ghorbanzadeh, Mahmoud Reza Shahriari, Hamid Amirkabir Univ Technol Dept Comp Engn Tehran Iran

Logic vulnerabilities are largely dependent on the expected functions of web applications. Their appearance depends on both application logic and related security policy which may change based on modifications in business requirements. Accordingly, there are no specific and common patterns for logic vulnerabilities moreover, a security policy is required for their detection. In this study, a vulnerability detection method is proposed to detect logic vulnerabilities via analysing the program source code. Security checks enforce some constraints in the application so that the application behaves according to the logic intended by the programmer. The main goal is to find the vulnerabilities caused by bypassing some security checks. In this method, known as annotation-based vulnerability detection approach (ANOVUL), control and data flows are analysed to detect the application logic vulnerabilities. To analyse the flows of the program, access control and authenticity labelling are used. To evaluate ANOVUL, the authors have collected a data set. This comprises of PHP applications with reported logic vulnerabilities that have common vulnerabilities and exposures (CVE) identifiers. Based on the results, a 73% detection rate was achieved in the data set. The proposed method can detect logic vulnerabilities that are not detectable using conventional methods.

关键词： authorisation Internet data flow analysis ANOVUL control flow analysis related security policy vulnerability detection method security checks application logic vulnerabilities common vulnerabilities logic vulnerabilities detection annotation-based vulnerability detection approach

来源：评论

学校读者我要写书评

暂无评论

A control flow analysis for Beta-binders with and without static compartments

引用

THEORETICAL COMPUTER SCIENCE 2009年第33-34期410卷 3110-3127页

作者： Bodei, Chiara Univ Pisa Dipartimento Informat I-56127 Pisa Italy

We introduce a control flow analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-binders calculus and in an extended version of the calculus modelling static compartments. Our analysis of a system is able to describe the essential behaviour of each box, tracking all the possible bindings of variables, all the possible intra- and inter-boxes communications, and, finally, all the possible movements across compartments. The analysis offers a basis for establishing static checks of biological dynamic properties. We apply our analysis to an abstract specification of the interaction between a virus and cells of the immune system and to a model of the cAMP-signaling Pathway in Olfactory Sensory Neurons. (C) 2008 Elsevier B.V. All rights reserved.

关键词： control flow analysis Beta-binders Biological compartments

来源：评论

学校读者我要写书评

暂无评论

Checking security policies through an enhanced control flow analysis

引用

JOURNAL OF COMPUTER SECURITY 2005年第1期13卷 49-85页

作者： Bodei, Chiara Degano, Pierpaolo Priami, Corrado Univ Pisa Dipartimento Informat Via F Buonarroti 2 I-56127 Pisa Italy Univ Trento Dipartimento Informat & Telecomunicaz I-1438050 Povo TN Italy

We introduce a control flow analysis that statically approximates the dynamic behaviour of mobile processes, expressed in (a variant of) the pi-calculus. Our analysis of a system is able to describe the essential behaviour of each sub-system, tracking where and between which sub-processes communications may occur. This means that we can safely approximate the behaviour of a system plugged in a larger and mainly unknown context, without explicitly analysing it. Several possible properties can be investigated using this approximation, among which some related to confidentiality and to access control policies.

关键词： control flow analysis security access control policies enhanced semantics

来源：评论

学校读者我要写书评

暂无评论

Detecting and Preventing Type flaws: a control flow analysis with Tags

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期194卷 3-22页

作者： Bodei, Chiara Degano, Pierpaolo Gao, Han Brodo, Linda Univ Pisa Dipartimento Informat Via Pontecorvo I-56127 Pisa Italy Tech Univ Denmark Informat & Math Modelling DK-2800 Lyngby Denmark Univ Sassari Dipartimento Scienze Linguaggi I-07100 Sassari Italy

A type flaw attack on a security protocol is an attack where an honest principal is cheated on interpreting a field in a message as the one with a type other than the intended one. In this paper, we shall present an extension of the LySa calculus with tags attached to each field, indicating the intended types. We developed a control flow analysis for analysing the extended LySa, which over-approximates all the possible behaviour of a protocol and hence is able to capture any type confusion that may happen during the protocol execution. The control flow analysis has been applied to a number of security protocols, either subject to type flaw attacks or not. The results show that it is able to capture type flaw attacks on those security protocols.

关键词： Security Protocol control flow analysis Type Flaw Attacks

来源：评论

学校读者我要写书评

暂无评论

Relating complexity and precision in control flow analysis

Relating complexity and precision in control flow analysis

引用

12th ACM SIGPLAN International Conference on Functional Programming

作者： Van Horn, David Mairson, Harry G. Brandeis Univ Waltham MA 02254 USA

ISBN: (纸本)9781595938152

We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies related decision problems, quite apart from any algorithms that may implement their solutions. We identify a simple decision problem answered by this analysis and prove that in the 0CFA case, the problem is complete for polynomial time. The proof is based on a nonstandard, symmetric implementation of Boolean logic within multiplicative linear logic (MLL). We also identify a simpler version of 0CFA related to eta-expansion, and prove that it is complete for logarithmic space, using arguments based on computing paths and permutations. For any fixed k > 0, it is known that kCFA (and the analogous decision problem) can be computed in time exponential in the program size. For k = 1, we show that the decision problem is NP-hard, and sketch why this remains true for larger fixed values of k. The proof technique depends on using the approximation of CFA as an essentially nondeterministic computing mechanism, as distinct from the exactness of normalization. When k = n, so that the "depth" of the control flow analysis grows linearly in the program length, we show that the decision problem is complete for exponential time. In addition, we sketch how the analysis presented here may be extended naturally to languages with control operators. All of the insights presented give clear examples of how straightforward observations about linearity, and linear logic, may in turn be used to give a greater understanding of functional programming and program analysis.

关键词： languages theory complexity continuation control flow analysis eta expansion geometry of interaction linear logic normalization proofnet static analysis

来源：评论

学校读者我要写书评

暂无评论

Towards control flow analysis of Declarative Graph Transformations with Symbolic Execution 24

Towards Control Flow Analysis of Declarative Graph Transform...

引用

24th International ACM/IEEE Conference on Model-Driven Engineering Languages and Systems (MODELS)

作者： Ege, Florian Tichy, Matthias Ulm Univ Inst Software Engn & Programming Languages Ulm Germany

ISBN: (纸本)9781665434959

The declarative graph transformation language Henshin transforms instance models represented as graphs by applying a series of basic steps that match and replace structural patterns on parts of models. These simple transformation rules are then combined into control flow constructs similar to those of imperative programming languages to create more complex transformations. However, defects in the structure of control flow or in transformation rules might misschedule the application of operations, resulting in basic steps to be inapplicable or produce incorrect output. Understanding and fixing these bugs is complicated by the fact that pattern matching in rules is non-deterministic. Moreover, some control flow structures employ a nondeterministic choice of alternatives. This makes it challenging for developers to keep track of all the possible execution paths and interactions between them. For conventional programming languages, techniques have been developed to execute a program symbolically. By abstracting over the concrete values of variables in any actual run, generalized knowledge is gained about the possible behavior of the program. This can be useful in understanding problems and fixing bugs. In this paper, we present an approach to symbolically execute graph transformations for a subset of Henshin, using symbolic path constraints based on the cardinalities of graph pattern occurrences in the model.

关键词： model driven software engineering declarative graph transformations control flow analysis symbolic execution

来源：评论

学校读者我要写书评

暂无评论

control flow analysis: a functional languages compilation paradigm 95

Control flow analysis: a functional languages compilation pa...

引用

Proceedings of the 1995 ACM symposium on Applied computing

作者： Manuel Serrano INRIA-Rocquencourt

来源：评论

学校读者我要写书评

暂无评论

Relating complexity and precision in control flow analysis

引用

ACM SIGPLAN NOTICES 2007年第9期42卷 85-96页

作者： Van Horn, David Mairson, Harry G. Brandeis Univ Waltham MA 02254 USA

关键词： languages theory complexity continuation control flow analysis eta expansion geometry of interaction linear logic normalization proofnet static analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：