In the approach to structural software metrics, software is modelled by means of flowgraphs. A tacit assumption in this approach is that the structure of a program is reflected by the structure of the flowgraph. When only the flow of control between commands is considered this assumption is valid; it is no longer valid however when also the control flow inside expressions is consid-ered. In this chapter, we introduce structure graphs for the modelling of software. Structure graphs can, just as flowgraphs, be uniquely decomposed into a hierarchy of indecomposable prime structures. We show how programs in an imperative language can be modelled by means of structure graphs in such a way that the structure of a program is always reflected by th...
This paper extends the invited talk by the first author about the virtues of structured graphs. The ...
The precise specification of software models is a major concern in model-driven design of object-ori...
summary:The program is defined syntactically as an ordered finite set of labelled commands which are...
This paper presents some basic techniques for representation and analysis of software. We use the te...
AbstractGraph theory is used to model program control structures rigorously as flowgraphs. Formal me...
In an effort to eliminate some inconveniences connected with Dijkstra's method of Structured Program...
The aim of this paper is to generalise the Fenton-Whitty-Kaposi (FWK) approach to structure software...
AbstractIrreducible program fowgraphs are important in the study of program structuredness. In this ...
. A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into...
There is an intimate link between program structure and behaviour. Exploiting this link to phrase pr...
The use of graphs to model dynamic structures is ubiquitous in computer science; prominent example a...
We introduce a new approach to construct data flow graphs of imperative programs. It is based on gra...
The key challenge of model transformations in model-driven development is in transforming higher-lev...
There are many different types of models to describe various aspects of software from inception to c...
M.Sc. (Computer Science)In this thesis a study is made of graphs, graph grammars as well as grammars...
This paper extends the invited talk by the first author about the virtues of structured graphs. The ...
The precise specification of software models is a major concern in model-driven design of object-ori...
summary:The program is defined syntactically as an ordered finite set of labelled commands which are...
This paper presents some basic techniques for representation and analysis of software. We use the te...
AbstractGraph theory is used to model program control structures rigorously as flowgraphs. Formal me...
In an effort to eliminate some inconveniences connected with Dijkstra's method of Structured Program...
The aim of this paper is to generalise the Fenton-Whitty-Kaposi (FWK) approach to structure software...
AbstractIrreducible program fowgraphs are important in the study of program structuredness. In this ...
. A structuring algorithm for arbitrary control flow graphs is presented. Graphs are structured into...
There is an intimate link between program structure and behaviour. Exploiting this link to phrase pr...
The use of graphs to model dynamic structures is ubiquitous in computer science; prominent example a...
We introduce a new approach to construct data flow graphs of imperative programs. It is based on gra...
The key challenge of model transformations in model-driven development is in transforming higher-lev...
There are many different types of models to describe various aspects of software from inception to c...
M.Sc. (Computer Science)In this thesis a study is made of graphs, graph grammars as well as grammars...
This paper extends the invited talk by the first author about the virtues of structured graphs. The ...
The precise specification of software models is a major concern in model-driven design of object-ori...
summary:The program is defined syntactically as an ordered finite set of labelled commands which are...