| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 18
reviews
|
|
|
 |
|
|
|
|
A slicing-based approach for locating type errors
Tip F., Dinesh T. ACM Transactions on Software Engineering and Methodology 10(1): 5-55, 2001. Type: Article
A new way of locating type errors is presented. It uses program slicing to improve the informativeness of error messages and the quality of the associated positional information. ...
|
May 1 2001 |
|
|
|
|
|
|
C and tcc: a language and compiler for dynamic code generation
Poletto M., Hsieh W., Engler D., Kaashoek M. ACM Transactions on Programming Languages and Systems 21(2): 324-369, 1999. Type: Article
The authors present ’C, an extension of C that allows the use of dynamic code generation (which is type-checked statically) by marking C expressions using a back-quote. ’C also allows users to compose arbitrary dyna...
|
Dec 1 1999 |
|
|
|
|
|
|
Modeling mobile IP in mobile UNITY
McCann P., Roman G. ACM Transactions on Software Engineering and Methodology 8(2): 115-146, 1999. Type: Article
Mobile computing presents new and interesting problems in specification and verification. Mobile IP is an Internet protocol for independently executing, possibly migrating components....
|
Oct 1 1999 |
|
|
|
|
|
|
Type-logical semantics
Carpenter B., MIT Press, Cambridge, MA, 1998. Type: Book (9780262032483)
Though this book was intended as a course on natural language semantics, due to its coverage of various logic systems, parts of it may also be appreciated by computer scientists and logicians. The book consists of 12 chapters, an appen...
|
Feb 1 1999 |
|
|
|
|
|
|
Parsing schemata and correctness of parsing algorithms
Sikkel K. (ed) Theoretical Computer Science 199(1-2): 87-103, 1998. Type: Article
Researchers interested in parsing theory in general, and comparison of parser families in particular, are the intended audience for this paper....
|
Nov 1 1998 |
|
|
|
|
|
|
Object-oriented Common Lisp
Slade S., Prentice-Hall, Inc., Upper Saddle River, NJ, 1997. Type: Book (9780136059400)
Common Lisp and its extensive standard library are introduced in this book. The first chapter gives a short history of Lisp and its dialects. After a tutorial introduction in the second chapter, the author presents lists and trees, the...
|
Dec 1 1997 |
|
|
|
|
|
|
Metric completion versus ideal completion
Majster-Cederbaum M., Baier C. Theoretical Computer Science 170(1-2): 145-171, 1996. Type: Article
The intended audience for this paper is mathematicians and those theoretical computer scientists working on the denotational semantics of parallel or concurrent programs. To model recursive or infinite behavior of programs, complete pa...
|
Sep 1 1997 |
|
|
|
|
|
|
Proving the correctness of recursion-based automatic program transformations
Sands D. Theoretical Computer Science 167(1-2): 193-233, 1996. Type: Article
This paper is intended for everyone interested in functional programming languages, and specifically for people who develop compilers for them. Its subject is program transformations such as unfold/fold. It is a companion paper to the ...
|
Aug 1 1997 |
|
|
|
|
|
|
Total correctness by local improvement in the transformation of functional programs
Sands D. ACM Transactions on Programming Languages and Systems 18(2): 175-234, 1996. Type: Article
Sands discusses program transformations (such as the unfold/fold method [1]). More specifically, this paper is about the (total) correctness of such transformations. It is intended for researchers in functional programming languages.
|
Nov 1 1996 |
|
|
|
|
|
|
Conjoining specifications
Abadi M., Lamport L. ACM Transactions on Programming Languages and Systems 17(3): 507-535, 1995. Type: Article
The authors present a method for deducing properties of a concurrent system by reasoning about its components. Specifications are given in the Temporal Logic of Actions (TLA). Both the decomposition of a system (into its components) an...
|
Aug 1 1996 |
|
|
|
|
|
| |
|
|
| |
|
|
