Using Static Analysis to Improve Automatic Test Generation

Bozga, Marius; Fernandez, Jean-Claude; Ghirvu, Lucian

doi:10.1007/3-540-46419-0_17

Cited by 14 publications

(2 citation statements)

References 17 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…forms of abstract interpretation [59,28,60]) can be used to reduce the runtime computational burden of online testing?…”

Section: Post Scriptummentioning

confidence: 99%

Implementing Conformiq Qtronic

Huima¹

2007

Testing of Software and Communicating Systems

View full text Add to dashboard Cite

Abstract. Conformiq Qtronic1 is a commercial tool for model driven testing. It derives tests automatically from behavioral system models. These are black-box tests [1] by nature, which means that they depend on the model and the interfaces of the system under test, but not on the internal structure (e.g. source code) of the implementation.In this essay, which accompanies my invited talk, I survey the nature of Conformiq Qtronic, the main implementation challenges that we have encountered and how we have approached them. Problem StatementConformiq Qtronic is an ongoing attempt to provide an industrially applicable solution to the following technical problem: Create an automatic method that provided an object (a model) M that describes the external behavior of an open system (begin interpreted via well-defined semantics) constructs a strategy to test real-life black-box systems (implementations) I in order to find out if they have the same external behavior as M .(Now the fact that we have created a company with the mission to solve this technical problem hints that we believe it to be a good idea to employ automatic methods of this kind in actual software development processes-which is not a priori self-evident. In this essay, however, I will not touch these commercial and methodological issues, but will concentrate on the technical problem only.)Two notes are due, and the first concerns the test harness. It is namely usually so that the model M describes a system with different interfaces and behavior than the real implementation that is being tested (iut, implementation under test). Virtually always, the model M is somehow described on a higher level of abstraction than the real implementation. As a concrete example, sip (Session Initiation Protocol) [2] is a packet-oriented protocol that is run over a transport (e.g. udp [3]) and that has an ascii encoding: every sip packet is encoded as a series of ascii characters. However, some possible model M for testing an sip implementation could define the logical flow of packets with their main contents but not describe, for instance, their actual encoding. How can this model M be used to test a real sip implementation that requires ascii encoded packets over udp? The answer is that the "abstract" tests generated automatically from 1 www.conformiq.com A.

show abstract

“…forms of abstract interpretation [59,28,60]) can be used to reduce the runtime computational burden of online testing?…”

Section: Post Scriptummentioning

confidence: 99%

Implementing Conformiq Qtronic

Huima¹

2007

Testing of Software and Communicating Systems

View full text Add to dashboard Cite

show abstract

“…For detailed surveys, we refer the interested readers to [4,12,33]. Recently, program slicing has also been applied to state space reduction for formal verification [19] and test generation [5]. The original approach to program slicing was introduced by Weiser [35].…”

Section: Introductionmentioning

confidence: 99%

Abstract Slicing: A New Approach to Program Slicing Based on Abstract Interpretation and Model Checking

Hong

Lee

Sokolsky

Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05)

View full text Add to dashboard Cite

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. This paper is posted at ScholarlyCommons. http://repository.upenn.edu/cis_papers/229 For more information, please contact libraryrepository@pobox.upenn.edu. This paper proposes a new approach to program slicing based on abstract interpretation and model checking. First, the notion of abstract slicing is introduced. Abstract slicing extends static slicing with predicates and constraints by using as the program model an abstract state graph, which is obtained by applying predicate abstraction to a program, rather than a flow graph. This leads to a program slice that is more precise and smaller than its static counterpart. Second, a method for performing abstract slicing is developed. It is shown that abstract slicing can be reduced to a least fixpoint computation over formulas in the branching time temporal logic CTL. This enables one to use symbolic model checkers for CTL as an efficient computation engine for abstract slicing. A prototype implementation and experimental results are reported demonstrating the feasibility of the approach. Comments Copyright 2005 IEEE. Reprinted from Fifth IEEE International Workshop on Source Code Analysis and Manipulation (SCAM'05), pages 25-34This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/229

show abstract