7987

Sigma*: Symbolic Learning of Stream Filters

Matko Botincan, Domagoj Babic
University of Cambridge
University of Cambridge, 2012

@article{botincan2012sigma,

   title={Sigma*: Symbolic Learning of Stream Filters},

   author={Botincan, M. and Babic, D.},

   year={2012}

}

Download Download (PDF)   View View   Source Source   

1186

views

We present Sigma*, a novel technique for learning symbolic models of software behavior. Sigma* addresses the challenge of synthesizing models of software by using symbolic conjectures and abstraction. By combining dynamic symbolic execution to discover symbolic input-output steps of the programs and counterexample guided abstraction refinement to over-approximate program behavior, Sigma* transforms arbitrary source representation of programs into faithful input-output models. We define a class of stream filters-programs that process streams of data items-for which Sigma* converges to a complete model if abstraction refinement eventually builds up a sufficiently strong abstraction. In other words, Sigma* is complete relative to abstraction. To represent inferred symbolic models, we use a variant of symbolic transducers that can be effectively composed and equivalence checked. Thus, Sigma* enables fully automatic analysis of behavioral properties such as commutativity, reversibility and idempotence, which is useful for web sanitizer verification and stream programs compiler optimizations, as we show experimentally. We also show how models inferred by Sigma* can be used to boost performance of stream programs through parallelized code generation.
Rating: 2.5. From 2 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: