Science of Computer Programming, Volume 31

Volume 31, Number 1, May 1998

• Tania Armstrong, Kim Marriott, Peter Schachte, Harald Søndergaard:
  Two Classes of Boolean Functions for Dependency Analysis. 3-45
  
• Anindya Banerjee, David A. Schmidt:
  Stackability in the Simply-Typed Call-by-Value lambda Calculus. 47-73
  
• Nicolas Halbwachs:
  About Synchronous Programming and Abstract Interpretation. 75-89
  
• Laurent Mauborgne:
  Abstract Interpretation Using Typed Decision Graphs. 91-112
  
• Kirsten Lackner Solberg Gasser, Hanne Riis Nielson, Flemming Nielson:
  Strictness and Totality Analysis. 113-145
  
• Kwangkeun Yi:
  An Abstract Interpretation for Estimating Uncaught Exceptions in Standard ML Programs. 147-173
  

Volume 31, Numbers 2-3, July 1998

• Jean-Marc Andreoli, François Pacull, Daniele Pagani, Remo Pareschi:
  Multiparty Negotiation of Dynamic Distributed Object Services. 179-203
  
• Jan A. Bergstra, Paul Klint:
  The Discrete Time TOOLBUS - A Software Coordination Architecture. 205-229
  
• Paolo Ciancarini, M. Mazza, L. Pazzaglia:
  A Logic for a Coordination Model with Multiple Spaces. 231-261
  
• Pascal Fradet, Daniel Le Métayer:
  Structured Gamma. 263-289
  
• Munehiro Fukuda, Lubomir Bic, Michael B. Dillencourt, Fehmina Merchant:
  Distributed Coordination with MESSENGERS. 291-311
  
• Henk Goeman, Joost N. Kok, Kaisa Sere, Rob T. Udink:
  Coordination in the ImpUNITY Framework. 313-334
  
• Antony I. T. Rowstron, Alan Wood:
  Solving the Linda Multiple rd Problem Using the Copy-Collect Primitive. 335-358
  
• Robert Tolksdorf:
  Laura - A Service-Based Coordination Language. 359-381
  

Last update Sat May 18 20:52:09 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page