Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Holt, Christopher
University of Newcastle
Tyne, United Kingdom
  Follow this Reviewer
 
 
 
Options:
Date Reviewed  
 
1
- 10 of 14 reviews

   
  In black and white: an integrated approach to class-level testing of object-oriented programs
Chen H., Tse T., Chan F., Chen T. ACM Transactions on Software Engineering and Methodology 7(3): 250-295, 1998.  Type: Article

This paper is concerned with devising tests to help determine whether the implementation of an object satisfies its specification. A specification is assumed to follow the OBJ style of multisorted initial algebras, where the equations ...

Jul 1 1999  
  An Efficient Solution to the Cache Thrashing Problem Caused by True Data Sharing
Jin G., Li Z., Chen F. IEEE Transactions on Computers 47(5): 527-543, 1998.  Type: Article

The authors are concerned with the problem of loops over large matrices, in which matrix elements are accessed and modified via nontrivial dependency relationships. That is, a given element may be needed more than once, and/or modified...

Dec 1 1998  
  Singular and plural nondeterministic parameters
Walicki M., Meldal S. SIAM Journal on Computing 26(4): 991-1005, 1997.  Type: Article

The authors examine how nondeterminism interacts with the various ways by which parameters can be passed to procedures. For example, the binding of a nondeterministic variable to a particular value can be forced at the time of a proced...

Aug 1 1998  
  Notes on the methodology of CCS and CSP
van Glabbeek R. Theoretical Computer Science 177(2): 329-349, 1997.  Type: Article

The author compares calculus of communicating systems (CCS) with communicating sequential processes (CSP), noting the ways in which they are similar and how they differ. He describes operational semantics, bisimulation, traces, and whe...

Feb 1 1998  
  Lisp in small pieces
Queinnec C., Callaway K. (trans.), Cambridge University Press, New York, NY, 2003.  Type: Book (9780521562478)

The author of this book about Lisp and Scheme implementations has an unintrusive “hidden” agenda: he wants people to download and use his fast implementation of a restricted, object-oriented extension to Lisp/Scheme...

Dec 1 1997  
  Type classes in Haskell
Hall C., Hammond K., Peyton Jones S., Wadler P. ACM Transactions on Programming Languages and Systems 18(2): 109-138, 1996.  Type: Article

Type inferencing in a subset of Haskell that contains overloading (but not pattern matching) is described. The process involves adding extra parameters to overloaded functions, thus making the previously implicit typing explicit. Rules...

Mar 1 1997  
  Implicit system specification and the interface equation
Shields M. The Computer Journal 32(5): 399-412, 1989.  Type: Article

The CCS model of interprocess communication lends itself to the specification of module interfaces in terms of structures of messages. When a weakly determinate module q is specified and is broken into two submodules, one of whi...

Nov 1 1990  
  Optimum lopsided binary trees
Kapoor S., Reingold E. Journal of the ACM 36(3): 573-590, 1989.  Type: Article

A lopsided binary tree has two weights (a and b) associated with its edges, one for left children and one for right children. Minimum weighted depths for the worst case (maximum depth) and average case (average depth) are...

May 1 1990  
  Equational logic of circular data type specification
Bloom S., Esik Z. Theoretical Computer Science 63(3): 303-331, 1989.  Type: Article

One can define abstract data types by using algebras with sorts, operations, and systems of equations; recursive, or “circular,” data types (such as stacks and trees) are fixed-point solutions to such equations. Alg...

Oct 1 1989  
  Three recent approaches to temporal reasoning
Sadri F. (ed), Academic Press Prof., Inc., San Diego, CA, 1987.  Type: Book (9789780122740602)

Three temporal logic systems are compared; all are non-modal (that is, time is explicit) and assume linear time. Kowalski and Sergot’s calculus (to be implemented in Prolog?) defines events as discrete points on a time line. ...

Sep 1 1988  
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy