As part of a larger project., we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the instruction scheduler more flexibility in balancing execution resources for superscalar execution. Since the key design points for this language are to only describe data flow, have built-in facilities for redundancies, and still have code that looks like assembler, by virtue of consisting mainly of assembly instructions, we are basing the theoretical foundations on data-flow graph theory, and have to accommodate also relational aspects. Using functorial semantics into a Kleene category of "hyper-paths", we formally capture the data-flow-with-choice aspects of this language and its implementation, providing also the framework for the necessary correctness proofs. © Springer-Vorlag Berlin Heidelberg 2006.
CITATION STYLE
Kahl, W., Anand, C. K., & Carette, A. J. (2006). Control-flow semantics for assembly-level data-flow graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3929 LNCS, pp. 147–160). https://doi.org/10.1007/11734673_12
Mendeley helps you to discover research relevant for your work.