Software Engineering Journal
Volume 7, Issue 1, January 1992
Volumes & issues:
Volume 7, Issue 1
January 1992
Modelling of visualised data-flow diagrams using petri net model
- Author(s): Poh-Tin Lee and K.P. Tan
- Source: Software Engineering Journal, Volume 7, Issue 1, p. 4 –12
- DOI: 10.1049/sej.1992.0001
- Type: Article
- + Show details - Hide details
-
p.
4
–12
(9)
In this paper, an approach to the modelling and implementation of data-flow diagrams (DFDs) using Petri nets is introduced. A direction is identified where visualisation and high-level semantics can be incorporated into data-flow diagrams to facilitate direct manipulation, interpretation and validation. At the automation level, visualised DFDs generate layouts for data-flow vectors and use Petri nets to safeguard the correctness of a specification. The Petri net model uses a set of constraints to enforce consistency, both within and across diagrams. At the visual level, visualised DFDs replace the traditional textual specifications of the process and data-flow components with graphical forms. The entity-relationship model is adopted as the hierarchical and logical view of data.
The complexity of software testing
- Author(s): J.Paul Myers
- Source: Software Engineering Journal, Volume 7, Issue 1, p. 13 –24
- DOI: 10.1049/sej.1992.0002
- Type: Article
- + Show details - Hide details
-
p.
13
–24
(12)
The futility of using a general-purpose metric to characterise ‘the’ complexity of a program has recently been argued to support the design of specific metrics for the different stages of the software life-cycle. An analysis of the module testing activity is performed, providing evidence of the absurdity of all-purpose metrics, as well as a methodical means with which to measure testing complexity. Several standard metrics are seen to serve as component measures for the intricacies of testing. The methodology is applied to compare traditional and adaptive means of testing. It is shown that previous informal arguments asserting the superiority of adaptive methodologies are formally confirmed.
Vista: a user interface for a distributed object-oriented software engineering environment
- Author(s): T. Rodden ; P. Sawyer ; I. Sommerville
- Source: Software Engineering Journal, Volume 7, Issue 1, p. 25 –34
- DOI: 10.1049/sej.1992.0003
- Type: Article
- + Show details - Hide details
-
p.
25
–34
(10)
This paper describes a prototype user interface for a distributed software engineering environment, where the components of the environment are autonomous agents with some inherent decision-making capabilities. Agents may be distributed across a local-or wide-area network. Two forms of interaction are supported; namely, direct manipulation and message passing. Synchronous interaction is supported via the direct manipulation of system objects. Asynchronous interaction is managed by a central server agent, distributing electronic mail messages to the appropriate human or automated agents. The functionality of the system is illustrated by examples drawn from the domain of software development.
Two object-based decomposition methodologies: a case study
- Author(s): Vaclav Rajlich and Joao Silva
- Source: Software Engineering Journal, Volume 7, Issue 1, p. 35 –42
- DOI: 10.1049/sej.1992.0004
- Type: Article
- + Show details - Hide details
-
p.
35
–42
(8)
An interesting and little documented problem is the influence of a design methodology on the program architecture. In this case study, we compared two design methodologies and their impact on both development process and the resulting program architecture. The methodologies are object-based variants of refinement methodology and structured design, respectively. Both methodologies were applied to the same problem (a library system of less than 1000 lines of Ada code), and the results were compared. Substantial differences between the two resulting architectures are analysed and discussed.
An empirical evaluation (and specification) of the all-du-paths testing criterion
- Author(s): James M. Bieman and Janet L. Schultz
- Source: Software Engineering Journal, Volume 7, Issue 1, p. 43 –51
- DOI: 10.1049/sej.1992.0005
- Type: Article
- + Show details - Hide details
-
p.
43
–51
(9)
The all-du-paths structural testing criterion is one of the most discriminating of the data-flow testing criteria. Unfortunately, in the worst case, the criterion requires an intractable number of test cases. In a case study of an industrial software system, we find that the worst-case scenario is rare. Eighty percent of the subroutines require ten or fewer test cases. Only one subroutine out of 143 requires an intractable number of tests. However, the number of required test cases becomes tractable when using the all-uses criterion. This paper includes a formal specification of both the all-du-paths criterion and the software tools used to estimate a minimal number of test cases necessary to meet the criterion.
Achieving high integrity of process control software by graphical design and formal verification
- Author(s): Wolfgang A. Halang and Bernd Krämer
- Source: Software Engineering Journal, Volume 7, Issue 1, p. 53 –64
- DOI: 10.1049/sej.1992.0006
- Type: Article
- + Show details - Hide details
-
p.
53
–64
(12)
The International Electrotechnical Commission is currently standardising four compatible languages for designing and implementing programmable logic controllers (PLCs). The language family includes a diagrammatic notation that supports the idea of software ICs to encourage graphical design techniques and systematic software reuse. This paper presents an interactive system with a graphical interface for constructing and validating PLC software. The semantics of a graphical design is defined by a mapping associating each design with an executable formal specification. The specification provides the basis for rigorous proofs and early tests of critical properties of a new design. A realistic example illustrates these features.
File system caching in large point-to-point networks
- Author(s): P.B. Austin ; K.A. Murray ; A.J. Wellings
- Source: Software Engineering Journal, Volume 7, Issue 1, p. 65 –80
- DOI: 10.1049/sej.1992.0007
- Type: Article
- + Show details - Hide details
-
p.
65
–80
(16)
In this paper, we examine the design of a file system for a general-purpose scalable parallel computing engine, based on an extensible mesh of processors. Although many distributed file systems have already been developed, none have properly addressed the characteristics that are special to these computing engines, namely dynamic load-balancing and point-to-point networks. Client caching is identified as a key area where current systems fall short. We propose two new caching schemes that employ an extra level of caching in addition to that used by current client caching schemes. We present some results from a simulation study of the two new caching schemes, which demonstrate that the schemes outperform traditional client caching schemes when used in a general-purpose processor mesh-based, parallel computing engine. Since one of these caching schemes is quite complex, we have developed a formal specification in the Z language.
Most viewed content for this Journal
Article
content/journals/sej
Journal
5
Most cited content for this Journal
We currently have no most cited data available for this content.
