Filters








1,078,513 Hits in 5.7 sec

Automatic test data generation using constraint solving techniques

Arnaud Gotlieb, Bernard Botella, Michel Rueher
1998 Proceedings of ACM SIGSOFT international symposium on Software testing and analysis - ISSTA '98  
Global constraints are used in a prelil ninary step to detect some of the non feasible paths. Pz rtial consistency techniques are employed to reduce the domains of possible values of the test data.  ...  Automatic test data generation leads to identify input values on which a selected point in a procedure is executed.  ...  This research is part of the software testing project DE-VISOR of Dassault Electronique. References [1] AHO, A., SETHI, R., AND ULLMAN, J. Compilers Principles, techniques and tools.  ... 
doi:10.1145/271771.271790 dblp:conf/issta/GotliebBR98 fatcat:rsowyb2jkracfnnz2i5bsmgb54

Automatic test data generation using constraint solving techniques

Arnaud Gotlieb, Bernard Botella, Michel Rueher
1998 Software engineering notes  
Global constraints are used in a prelil ninary step to detect some of the non feasible paths. Pz rtial consistency techniques are employed to reduce the domains of possible values of the test data.  ...  Automatic test data generation leads to identify input values on which a selected point in a procedure is executed.  ...  This research is part of the software testing project DE-VISOR of Dassault Electronique. References [1] AHO, A., SETHI, R., AND ULLMAN, J. Compilers Principles, techniques and tools.  ... 
doi:10.1145/271775.271790 fatcat:p4ksyualjzddricl6qx25jhtxi

Using a constraint satisfaction formulation and solution techniques for random test program generation

E. Bin, R. Emek, G. Shurek, A. Ziv
2002 IBM Systems Journal  
A constraint satisfaction problem consists of a finite set of variables and a set of constraints. Each variable is associated with a set of possible values, known  ...  These include: (1) a mechanism for automatic construction of procedures that achieves consistency over single arcs/constraints; (2) a library of data structures for set representation, used to represent  ...  This class hierarchy is derived from a set of base classes that define a generic projector interface and a generic interface for variables.  ... 
doi:10.1147/sj.413.0386 fatcat:kabz7p7x4jc5rnym3i25drrw2q

Diagnostic Path-Oriented Test Data Generation by Hyper Cuboids

Shahram Moadab, Mohsen Falah Rad
2014 International Journal of Information Engineering and Electronic Business  
In this paper a new approach has been proposed for path-oriented test data generation and by utilizing it, test data is generated automatically realizing the goal of discovering more important errors in  ...  A set of different subdomains is called hyper cuboids, and test data will be generated by these hyper cuboids. We apply our method in some programs, and compare it with some previous methods.  ...  This process is repeated until the selection of the last hyper cuboid and its test data generation (i.e. CHC times). The set of generated test data is returned by the variable T.  ... 
doi:10.5815/ijieeb.2014.06.01 fatcat:bl5nlrogw5ex3hr64rn2ssobue

Consistency techniques for interprocedural test data generation

Nguyen Tran Sy, Yves Deville
2003 Software engineering notes  
This paper 1 presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or oat variables.  ...  Finally, test data are generated by the application of the proposed path coverage algorithm. A prototype has been implemented. Experiments show t h e feasibility of the approach.  ...  Structural testing thus includes (1) choice of a criterion (statement, branch or path), (2) identi cation of a set of nodes, branches or paths, and (3) generation of test data for each element o f t h  ... 
doi:10.1145/949952.940087 fatcat:zinh3l7quzaghgke7qp7tgv23m

Consistency techniques for interprocedural test data generation

Nguyen Tran Sy, Yves Deville
2003 Proceedings of the 9th European software engineering conference held jointly with 10th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE '03  
This paper 1 presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or oat variables.  ...  Finally, test data are generated by the application of the proposed path coverage algorithm. A prototype has been implemented. Experiments show t h e feasibility of the approach.  ...  Structural testing thus includes (1) choice of a criterion (statement, branch or path), (2) identi cation of a set of nodes, branches or paths, and (3) generation of test data for each element o f t h  ... 
doi:10.1145/940071.940087 dblp:conf/sigsoft/SyD03 fatcat:czb2c2gih5fhxbolksul25el4a

Consistency techniques for interprocedural test data generation

Nguyen Tran Sy, Yves Deville
2003 Proceedings of the 9th European software engineering conference held jointly with 10th ACM SIGSOFT international symposium on Foundations of software engineering - ESEC/FSE '03  
This paper 1 presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or oat variables.  ...  Finally, test data are generated by the application of the proposed path coverage algorithm. A prototype has been implemented. Experiments show t h e feasibility of the approach.  ...  Structural testing thus includes (1) choice of a criterion (statement, branch or path), (2) identi cation of a set of nodes, branches or paths, and (3) generation of test data for each element o f t h  ... 
doi:10.1145/940085.940087 fatcat:vwb2teyqcjerlepiiu6yjyii6a

A CLP Framework for Computing Structural Test Data [chapter]

Arnaud Gotlieb, Bernard Botella, Michel Rueher
2000 Lecture Notes in Computer Science  
A major challenge of this process consists in generating automatically test data, i.e., in finding input values for which a selected point in a procedure is executed.  ...  Moreover, InKa has been used successfully to generate test data for programs extracted from a real application.  ...  Thanks to François Delobel for its comments on an earlier draft of this paper. This research is part of the Systems and Software Tools Support department of THOMSON-CSF DETEXIS.  ... 
doi:10.1007/3-540-44957-4_27 fatcat:getqxsjienfxtb7hcyzivw5hzm

Inference and enforcement of data structure consistency specifications

Brian Demsky, Michael D. Ernst, Philip J. Guo, Stephen McCamant, Jeff H. Perkins, Martin Rinard
2006 Proceedings of the 2006 international symposium on Software testing and analysis - ISSTA'06  
, automatic generation can produce more comprehensive sets of constraints that cover a larger range of data structure consistency properties, and (3) reviewing the properties is relatively straightforward  ...  We present a new technique for obtaining data structure consistency specifications for data structure repair.  ...  We thank Lee Badger for his suggestions and encouragement. REFERENCES  ... 
doi:10.1145/1146238.1146266 dblp:conf/issta/DemskyEGMPR06 fatcat:m5dt7u4ozzhe7j4z6t7otz2zha

Solving Constraints over Floating-Point Numbers [chapter]

C. Michel, M. Rueher, Y. Lebbah
2001 Lecture Notes in Computer Science  
Finally, we illustrate the capabilities of a CSP over the floats for the generation of test data.  ...  ., structural test case generation, correctness proof of numeric operations).  ...  Many thanks to Bernard Bottela and Arnaud Gotlieb for numerous and enriching discussions on this work. We also gratefully thank  ... 
doi:10.1007/3-540-45578-7_36 fatcat:pujdgh7jbnaltl57je6dhbxoem

Explanation-Based Generalization of Infeasible Path

Mickaël Delahaye, Bernard Botella, Arnaud Gotlieb
2010 2010 Third International Conference on Software Testing, Verification and Validation  
Recent code-based test input generators based on dynamic symbolic execution increase path coverage by solving path condition with a constraint or an SMT solver.  ...  In this paper, we propose a new method that takes opportunity of the detection of a single infeasible path to generalize to a (possibly infinite) family of infeasible paths, which will not have to be considered  ...  for pertinent inputs on SMT formula formats.  ... 
doi:10.1109/icst.2010.13 dblp:conf/icst/DelahayeBG10 fatcat:2otnfjf7tfas3g4whpdgzpgbye

Introducing tcframe: A Simple and Robust Test Cases Generation Framework

Ashar FUADI
2015 OLYMPIADS IN INFORMATICS  
There have been several attempts at creating a framework for test cases generation, that involve writing a generator program that generates the test cases, and a validator program that validates whether  ...  This paper proposes a simpler yet robust framework, called tcframe, for generating test cases especially for programming contest problems.  ...  It consists of a list of subtask definitions. A subtask definition consists of a list of constraint definitions, each of which is an assignment to a constraint boundary variable.  ... 
doi:10.15388/ioi.2015.06 fatcat:qnvw2kiwnfcejdfigumvwswiqe

Experimental evaluation of preprocessing algorithms for constraint satisfaction problems

Rina Dechter, Itay Meiri
1994 Artificial Intelligence  
The other scheme concerns the prearrangement of variables in a linear order to facilitate an efficient search.  ...  This paper presents an experimental evaluation of two orthogonal schemes for preprocessing constraint satisfaction problems (CSPs).  ...  Acknowledgments We would like to thank Tal Sela and Nadav Eran for implementing the techniques at site-2. Thanks also go to Judea Pearl for commenting on the last version of this manuscript.  ... 
doi:10.1016/0004-3702(94)90068-x fatcat:i6nfjubz6fat3owqezqmjzt7j4

Scalable analysis of conceptual data models

Matthew J. McGill, Laura K. Dillon, R. E. K. Stirewalt
2011 Proceedings of the 2011 International Symposium on Software Testing and Analysis - ISSTA '11  
They could also be analyzed for consistency and to generate test data except that the expressive constraints supported by popular modeling notations make such analysis intractable.  ...  We extend ORM − with support for two of them: objectification and a restricted class of external uniqueness constraints.  ...  Alternatively, query aware methods for generating test databases take a white-box approach, generating test data for a program by analyzing the queries that a program executes.  ... 
doi:10.1145/2001420.2001428 dblp:conf/issta/McGillDS11 fatcat:u2oz5nb5nzdvnoz6bjrcvmxcea

Least Commitment on Variable Binding in Presence of Incomplete Knowledge [chapter]

R. Barruffi, E. Lamma, P. Mello, M. Milano
2000 Lecture Notes in Computer Science  
The interesting point is that data acquisition for each variable can be guided by the constraint (or the constraints) imposed on the variable itself, in order to retrieve only consistent values.  ...  A constraint based approach for this issue has been previously proposed by Yang and Chan 21]. In this setting, the planning problem is mapped onto a Constraint Satisfaction Problem.  ...  Acknowledgments Authors' work has been partially supported by Hewlett Packard Laboratories of Bristol-UK (Internet Business Management Department) and CNR, (Project 40%).  ... 
doi:10.1007/10720246_13 fatcat:xbjn4d2kufc75liitnceutkxf4
« Previous Showing results 1 — 15 out of 1,078,513 results