Skip to Main content Skip to Navigation
New interface
Conference papers

Counting authorised paths in constrained control-flow graphs

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02549827
Contributor : Enka Blanchard Connect in order to contact the contributor
Submitted on : Tuesday, April 21, 2020 - 5:35:23 PM
Last modification on : Tuesday, September 6, 2022 - 1:27:28 PM

File

Counting_paths_in_DAG (1).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02549827, version 1

Citation

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

Share

Metrics

Record views

85

Files downloads

50