检索结果-南通市图书馆

An empirical study on constraint optimization techniques for test generation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第1期60卷 69-83页

作者： Zhiyi ZHANG Zhenyu CHEN Ruizhi GAO Eric WONG Baowen XU State Key Laboratory for Novel Software Technology Nanjing University Department of Computer Science University of Texas at Dallas

constraint solving is a frequent, but expensive operation with symbolic execution to generate tests for a program. To improve the efficiency of test generation using constraint solving, four optimization techniques are usually applied to existing constraint solvers, which are constraint independence, constraint set simplification, constraint caching, and expression rewriting. In this paper, we conducted an empirical study, using these four constraint optimization techniques in a well known test generation tool KLEE with 77 GNU Coreutils applications, to systematically investigate how these optimization techniques affect the efficiency of test generation. The experimental results show that these constraint optimization techniques as well as their combinations cannot improve the efficiency of test generation significantly for ALL-SIZED programs. Moreover, we studied the constraint optimization techniques with respect to two static metrics, lines of code(LOC) and cyclomatic complexity(CC), of programs. The experimental results show that the "constraint set simplification" technique can improve the efficiency of test generation significantly for the programs with high LOC and CC values. The"constraint caching" optimization technique can improve the efficiency of test generation significantly for the programs with low LOC and CC values. Finally, we propose four hybrid optimization strategies and practical guidelines based on different static metrics.

关键词： test generation symbolic execution constraint solving constraint optimization static metric

constraint—Based Partial Evaluation for Imperative Languages

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2002年第1期17卷 64-72页

作者：金英金成植 CollegeofComputerScienceandTechnology JilinUniversityChangchun130012P.R.China

constraint-based partial evaluation (CBPE) is a program optimization technique based on partial evaluation (PE) and constraint solving. Conventional PE only utilizes given parameter values to specialize programs. However, CBPE makes use of not only given values but also the following information: (a) the relationship between input parameters and program variables; (b) logical structure of a program to be evaluated. In this paper, a formal description of CBPE method for imperative languages is presented, and some related problems are discussed.

关键词： partial evaluation constraint solving imperative language residualprogram

Defeating constraint based program analysis with temporal correlation function

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 2013年第3期19卷 332-337页

作者：安靖 Fan Wenqing Yang Yixian Information Security Center Beijing University of Posts and Telecommunications College of Software Engineering Communication University of China

constraint based program analysis is widely used in program validation, program vulnerability analysis, etc. This paper proposes a temporal correlation function to protect programs from analysis. The temporal correlation function can be applied to resist against both static and dynamic function summary and eoncolie testing. What＇ s more, the temporal correlation function can produce different outputs even with same input. This feature can be used to damage the premise of function summary as well as prevent concolie testing process to run the new branch with new input. Experiment results show that this method can reduce efficiency and path coverage of concolic testing, while greatly in- creasing the difficulty of constraint based program analysis.

关键词： program analysis symbolic execution satisfiability problem constraint solving

维普期刊数据库

A Survey of the Rule Language RL/1

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 1993年第1期8卷 92-98页

作者：黄智生 Department of Mathematics and Computer Science University of Amsterdam Plantage Muidergracht 241018 TV Amsterdam

In this paper we introduced the RL project which aims to integrate logic progrmming,relational databases and constraint solving in a single relational *** gave a summary of the architecture of the RL/1 system and shortly discussed the characteristics of the RL/1 language.A target of the project has become to turn the RL/1 system into an industrial strength database interface.

关键词： Logic programming relational database constraint solving

维普期刊数据库