Newcastle University

Technical Reports

Year: 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 1986 1985 1984 1983 1982 1981 1980 1979 1978 1977 1976 1975 1974 1973 1972 1971 1970 1969

• Capretz, L.F.Object-Oriented Design Methodologies for Software Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 370 (download PDF).
• Chakka R, Mitrani I. Heterogeneous Multiprocessor Systems wilh Breakdowns: Performance and Optimal Repair Strategies. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 369 (download PDF).
• Stewart, I.A.On Two Approximation Algorithms for the Clique Problem. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 368 (download PDF).
• Koutny M, Janicki R. Structure of Concurrency. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 367 (download PDF).
• Holt, C.M.Visualizing Concurrent Relations. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 366 (download PDF).
• Wright K. Differential Equations for the Analytic Singular Value Decomposition of a Matrix. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 365 (download PDF).
• Megson, G.M.Automating Systolic Algorithm Design 2: A Practical Approach. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 364 (download PDF).
• Megson, G.M.Automating Systolic Algorithm Design 1: Basic Synthesis Techniques. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 363 (download PDF).
• Yakovlev A. A Structural Technique for Fault-Protection in Asynchronous Interfaces. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 362 (download PDF).
• de Lemos R, Saeed A, Anderson T. A Train Set as a Case Study for the Requirements Analysis of Safety-Critical Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 361 (download PDF).
• de Lemos R, Saeed A, Anderson T. Value Inconsistencies due to Time Uncertainties. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 360 (download PDF).
• de Lemos R, Saeed A, Anderson T. Analysis of Timeliness Requirements in Safety-Critical Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 359 (download PDF).
• Stoker, M.A.The Exploitation of Parallelism on Shared Memory Multiprocessors. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 358 (download PDF).
• Stewart, I.A.On the Reachability Problem for Some Classes of Petri Nets. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 357 (download PDF).
• Pietkiewicz-Koutny M. Modelling Reconfigurability using Graph Grammars and Petri Nets. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 356 (download PDF).
• Janicki R, Koutny M. Invariants and Paradigms of Concurrency Theory. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 355 (download PDF).
• McCue, D.L.Intercepting Fetch and Store Operations in C ++. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 354 (download PDF).
• Koutny M. Modelling Systems with Dynamic Priorities. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 353 (download PDF).
• Stewart, I.A.On a Greedy Heuristic for Finding Small Dominating Sets. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 352 (download PDF).
• Koutny M, Mancini LV, Pappalardo G. Verifying Correctness of Communicating Replicated Processes. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 351 (download PDF).
• Wright K. Parallel Treatment of Block Bi-Diagonal Matrics in the Solution of Ordinary Differentail Boundary Value Problems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 350 (download PDF).
• Shrivastava SK, Waterworth A. Using Objects and Actions to Provide Fault tolerance in Distributed, Real-Time Applications. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 349 (download PDF).
• Shrivastava SK, Ezhilchelvan PD, Speirs NA, Tao S, Tully A. Principal Features of the Voltan Family of Reliable Node Architectures for Distributed Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 348 (download PDF).
• Koelmans, A.M. and Kinniment, D.J.Verification of Timing Conditions Using a Theorem Prover. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 347 (download PDF).
• Koelmans, A.M. and Kinniment, D.J.Modelling and Verification of Timing Conditions with the Boyer-Moore Prover. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 346 (download PDF).
• Stewart, I.A.Refining Known Results on the Generalized Word Problem for Free Graphs. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 345 (download PDF).
• Barrett PA, Speirs NA. Towards an Integrated Approach to Fault Tolerance in Delta-4. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 344 (download PDF).
• Randell B, Laprie J-C. Predictably Dependable Computing Systems: Second Year Report. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 343 (download PDF).
• Stewart, I.A.On the Expressibility of Extensions of First-order Logic. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 342 (download PDF).
• de Lemos R, Saeed A, Anderson T. Requirements Specification and Verification for Safety-critical Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 341 (download PDF).
• Xu, J.The t/(n-1)-diagnosability and its Applications to Fault Tolerance. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 340 (download PDF).
• Hopkins, R.P.Distributable Nets. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 339 (download PDF).
• Stewart, I.A.Methods for Proving Completeness via Logical Reductions. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 338 (download PDF).
• Randell B, Fabre J-C. FDP Techniques in Object-oriented Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 337 (download PDF).
• Stewart, I.A.On the Capture of Complexity Classes using Logic. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 336 (download PDF).
• Stewart, I.A.Complete Problems Involving Boolean Labelled Structures and Projection. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 335 (download PDF).
• Stewart, I.A.Uniform Sequences of Branching Programs. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 334 (download PDF).
• Shrivastava SK, Ezhilchelvan PD, Speirs NA, Seaton DT. Fail-controlled Computer Architectures for Distributed Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 333 (download PDF).
• Stewart, I.A.Deciding Whether a Planar Graph has a Cubic Subgraph is NP-complete. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 332 (download PDF).
• Trouessin G, Deswarte Y, Fabre J-C, Randell B. Improvement of Data Processing Security by means of Fault Tolerance. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 331 (download PDF).
• Randell B. Coping with the Past. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 330 (download PDF).
• Hall, J.A Petri Net Semantics of Occam 2. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 329 (download PDF).
• Tully, A.Preventing State Divergence in Replicated Distributed Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 328 (download PDF).
• Randell B. Programming: From Babbage to Backus. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 327 (download PDF).
• Stewart, I.A.Logical Characterizations of Bounded Query Classes II: Polynomical-time Oracle Machines. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 326 (download PDF).
• Stewart, I.A.Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 325 (download PDF).
• Stewart, I.A.Complete Problems for Logspace Involving Lexicographic First Paths in Graphs. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 324 (download PDF).
• Stewart, I.A.On Completeness for NP via Projection Translations. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 323 (download PDF).
• Song, D.H.An Accurate Prefetching Policy for Object Oriented Systems. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 322 (download PDF).
• Burns, F.P., Kinniment, D.J. and Koelmans, A.M.Correct Interactive Transformational Synthesis of DSP Hardware. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 321 (download PDF).
• Dobson JE, McDermid JA. An Investigation into Modelling and categorisation of Non-Functional Requirements (for the Specification of Surface Naval Command Systems). Computing Laboratory. 1991. Computing Laboratory Technical Report Series 320 (download PDF).
• Little MC, Shrivastava SK. Replicated K-Resilient Objects in Arjuna. Computing Laboratory. 1991. Computing Laboratory Technical Report Series 319 (download PDF).