Counting authorised paths in constrained control-flow graphs

Enka Blanchard (1, 2) , Siargey Kachanovich (3)

1 IRIF (UMR_8243) - Institut de Recherche en Informatique Fondamentale
2 LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
3 DATASHAPE - Understanding the Shape of Data

Our goal in this extended abstract is to investigate a model of computation inspired by control-flow graphs, automata and arithmetic circuits. The objective is to extend the definition of the first to include computing on nodes and edges.

Domaines: Mathématique discrète [cs.DM]

Enka Blanchard, Siargey Kachanovich. Counting authorised paths in constrained control-flow graphs. Bordeaux Graph Workshop, Oct 2019, Bordeaux, France. ⟨hal-02549827⟩