ICCL 1992: Oakland, California, USA

• A. Deutsch:
  A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. 2-13
  
• R. Nigel Horspool, Jan Vitek:
  Static analysis of PostScript code. 14-23
  
• Uday S. Reddy, Samuel N. Kamin:
  On the power of abstract interpretation. 24-33
  
• W. Zimmermann:
  Complexity issues in the design of functional languages with explicit parallelism. 34-43
  
• Lawrence A. Crowl, Thomas J. LeBlanc:
  Control abstraction in parallel programming languages. 44-53
  
• Jürgen Vollmer, R. Hoffart:
  Modula-P-a language for parallel programming definition and implementation on a transputer network. 54-64
  
• J. Allan Yang, Young-il Choo:
  Metalinguistic features for formal parallel-program transformation. 65-75
  
• Peter Thiemann:
  Optimizing structural recursion in functional programs. 76-85
  
• Charles Farnum:
  Dora-an environment for experimenting with compiler optimizers. 86-95
  
• Keith D. Cooper, Mary W. Hall, Ken Kennedy:
  Procedure cloning. 96-105
  
• E. Klein:
  Parallel ordered attribute grammars. 106-116
  
• Jens Palsberg:
  An automatically generated and provably correct compiler for a subset of Ada. 117-126
  
• Mikael Pettersson, Peter Fritzson:
  DML - a meta-language and system for the generation of practical and efficient compilers from denotational specifications. 127-136
  
• Baudouin Le Charlier, Pascal Van Hentenryck:
  Experimental evaluation of a generic abstract interpretation algorithm for Prolog. 137-146
  
• Lunjin Lu, Peter Greenfield:
  Abstract fixpoint semantics and abstract procedural semantics of definite logic programs. 147-154
  
• Philippe Codognet, Gilberto Filé:
  Computations, abstractions and constraints in logic programs. 155-164
  
• Timothy A. Budd:
  Multiparadigm data structures in Leda. 165-173
  
• Bjørn N. Freeman-Benson, Alan Borning:
  The design and implementation of Kaleidoscope'90-A constraint imperative programming language. 174-180
  
• T. Yoshikawa:
  A visual knowledge representation language for layout problem. 181-189
  
• Shigeo Sugimoto, Tetsuo Sakaguchi, Koichi Tabata:
  Layered architecture of multiple programming language system for multiparadigm programming. 190-199
  
• Mary Shaw, William A. Wulf:
  Toward relaxing assumptions in languages and the1r implementations. 202-211
  
• J. A. Trescher:
  Compositional specification of parallel time-critical systems. 212-221
  
• Sanjay Gadkari:
  Abstract data groups: structuring distributed programs as layers. 222-231
  
• R. Gupta:
  SPMD execution of programs with dynamic data structures on distributed memory machines. 232-241
  
• Laurie J. Hendren, Guang R. Gao:
  Designing programming languages for analyzability: a fresh look at pointer data structures. 242-251
  
• Richard H. Crawford, Ronald A. Olsson, W. Wilson Ho, Christopher E. Wee:
  Semantic issues in the design of languages for debugging. 252-261
  
• Angelika Zobel:
  Program structure as basis for parallelizing global register allocation. 262-271
  
• Murali Sitaraman:
  A class of programming language mechanisms to facilitate multiple implementations of the same specification. 272-281
  
• Gilad Bracha, Gary Lindstrom:
  Modularity meets inheritance. 282-290
  
• William H. Harrison, Harold Ossher:
  Attaching instance variables to method realization1 instead of classes. 291-299
  
• A. M. Alashqur, Stanley Y. W. Su, Herman Lam:
  Constraint specification on object-oriented databases. 300-309
  
• Henri E. Bal:
  Parallel programming in SR. 310-319
  
• Joshua S. Auerbach, David F. Bacon, Arthur P. Goldberg, Germán S. Goldszmidt, Ajei S. Gopal, Mark T. Kennedy, Andy Lowry, James R. Russell, William Silverman, Robert E. Strom, Daniel M. Yellin, Shaula Yemini:
  High-level language support for programming distributed systems. 320-330
  
• L. Gunaseelan, Richard J. LeBlanc:
  Distributed Eiffel: a language for programming multi-granular distributed objects on the Clouds operating system. 331-340