Symbolic execution of transition systems with function summaries

Abstract : Reactive systems can be modeled with various kinds of automata, such as Input Output Symbolic Transition Systems (IOSTS). Symbolic execution (SE) applied to IOSTS allows computing constraints associated to IOSTS path executions (path conditions). In this context, generating test cases amounts to finding numerical input values satisfying such constraints using solvers. This paper explores the case where IOSTS models contain functions which are outside of the scope of such solvers. We propose to use function summaries which are logical formulas built from concrete values describing some representative input/output data tuples of the function. We define algorithmic strategies to solve path conditions including such functions based on techniques using and enriching function summaries. Our method has been implemented within the Diversity tool and has been applied to several examples.
Document type :
Journal articles
Complete list of metadatas
Contributor : Léna Le Roy <>
Submitted on : Wednesday, June 6, 2018 - 11:13:09 AM
Last modification on : Thursday, February 7, 2019 - 4:17:32 PM

Links full text



I. Boudhiba, C. Gaston, P. Le Gall, V. Prevosto. Symbolic execution of transition systems with function summaries. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, 10375 LNCS, pp.41-58. ⟨10.1007/978-3-319-61467-0_3⟩. ⟨cea-01808888⟩



Record views