Compositional Symbolic Execution Using Fine-Grained Summaries

• Published in: 2015 24th Australasian Software Engineering Conference pp. 213 - 222
• Main Authors: Yude Lin, Miller, Tim, Sondergaard, Harald
• Format: Conference Proceeding Journal Article
• Language: English
• Published: IEEE 01.09.2015
• Subjects: Australia; Cognition; COM; Conferences; constraint solving; Electronic mail; Explosions; Information systems; path explosion; Registers; Software engineering; Solvers; Strategy; Summaries; Test generation
• ISSN: 1530-0803; 2377-5408
• DOI: 10.1109/ASWEC.2015.32

Compositional symbolic execution has been proposed as a way to increase the efficiency of symbolic execution. Essentially, when a function is symbolically executed, a summary of the path that was executed is stored. This summary records the precondition and post condition of the path, and on subsequent calls that satisfy that precondition, the corresponding post condition can be returned instead of executing the function again. However, using functions as the unit of summarisation leaves the symbolic execution tool at the mercy of a program designer, essentially resulting in an arbitrary summarisation strategy. In this paper, we explore the use of fine-grained summaries, in which blocks within functions are summarised. We propose three types of summarisation and demonstrate how to generate these. At such a fine-grained level, symbolic execution of a path effectively becomes the concatenation of the summaries along that path. Using a prototype symbolic execution tool, we perform a preliminary experimental evaluation of our summary approaches, demonstrating that they can improve the speed of symbolic execution by reducing the number of calls sent to the underlying constraint solver.