Conference paper Open Access

Symbolic execution of transition systems with function summaries

Boudhiba, Imen; Gaston, Christophe; Le Gall, Pascale; Prévosto Virgile

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Boudhiba, Imen</dc:creator>
  <dc:creator>Gaston, Christophe</dc:creator>
  <dc:creator>Le Gall, Pascale</dc:creator>
  <dc:creator>Prévosto Virgile</dc:creator>
  <dc:description>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.</dc:description>
  <dc:subject>Input Output Symbolic Transition Systems</dc:subject>
  <dc:subject>Functions summaries</dc:subject>
  <dc:subject>Symbolic Execution</dc:subject>
  <dc:subject>Transition coverage</dc:subject>
  <dc:title>Symbolic execution of transition systems with function summaries</dc:title>
Views 47
Downloads 62
Data volume 49.8 MB
Unique views 43
Unique downloads 61


Cite as