| |
 |
|
|
Jourdan, Martin
INRIA
Le Chesnay, France
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 11
reviews
|
|
|
|
|
|
|
|
Data structures using C and C++ (2nd ed.)
Langsam Y., Augenstein M., Tenenbaum A., Prentice Hall Press, Upper Saddle River, NJ, 1995. Type: Book (9780130369970)
Designed for a two-semester course in data structures, algorithms, and programming, this textbook closely follows the sample “Data Structures and Analysis of Algorithms” course presented in the ACM/IEEE Computing...
|
Feb 1 1997 |
|
|
|
|
|
|
Modularity and reusability in attribute grammars
Kastens U., Waite W. Acta Informatica 31(7): 601-627, 1994. Type: Article
The authors present several notational concepts for attribute grammars (AGs): upward and downward remote attribute access, symbol computations, inheritance, and cumulative attribution. Taken separately, these tools have the virtue of m...
|
Nov 1 1995 |
|
|
|
|
|
|
Talking about modules and delivery
Davis H., Parquier P., Séniak N. ACM SIGPLAN Lisp Pointers VII(3): 113-120, 1994. Type: Article
The design of languages in the LISP family generally provides little support for a real module system and the possibility of delivering stripped-down, closed applications; indeed, most implementations call for a single “world...
|
Aug 1 1995 |
|
|
|
|
|
|
Data structures and algorithm analysis in C++
Weiss M., Benjamin-Cummings Publ. Co., Inc., Redwood City, CA, 1994. Type: Book (9780805354430)
The purpose of this textbook is threefold. First, a number of data structures are presented, ranging from the simplest ones, such as lists and stacks, to more modern and efficient ones such as Fibonacci heaps, skew heaps, binomial queu...
|
May 1 1995 |
|
|
|
|
|
|
A visual execution model for Ada tasking
Dillon L. (ed) ACM Transactions on Software Engineering and Methodology 2(4): 311-345, 1993. Type: Article
Designing and programming systems of concurrent tasks is known to be a difficult problem. High-level languages such as Ada can hide the tedious details of interprocess synchronization and communication, but their precise semantics is f...
|
Aug 1 1994 |
|
|
|
|
|
|
No assembly required: compiling standard ML to C
Tarditi D., Lee P., Acharya A. ACM Letters on Programming Languages and Systems 1(2): 161-177, 1992. Type: Article
The authors show how ML, a higher-order functional language, can be implemented both quickly and efficiently on most commercial computers by compiling it to C, used as a portable intermediate language. The authors’ compiler, ...
|
Jan 1 1994 |
|
|
|
|
|
|
Coloring register pairs
Briggs P., Cooper K., Torczon L. ACM Letters on Programming Languages and Systems 1(1): 3-13, 1992. Type: Article
Register allocation is one of the tasks of a compiler back end that is crucial for producing efficient code. One of the best-performing register allocation algorithms up to now was developed by Chaitin and colleagues and is based on gr...
|
Oct 1 1993 |
|
|
|
|
|
|
Advanced C++ programming styles and idioms
Coplien J., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1992. Type: Book (9780201548556)
By showing how C++ can be used to solve software problems efficiently and by giving a feel for its styles and idioms, this book aims at helping programmers who have already learned C++ to develop their programming expertise. It shows h...
|
Nov 1 1992 |
|
|
|
|
|
|
Optimizing schemes for structured programming language processors
Tsuji T., Ellis Horwood, Upper Saddle River, NJ, 1990. Type: Book (9780138551230)
A common problem with preprocessors and compilers for high-level structured programming languages (those that have constructs such as if-then-else, while-do, and repeat-until) is that, for the sake of simplicity, t...
|
Apr 1 1992 |
|
|
|
|
|
|
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
Burke M. ACM Transactions on Programming Languages and Systems 12(3): 341-395, 1990. Type: Article
In this respectable research paper the author presents an original method to solve the archetypal interprocedural dataflow problem of computing the MOD and REF sets for each procedure in a complete program. His method is based on the d...
|
May 1 1991 |
|
|
|
|
|
| |
|
|
| |
|
|
