The Computer Journal, Volume 34, 1991

Volume 34, Number 1, 1991

A. J. J. Dick: An Introduction to Knuth-Bendix Completion. 2-15
A. J. J. Dick, Phil Watson: Order-Sorted Term Rewriting. 16-19
Miki Hermann, Claude Kirchner, Hélène Kirchner: Implementations of Term Rewriting Systems. 20-33
Tobias Nipkow: Constructive Rewriting. 34-41
Peter Padawitz: Reduction and Narrowing for Horn Clause Theories. 42-51
Péter Kacsuk: A Parallel Prolog Abstract Machine and its Multi-Transputer Implementation. 52-63
Jukka Paakki: Prolog in Practical Compiler Writing. 64-72
Levent V. Orman: Constraint Maintenance as a Data Model Design Criterion. 73-79
Farokh B. Bastani, Ing-Ray Chen, Wael Hilal Bahaa-El-Din: A Model for the Stability Analysis of Maintenance Stragies for Linear List. 80-87

Short Note

Mark Allen Weiss: Empirical Study of the Expected Running Time of Shellsort. 88-91
J.-L. Wu, S.-T. Cheng: A Neural Network Simulating System. 92-93

David E. Avison, A. T. Wood-Harper: Information Systems Development Research: An Exploration of Ideas in Practice. 98-112
F. Noble: Seven Ways to Develop Office Systems: A Managerial Comparison of Office System Development Methodologies. 113-121
Danny Chiang Choon Poo: Representing Business Policies in the Jackson System Development Method. 122-131
Alistair G. Sutcliffe, I. Wang: Integrating Human Computer Interaction with Jackson System Development. 132-142
T. H. Tse, L. Pong: An Examination of Requirements Specification Languages. 143-152
J. Trenouth: A Survey of Exploratory Software Development. 153-163
M. Elizabeth C. Hull, Peter G. O'Donoghue, B. J. Hagan: Development Methods for Real-Time Systems. 164-172
Alan Burns, Andrew M. Lister: A Framework for Building Dependable Systems. 173-181
P. Hammersley: Information Systems Design Methodologies - Book Reviews. 182-185

Short Note

Massimo Ancona, Andrea Clematis, Leila De Floriani, Enrico Puppo: HIDEL: A Language for Hierarchical VLSI Design. 195-206
Barry Wilkinson: Comparative Performance of Overlapping Connectivity Multiprocessor Interconnection Networks. 207-214
A. Olerup: Design Approaches: A Comparative Study of Information System Design and Architecutral Design. 215-224
Michael O'Docherty, C. N. Daskalakis: Multimedia Information Systems - The Management and Semantic Retrieval of all Electronic Data Types. 225-238
Peter J. H. King, Carol Small: Default Databases and Incomplete Information. 239-244
R. Marshall: Manipulating Full-Text Scientific Databases: A Logic-Based Semantico-Pragmatic Approach. 245-253
Ian A. Macleod: A Query Language for Retrieving Information from Hierarchic Text Structures. 254-264
K. Morgan, R. L. Morris, S. Gibbs: When does a Mouse become a Rat? or ... Comparing Performance and Preferences in Direct Manipulation and Command Line Environment. 265-271
The Rt Hon. The Earl of Halsbury: `Innovation for Failure - Some Reflections on the Work of the NRDC Relevant to the Early History of the Computer Industry in the UK'. 272-279

Short Notes

Varol Akman: Implementation of Karp-Luby Monte Carlo Method: An Exercise in Approximate Counting. 279-282
K. Wicovsky, Peter Thanisch, M. Howard Williams: Improved Recursion Handling Through Integrity Constraints. 282-285

Hugh Kingdon, David R. Lester, Geoffrey L. Burn: The HDG-Machine: A Highly Distributed Graph-Reducer for a Transputer Network. 290-301
David B. Skillicorn: Practical Concurrent Programming for Parallel Machines. 302-310
Julian A. Padget, Russell J. Bradford, John Fitch: Concurrent Object-Oriented Programming in Lisp. 311-319
M. C. Pong: I-Pigs: An Interactive Graphical Environment for Concurrent Programming. 320-330
E. J. Yannakoudakis, A. A. Shahid: A Controlled Environment for Meta-Message Processing. 331-344
Kwok-bun Yue, R. T. Jacob: An Efficient Starvation-Free Semaphore Solution for the Graphical Mutual Exclusion Problem. 345-349
Sanjeev Khanna: Logic Programming for Software Verification and Testing. 350-357

Short Note

D. J. Challab: Implementation of Flexible Arrays Using Balanced Trees. 386-396
B. Srinivasan: An Adaptive Overflow Technique to Defer Splitting in B-Trees. 397-405
W. F. Smyth: Mu-Balancing M-Way Search Trees. 406-414
Sivarama P. Dandamudi, Paul G. Sorenson: Improved Partial-Match Search Algorithms for BD Trees. 415-422
Stephan Olariu, C. Michael Overstreet, Zhaofang Wen: A Mergeable Double-Ended Priority Queue. 423-427
Dalit Naor, Charles U. Martel, Norman S. Matloff: Performance of Priority Queue Structures in a Virtual Memory Environment. 428-437
Erkki Mäkinen: A Survey on Binary Tree Codings. 438-443
G. Argo: Weighting Without Waiting: The Weighted Path Length Tree. 444-454
Seng Fuat Ou, Alan L. Tharp: High Storage Utilisation for Single-Probe Retrieval Linear Hashing. 455-468
Chin-Chen Chang, C. Y. Chen, J. K. Jan: On the Design of a Machine-Independent Perfect Hashing Scheme. 469-474

Short Note

Peter Ruzicka, Vusei-Ar: A Note on the Efficiency of an Interval Routing Algorithm. 475-476

Wiktor B. Daszczuk: A Structured Semantic Design of Distributed Operating Systems. 482-492
N. T. Son, Y. Paker: Adaptive Deadlock-Free Packet Routeing in Transputer-Based Multiprocessor Interconnection Networks. 493-502
Luigi V. Mancini, Santosh K. Shrivastava: Fault-Tolerant Reference Counting for Garbage Collection in Distributed Systems. 503-513
Jean Dollimore, E. Miranda, Wang Xu: The Design of a System for Distributing Shared Objects. 514-521
M. S. Verrall: Unity Doesn't Imply Unification or Overcoming Heterogeneity Problems in Distributed Software Engineering Environments. 522-533
Divyakant Agrawal, A. Malpani: Efficient Dissemination of Information in Computer Networks. 534-541
L. H. Geesink: The Coordination of Distributed Active Messages in a Dynamic Network Topology. 542-550
Peter Bodorik, J. Spruce Riordon: Threshold Values for Processing Distributed Queries. 551-558
Donald Michie: Methodologies from Machine Learning in Data Analysis and Software. 559-565

Short Notes

Lu Lahodynskyj: Structure Clashes. 566-568
Jeffrey S. Rohl: Ord-Smith's Pseudo-Lexicographical Permutation Procedure is the Tompkins-Paige Algorithm. 569-570