Translating C# to Branching Symbolic Transducers

14 pages•Published: June 4, 2017

Abstract

The paper looks at tooling aspects of transforming C# programs into symbolic transducers with branching rules (BSTs). The latter are used for describing list comprehensions that incorporate loop-carried state. One concrete application is log analysis where input streams of data are transformed into output streams of data via intermediate pipelines of transducers. The paper presents algorithms for translating C# to BSTs, and for exposing control state in BSTs.

Keyphrases: automata theory, domain specific language, symbolic transducer

In: Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov (editors). IWIL Workshop and LPAR Short Presentations, vol 1, pages 86-99.

Links:	https://easychair.org/publications/paper/74R7
	https://doi.org/10.29007/7jf1

BibTeX entry

@inproceedings{LPAR-21S:Translating_C#_Branching_Symbolic,
  author    = {Olli Saarikivi and Margus Veanes},
  title     = {Translating C# to Branching Symbolic Transducers},
  booktitle = {IWIL Workshop and LPAR Short Presentations},
  editor    = {Thomas Eiter and David Sands and Geoff Sutcliffe and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {1},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/74R7},
  doi       = {10.29007/7jf1},
  pages     = {86-99},
  year      = {2017}}

Download PDF Open PDF in browser