%A D. Benyon %A S. Skidmore %T Towards a tool kit for the systems analyst %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 2-7 %A H.K. Klein %A R.A. Hirschberg %T A comparative framework of data modelling paradigms and approaches %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 8-15 %A R.H. Gallard %T An extension in the definition of a Petri net execution %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 16-19 %A S. Tsutsui %A Y. Fujimoto %T Deadlock prevention in process control computer systems %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 20-26 %A R. Backhouse %A A. Khamiss %T A while-rule in Martin-Lof's theory of types %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 27-36 %A A.G. Middleton %T Some transformations of relevance to report generation %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 37-42 %A G. Oulsnam %T The algorithmic transformation of schemas to structured form %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 43-51 %A J.A.W. Faidhi %A S.K. Robinson %T Programmer experience-level indicators %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 52-62 %A D.C. Ince %T The automatic generation of test data %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 63-69 %A I.S. Rohl %T Towers of Hanoi: the derivation of some iterative versions %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 70-76 %A P.M. Fenwick %T A fast-carry adder with CMOS transmission gates %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 77-79 %A T. Raita %T An automatic system for file compression %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 80-86 %A A.J. Cole %T Compaction techniques for raster scan graphics using space-filling curves %J The Computer Journal %K compjour %V 30 %N 1 %D February 1987 %P 87-92 %A A. Verrijn-Stuart %T Themes and trends in information systems: TC8, 1975-1985 %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 97-109 %A L.M. Mackenzie %A A.M. MacLeod %A D.J. Berry %T A multiple microprocessor system for CPU-bound calculations %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 110-118 %A I.A. Newman %A R.P. Stallard %A M.C. Woodward %T A hybrid multiple processor gargabe collection algorithm %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 119-127 %A I. Sommerville %A R. Welland %A S. Berr %T Describing software design methodologies %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 128-133 %K GDL %A H. Barringer %T Up and down the temporal way %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 134-148 %A J.A. Llewellyn %T Data compression for a source with Markov characteristics %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 149-156 %A S.M. Deen %A R.R. Amin %A M.C. Taylor %T Implementation of a prototype for PRECI %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 157-162 %A S. Nedunuri %A N.E. Wiseman %T Displaying random surfaces %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 163-167 %A C.M.A. Castle %A M.L.V. Pitteway %T An efficient structural technique for encoding "best-fit" straight lines %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 168-175 %A A. Unnikrishnan %A Y.V. Venkatesh %A Priti Shankar %T Connected component labeling using quadtrees - a bottom-up approach %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 176-182 %A H. Berghel %T Crossword compilation with Horn clauses %J The Computer Journal %K compjour %V 30 %N 2 %D April 1987 %P 183-188 %A G.S. Blair %A J.A. Mariani %A J.R. Nicol %A D. Shepherd %T A knowledge-based operating system %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 193-200 %K Cosmos %A C.M. Reeves %T Chainmail: a model of first-fit memory allocation %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 201-213 %A P.C. Burkimsher %T Combinator reduction in a shared-memory multiprocessor %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 214-222 %K Prism %A N.S. Coulter %A R.B. Cooper %A M.K. Solomon %T Information-theoretic complexity of program specifications %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 223-227 %A K.A. Redish %A W.F. Smyth %T Evaluating measures of program quality %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 228-232 %A J.K. Navlakha %T A survey of system complexity metrics %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 233-238 %A D. Gray %T A pedagogical verification condition generator %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 239-248 %A C.C. Chang %T An information protection scheme basd upon number theory %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 249-253 %A B. Teufel %T System design for the remote execution of library routines %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 254-257 %A C.-L. Wey %A F. Lombardi %T On a novel self-test approach to digital testing %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 258-267 %A J.C. Nash %A S. Shlien %T Simple algorithms for the partial singular value decomposition %J The Computer Journal %K compjour %V 30 %N 3 %D June 1987 %P 268-275 %A M. Sowa %T A method for speeding up serial processing in dataflow computers by means of a program counter %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 289-294 %A Cs. Kecskes %T A simple method for building up large computer systems from small computers %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 295-297 %A J. van\ Leeuwen %A R.B. Tan %T Interval routing %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 298-307 %A D.J. Challab %A J.D. Roberts %T Buddy algorithms %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 308-315 %A D.A. Duce %A E.V.C. Fielding %T Formal specification - a comparison of two techniques %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 316-327 %A Cristina Sernadas %A R. Carapuca %T The role of conceptual modelling abstractions in compiler development %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 328-336 %A R. Leith %T A programmed, skeleton formal specification method: the OUFDM %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 337-342 %A J.K. Mullin %T Accessing textual documents using compressed indexes of arrays of small Bloom filters %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 343-348 %A P.A. Firby %A D.J. Stone %T Colour manipulation of superposed families of curves %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 349-354 %A F.W. Burton %A V.J. Kollias %A J.G. Kollias %T A general Pascal program for map overlay of quadtrees and related problems %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 355-361 %A A.J. Verkamo %T Performance of quicksort adapted for virtual memory use %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 362-371 %A S. Dvorak %A B. Durian %T Stable linear time sublinear space merging %J The Computer Journal %K compjour %V 30 %N 4 %D August 1987 %P 372-375 %A W.F. Clocksin %T Principles of the DelPhi parallel inference machine %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 386-392 %K pure Prolog %A P. Kacsuk %A A. Bale %T DAP Prolog: a set-oriented approach to Prolog %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 393-403 %A D. McGregor %A S. McInnes %A M. Henning %T An architecture for associative processing of large knowledge bases (LKBs) %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 404-412 %A B.M. Forrest %A D. Roweth %A N. Stroud %A D.J. Wallace %A G.V. Wilson %T Implementing neural network models on parallel computers %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 412-419 %A A.F.W. Coulson %A J.F. Collins %A A. Lyall %T Protein and nucleic acid sequence database searching: a suitable case for parallel processing %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 420-424 %A H.R. Arabnia %A M.A. Oliver %T A transputer network for the arbitrary rotation of digitised images %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 425-432 %A S.G. Akl %T Adaptive and optimal parallel algorithms for enumerating permutations and combinations %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 433-436 %A F.W. Burton %T Functional programming for concurrent and distributed computing %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 437-450 %A J.M. Foster %A I.F. Currie %T Remote capabilities %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 451-457 %K Flex %A A. Segev %T Optimising two-way joins in horizontally partitioned database systems %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 458-468 %A D. Godfrey %A Gong S. %A R. Hart %A N. Koorland %A S. Smit %T Project 'Clear skies': teaching computer science by computer based teaching and electronic messaging in China %J The Computer Journal %K compjour %V 30 %N 5 %D October 1987 %P 469-474