16006621
Splitting atoms safely
The aim of this paper is to make a contribution to (compositional) development methods for concurrent programs. In particular, it takes a fresh look at a number of familiar ideas including the problem of interference. Some subtle issues of observability-including granularity-are explored. Based on these points, the paper sets out some requirements for an approach to developing systems by ''splitting atoms safely''.
2399941
Operational semantics: Concepts and their expression
9236653
The Early Search for Tractable Ways of Reasoning about Programs
This article traces the history - up to around 1990 - of research on reasoning about programs. The main focus is on sequential imperative programs but some comments are made on concurrency. The main thesis is that the idea of reasoning about programs has been around since they were first written; the search has been to find tractable methods.
45828501
Formal Definition in Program Development
The intent of the current paper is to show how a large problem like compiler development can be divided in a way which provides a structure for arguments of correctness. Although mechanically checked proofs are not envisaged, the use of formal notation is recommended so that the basis for correctness arguments exists.
15308825
Scientific Decisions which Characterize VDM
The formal description and development method known as VDM has been used extensively, its specification language is now an ISO standard, and it has influenced other specification languages. The origins of VDM are normally placed in language description or semantics but it is probably best known in the wider arena of formal methods for (general) program specification and design. This paper sets out a personal view of some of the key technical decisions which characterize the Vienna Development Method.
6772552
Fixing the semantics of some concurrent object-oriented concepts
Abstract Concurrent object-oriented languages provide a suitable target for a compositional design process that copes with the interference inherent with concurrency. Fixing the semantics of an object-based design language has been undertaken using structured operational semantics and by a mapping to the pi-calculus. These two approaches are outlined and contrasted. In particular, the difficulties in the two approaches of justifying the proof rules of the proposed design method are explained.
36993113
A Collaborative Schema Integration System
Conceptual modelling as applied to database development can be described as a two stage process: schema modelling followed by schema integration. Schema modelling is the process of transforming individual user requirements into a conceptual schema: an implementation-independent map of data requirements. Schema integration is the process of combining individual conceptual schemas into a single, unified schema. Single-user tools for schema modelling have enjoyed much success partly because the process of schema modelling has become relatively well formalised. Although a number of formal approaches to conducting schema integration have been proposed, it appears that schema integration tools have not enjoyed the same level of success. This we attribute not so much to the problem of formalisation but to the inherent collaborative nature of schema integration work. This paper first discusses the importance of collaboration to schema integration work. It then describes SISIBIS, a demonstrator system employing the IBIS (Issue Based Information System) scheme to support collaborative database design.
33896540
A Triangulated Spatial Model for Cartographic Generalisation of Areal Objects
Cartographic generalisation involves interaction between individual operators concerned with processes such as object elimination, detail reductions amalgamation, typification and displacement. Effective automation of these processes requires a means of maintaining knowledge of the spatial relationships between map objects in order to ensure that constraints of topology and of proximity are obeyed in the course of the individual generalisation transformations. Triangulated spatial models, based on the constrained Delaunay triangulation, have proven to be of particular value in representing the proximal and topological relations between map objects and hence in performing many of the essential tasks of fully automated cartographic generalisation. These include the identification of nearby objects; determination of the structure of space between nearby objects; execution of boundary simplification, merge and collapse operations; and the detection and resolution, by displacement, of topological inconsistencies arising from individual operators. In this paper we focus on the use of a triangulated model for operations specific to execution of merge operations between areal objects. The model is exploited to identify the regions of space between nearby objects and to execute merge operations in which the triangulation is used variously to adopt intervening space and to move adjacent rectangular objects to touch each other. Methods for updating the triangulation are described.
32895841
Software Change Management
Software projects change rapidly, which makes efficient change management a major challenge for the software industry. This challenge was poorly met for years because of rudimentary tools. The paper considers how modern change management, or configuration control tools must encompass changes affecting every kind of software deliverable and artifact.
13190855
Conflict resolution in cartographic name placement
Abstract The increasing application of computer cartography in geographical information systems and in professional map production has highlighted the requirement for automatic positioning of cartographic text in a manner that ensures legibility. An important aspect of the implementation of automated name placement is the avoidance of conflict, in particular due to overlap between names, and between names and map features. This paper reviews the automated strategies that have been adopted for conflict resolution. The majority of these may be classified as either iterative or graph-search procedures. In general the problem may be seen as one in which initially trial positions are generated for each of a selected set of names. These trial positions should obey rules relating to text characteristics and to the relationships between names and other map features. Conflict resolution then consists in finding, for each name, a trial position that obeys the cartographic rules governing the relationships between names.
14219539
Characterisation and generalisation of cartographic lines using Delaunay triangulation
A method is presented for generalising cartographic lines using an approach based on determination of their structure. Constrained Delaunay triangulation is used to construct a skeleton of the space surrounding the lines and hence represent line features in terms of skeleton branches. Several statistical measures are used to characterise the triangulation branches. The measures enable selective generalisation of different types of line feature, leading to the possibility of user-specification of the style of generalisation. In our implementation of the approach, the triangulation is updated dynamically to allow both sides of multiple lines to be processed, while guaranteeing topological consistency between the resulting generalised lines.