Add to ORKGWe define computation on grids as the composition, through pushout constructions, of control flows, carried across adjacency relations between grid cells, with formulas updating the value of some attribute. The approach is based on the identification of a subcategory of attributed typed graphs suitable to the definition of pushouts on grids, and is illustrated in the context of the Cyberfilm visual language
Illustration of the pipeline pattern as a graph with the nodes being code generation operations (e.g...
We describe an approach to the reversal of the control flow of structured programs. It is used to au...
Properties of distributed computations can be either on their global states or on their control flow...
We define computation on grids as the composition, through pushout constructions, of control flows, ...
We define computation on grids as the composition, through pushout constructions, of control flows,...
The semantics of programming languages lack a formal, standardized specification lan-guage. We focus...
In this paper we propose a visual language CFSL for specifying control flow semantics of programming...
The control flow of programs can be represented by directed graphs. In this paper we provide a unifo...
This paper presents a graph-based formulation of control-flow analysis using results from game seman...
AbstractThe control point form of algebraic grid generation is developed in a rigorous manner to ill...
This chapter aims at contributing to a better understanding of generation and simulation problems of...
State-of-the-art approaches to controlled graph rewriting focus on the specification of an external ...
The graph transformation tool GROOVE supports so-called recipes, which allow the elaboration of comp...
Simplified graph representations for two variants of Spark algorithms. The nodes shown as light gree...
Abstract. This paper presents a graph-based formulation of controlflow analysis using results from g...
Illustration of the pipeline pattern as a graph with the nodes being code generation operations (e.g...
We describe an approach to the reversal of the control flow of structured programs. It is used to au...
Properties of distributed computations can be either on their global states or on their control flow...
We define computation on grids as the composition, through pushout constructions, of control flows, ...
We define computation on grids as the composition, through pushout constructions, of control flows,...
The semantics of programming languages lack a formal, standardized specification lan-guage. We focus...
In this paper we propose a visual language CFSL for specifying control flow semantics of programming...
The control flow of programs can be represented by directed graphs. In this paper we provide a unifo...
This paper presents a graph-based formulation of control-flow analysis using results from game seman...
AbstractThe control point form of algebraic grid generation is developed in a rigorous manner to ill...
This chapter aims at contributing to a better understanding of generation and simulation problems of...
State-of-the-art approaches to controlled graph rewriting focus on the specification of an external ...
The graph transformation tool GROOVE supports so-called recipes, which allow the elaboration of comp...
Simplified graph representations for two variants of Spark algorithms. The nodes shown as light gree...
Abstract. This paper presents a graph-based formulation of controlflow analysis using results from g...
Illustration of the pipeline pattern as a graph with the nodes being code generation operations (e.g...
We describe an approach to the reversal of the control flow of structured programs. It is used to au...
Properties of distributed computations can be either on their global states or on their control flow...