Cute: a concolic unit testing engine for c

Cute: a concolic unit testing engine for c (2005)

Cached

Other Repositories/Bibliography

by Koushik Sen , Darko Marinov , Gul Agha

Venue:	In ESEC/FSE-13: Proceedings of the 10th European
Citations:	212 - 17 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Cute: a concolic unit testing engine for c	INFERENCE
AUTHOR NAME	Koushik Sen	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of Illinois at Urbana-Champaign	SVM HeaderParse 0.2
AUTHOR NAME	Darko Marinov	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of Illinois at Urbana-Champaign	SVM HeaderParse 0.2
AUTHOR NAME	Gul Agha	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science; University of Illinois at Urbana-Champaign	SVM HeaderParse 0.2
ABSTRACT	In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses the problem of automating unit testing with memory graphs as inputs. The approach used builds on previous work combining symbolic and concrete execution, and more specifically, using such a combination to generate test inputs to explore all feasible execution paths. The current work develops a method to represent and track constraints that capture the behavior of a symbolic execution of a unit with memory graphs as inputs. Moreover, an efficient constraint solver is proposed to facilitate incremental generation of such test inputs. Finally, CUTE, a tool implementing the method is described together with the results of applying CUTE to real-world examples of C code.	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	In ESEC/FSE-13: Proceedings of the 10th European	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	263--272	INFERENCE
CITATIONS	28 found	ParsCit 1.0