共查询到20条相似文献,搜索用时 15 毫秒
1.
Bentley James Oakes Javier Troya Levi Lúcio Manuel Wimmer 《Software and Systems Modeling》2018,17(3):815-849
The Atlas Transformation Language (ATL) is currently one of the most used model transformation languages and has become a de facto standard in model-driven engineering for implementing model transformations. At the same time, it is understood by the community that enhancing methods for exhaustively verifying such transformations allows for a more widespread adoption of model-driven engineering in industry. A variety of proposals for the verification of ATL transformations have arisen in the past few years. However, the majority of these techniques are either based on non-exhaustive testing or on proof methods that require human assistance and/or are not complete. In this paper, we describe our method for statically verifying the declarative subset of ATL model transformations. This verification is performed by translating the transformation (including features like filters, OCL expressions, and lazy rules) into our model transformation language DSLTrans. As we handle only the declarative portion of ATL, and DSLTrans is Turing-incomplete, this reduction in expressivity allows us to use a symbolic-execution approach to generate representations of all possible input models to the transformation. We then verify pre-/post-condition contracts on these representations, which in turn verifies the transformation itself. The technique we present in this paper is exhaustive for the subset of declarative ATL model transformations. This means that if the prover indicates a contract holds on a transformation, then the contract’s pre-/post-condition pair will be true for any input model for that transformation. We demonstrate and explore the applicability of our technique by studying several relatively large and complex ATL model transformations, including a model transformation developed in collaboration with our industrial partner. As well, we present our ‘slicing’ technique. This technique selects only those rules in the DSLTrans transformation needed for contract proof, thereby reducing proving time. 相似文献
2.
Serena Villata Guido Boella Dov M. Gabbay Leendert van der Torre Joris Hulstijn 《Annals of Mathematics and Artificial Intelligence》2012,66(1-4):199-230
In this paper, we propose a logic of argumentation for the specification and verification (LA4SV) of requirements on Dung??s abstract argumentation frameworks. We distinguish three kinds of decision problems for argumentation verification, called extension verification, framework verification, and specification verification respectively. For example, given a political requirement like ??if the argument to increase taxes is accepted, then the argument to increase services must be accepted too,?? we can either verify an extension of acceptable arguments, or all extensions of an argumentation framework, or all extensions of all argumentation frameworks satisfying a framework specification. We introduce the logic of argumentation verification to specify such requirements, and we represent the three verification problems of argumentation as model checking and theorem proving properties of the logic. Moreover, we recast the logic of argumentation verification in a modal framework, in order to express multiple extensions, and properties like transitivity and reflexivity of the attack relation. Finally, we introduce a logic of meta-argumentation where abstract argumentation is used to reason about abstract argumentation itself. We define the logic of meta-argumentation using the fibring methodology in such a way to represent attack relations not only among arguments but also among attacks. We show how to use this logic to verify the requirements of argumentation frameworks where higher-order attacks are allowed [A preliminary version of the logic of argumentation compliance was called the logic of abstract argumentation?(2005).] 相似文献
3.
通过对Win32SDK程序中入口函数(WinMain)、初始化函数和窗口函数的分析,阐述了Windows应用程序的运行机理。在此基础上,进一步说明了MFC应用程序如何实现Windows应用程序运行的过程。另外也详细解析了MFC应用程序动态创建对象机制。 相似文献
4.
This paper deals with deductive databases in linear logic. The semantics of queries, views, constraints, and (view) updates
are defineddeclaratively in linear logic. In constrast to classical logic, we can formalise non-shared view, transition constraints, and (view) updates
easily. Various proof search strategies are presented along with an algorithm for query evaluation from a bottom-up direction.
An additional advantage is that the associated meaning of a given relation can be defined in terms of the validity of a legal
update in a given relation. We also defined formally the update principles and showed the correctness of the update translation
algorithms. In this approach, we provide virtual view updates along with real view updates, and view DELETIONs are special
cases of view REPLACEMENTs. This permits three transactional view update operations (INSERTION, DELETION, REPLACEMENT) in
comparison to only (INSERTION, DELETION) in most existing systems.
Dong-Tsan Lee, Ph.D.: He is a computer scientist in the Department of Computer Science at University of Western Australia, Perth, Western Australia,
Australia. He received the B.S. and M.S. degrees from the Department of Computer Science at National Chiao-Tung University,
Taiwan, in 1983 and 1985, respectively, and earned the Ph.D. degree from the Department of Computer Science at University
of Western Australia. His research interests include database and artificial intelligence, linear logic, and real-time software
engineering.
Chin-Ping Tsang, Ph.D.: He is currently an associate professor in the Department of Computer Science at University of Western Australia, Perth,
Western Australia, Australia. He received the Ph.D. degree from the University of Western Australia. He was the head of the
Department of Computer Science at the University of Western Australia from 1994 to 1997. His research interests include artificial
intelligence, non-classicial logic and neural nets. 相似文献
5.
6.
Cadar Cristian Nowack Martin 《International Journal on Software Tools for Technology Transfer (STTT)》2021,23(6):867-870
KLEE is a popular dynamic symbolic execution engine, initially designed at Stanford University and now primarily developed and maintained by the Software Reliability Group at Imperial College London. KLEE has a large community spanning both academia and industry, with over 60 contributors on GitHub, over 350 subscribers on its mailing list, and over 80 participants to a recent dedicated workshop. KLEE has been used and extended by groups from many universities and companies in a variety of different areas such as high-coverage test generation, automated debugging, exploit generation, wireless sensor networks, and online gaming, among many others.
相似文献7.
动态符号执行是近年来新兴的一种软件漏洞检测方法,它可以为目标程序的不同执行路径自动生成测试用例,从而获得较高的测试代码覆盖率。然而,程序的执行路径很多,且大部分路径都是漏洞无关的,通常那些包含危险函数调用的路径更有可能通向漏洞。提出一种基于静态分析的有导动态符号执行方法,并实现了一个工具原型SAGDSE。该方法通过静态分析识别目标程序中调用危险函数的指令地址,在动态符号执行过程中遇到这些指令地址时收集危险路径约束,再通过约束求解生成走危险路径的测试用例,这些测试用例将更可能触发程序漏洞。实验结果表明了该方法的有效性。 相似文献
8.
Programs that manipulate dynamic heap objects are difficult to analyze due to issues like aliasing. Lazy initialization algorithm
enables the classical symbolic execution to handle such programs. Despite its successes, there are two unresolved issues:
(1) inefficiency; (2) lack of formal study. For the inefficiency issue, we have proposed two improved algorithms that give
significant analysis time reduction over the original lazy initialization algorithm. In this article, we formalize the lazy
initialization algorithm and the improved algorithms as operational semantics of a core subset of the Java Virtual Machine
(JVM) instructions, and prove that all algorithms are relatively sound and complete with respect to the JVM concrete semantics.
Finally, we conduct a set of extensive experiments that compare the three algorithms and demonstrate the efficiency of the
improved algorithms. 相似文献
9.
Gordon Pace Nicolas Halbwachs Pascal Raymond 《International Journal on Software Tools for Technology Transfer (STTT)》2004,5(2-3):158-164
The boundaries of model-checking have been extended through the use of abstraction. These techniques are conservative, in the following sense: when the verification succeeds, the verified property is guaranteed to hold; but when it fails, it may result either from the non satisfaction of the property, or from a too rough abstraction. In case of failure, it is, in general, undecidable whether an abstract trace corresponding to a counter-example has any concrete counterparts. For debugging purposes, one usually desires to go further than giving a “yes/no” answer (actually, a “yes/don’t know” answer!), and look for such concrete counter-examples. We propose a solution in which we apply standard test-pattern generation technology to search for concrete instances of abstract traces. 相似文献
10.
This paper presents a memory model with nonoverlapping memory areas (regions) for the deductive verification of C programs. This memory model uses a core language that supports arbitrary nesting of structures, unions, and arrays into other structures and allows reducing the number of user-provided annotations as a result of region analysis. This paper also describes semantics of the core language and normalizing transformations for translating an input annotated C program into a program in the core language. In addition, an encoding is proposed for modeling the memory state of a core-language program with logical formulas as described by the model semantics of the core language. For the model semantics, the soundness and completeness theorems are proved. Additional constraints on the typing context of the core-language terms are described that determine the result of the region analysis enabling the complete modeling of a limited class of programs without using additional annotations. A proof sketch for the theorem stating completeness of the proposed region analysis for a limited class of programs is presented. 相似文献
11.
12.
Anil Kumar KARNA Jinbo DU Haihao SHEN Hao ZHONG Jiong GONG Haibo YU Xiangning MA Jianjun ZHAO 《Frontiers of Computer Science》2018,12(1):86-100
Symbolic execution is widely used in many code analysis, testing, and verification tools. As symbolic execution exhaustively explores all feasible paths, it is quite time consuming. To handle the problem, researchers have paralleled existing symbolic execution tools (e.g., KLEE). In particular, Cloud9 is a widely used paralleled symbolic execution tool, and researchers have used the tool to analyze real code. However, researchers criticize that tools such as Cloud9 still cannot analyze large scale code. In this paper, we conduct a field study on Cloud9, in which we use KLEE and Cloud9 to analyze benchmarks in C. Our results confirm the criticism. Based on the results, we identify three bottlenecks that hinder the performance of Cloud9: the communication time gap, the job transfer policy, and the cache management of the solved constraints. To handle these problems, we tune the communication time gap with better parameters, modify the job transfer policy, and implement an approach for cache management of solved constraints. We conduct two evaluations on our benchmarks and a real application to understand our improvements. Our results show that our tuned Cloud9 reduces the execution time significantly, both on our benchmarks and the real application. Furthermore, our evaluation results show that our tuning techniques improve the effectiveness on all the devices, and the improvement can be achieved upto five times, depending upon a tuning value of our approach and the behaviour of program under test. 相似文献
13.
14.
We present MODL, a Dynamic Logic and a deductive verification calculus for a core Java-like language that includes multi-threading. The calculus is based on symbolic execution. Even though we currently do not handle non-atomic loops, employing the technique of symmetry reduction allows us to verify systems without limits on state space or thread number. We have instantiated our logic for (restricted) multi-threaded Java programs and implemented the verification calculus within the KeY system. We demonstrate our approach by verifying a central method of the StringBuffer class from the Java standard library in the presence of unbounded concurrency. 相似文献
15.
Maryam Abdul Ghafoor Muhammad Suleman Mahmood Junaid Haroon Siddiqui 《Software Quality Journal》2020,28(2):853-887
Stored procedures in database management systems are often used to implement complex business logic. Correctness of these procedures is critical for flawless working of the system. However, testing them remains difficult due to many possible database states and constraints on data. This leads to mostly manual testing. Newer tools offer automated execution for unit testing of stored procedures but the test cases are still written manually. We propose an approach of using dynamic symbolic execution for generating automated test cases and corresponding database states for stored procedures. We model the constraints on data imposed by the schema and the SQL statements, treating values in database tables as symbolic. We use SMT solver to find values that will drive the stored procedure on a particular execution path. We instrument the internal execution plans generated by PostgreSQL to extract constraints. We use Z3 to generate test cases consisting of table data and procedure inputs. Our evaluation using stored procedures from a large business application and various GitHub repositories quantifies the evidence of effectiveness of our technique by generating test cases that lead to schema constraint violations and user-defined exceptions. 相似文献
16.
Wolfgang Thomas 《Journal of Computer and System Sciences》1982,25(3):360-376
Regular events have been classified by star-height, star-free events by the “dot-depth hierarchy,” and events of dot-depth one by the so-called β-hierarchy. It is shown here that the latter two hierarchies have appealing characterizations in symbolic logic: Referring to a first-order language L in which star-free events are described, an event is shown to be of dot-depth n iff it is defined by a Boolean combination of L-sentences in prenex normal form with a Σn-prefix. The β-hierarchy is characterized by the quantifier-rank of L-sentences with Σ1-prefix. A similar characterization of star-height would require the inclusion of weak monadic second-order quantifiers; it is shown that the natural classification of events depending on these quantifiers will not yield on infinite hierarchy. 相似文献
17.
The problem of integrating symbolic and perceptual information becomes more difficult in a fully immersive virtual reality, in which the computer must draw and render the whole visible apparatus in real time. The authors believe that virtual environments should convey the widest possible range of perceptual and symbolic information. They discuss virtual reality as a user interface. To explore the possibilities they create two virtual athletic venues 相似文献
18.
Zheng Cheng Massimo Tisi 《International Journal on Software Tools for Technology Transfer (STTT)》2018,20(6):645-663
Model-driven engineering (MDE) is increasingly accepted in industry as an effective approach for managing the full life cycle of software development. In MDE, software models are manipulated, evolved and translated by model transformations (MT), up to code generation. Automatic deductive verification techniques have been proposed to guarantee that transformations satisfy correctness requirements (encoded as transformation contracts). However, to be transferable to industry, these techniques need to be scalable and provide the user with easily accessible feedback. In MT-specific languages like ATL, we are able to infer static trace information (i.e., mappings among types of generated elements and rules that potentially generate these types). In this paper, we show that this information can be used to decompose the MT contract and, for each sub-contract, slice the MT to the only rules that may be responsible for fulfilling it. Based on this contribution, we design a fault localization approach for MT, and a technique to significantly enhance scalability when verifying large MTs against a large number of contracts. We implement both these algorithms as extensions of the VeriATL verification system, and we show by experimentation that they increase its industry readiness. 相似文献
19.
20.
代码混淆可有效对抗逆向工程等各类MATE攻击威胁,作为攻击缓和性质的内生安全技术发展较为成熟,对代码混淆效果的合理度量具有重要价值。代码混淆度量研究相对较少,针对代码混淆弹性的度量方法与泛化性、实用性度量方法相对缺乏。符号执行技术广泛应用于反混淆攻击,其生成遍历程序完整路径输入测试集的难度可为混淆弹性度量提供参考,然而基于程序嵌套结构的对抗技术可显著降低符号执行效率,增加其混淆弹性参考误差。针对上述问题,提出结合符号执行技术和N-scope复杂度的代码混淆度量方法,该方法首先基于程序符号执行时间定义程序混淆弹性;其次提出适配符号执行的N-scope复杂度,定义程序混淆强度同时增强符号执行对多层嵌套结构程序的混淆弹性度量鲁棒性;进而提出结合动态分析与静态分析的混淆效果关联性分析,通过对程序进行符号执行与控制流图提取量化混淆效果。面向C程序构建了该度量方法的一种实现框架并验证,实验对3个公开程序集及其混淆后程序集约4 000个程序进行混淆效果度量,度量结果表明,提出的度量方法在较好地刻画混淆效果的同时拥有一定的泛化能力与实用价值;模拟真实混淆应用场景给出了该度量方法的使用样例,为混淆技术使... 相似文献