4. TAPSOFT 1991: Brighton, UK

->Volume 1

Samson Abramsky, T. S. E. Maibaum (Eds.): TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 2: Advances in Distributed Computing (ADC) and Colloquium on Combining Paradigms for Software Developmemnt (CCPSD). Lecture Notes in Computer Science 494 Springer 1991, ISBN 3-540-53981-6

ADC Advances in Distributed Computing

• J. W. de Bakker, Erik P. de Vink:
  CCS for OO and LP. 1-28
  
• Gian Luigi Ferrari, Roberto Gorrieri, Ugo Montanari:
  An Extended Expansion Theorem. 29-48
  
• Gérard Berry:
  Concurrent Abstract Machines (Abstract). 49
  
• Joseph Y. Halpern:
  Knowledge and Probability in Distributed Systems (Abstract). 50-54
  
• Ahmed Bouajjani, Joseph Sifakis:
  Verification for Finite Systems (Extended Abstract). 55-57
  
• H. Weber:
  Interactive Internetworking for Interoperating Systems (Abstract). 58-59
  

CCPSD Colloquium on Combining Paradigms for Software Development

• Ralf Jungclaus, Gunter Saake:
  Formal Specification of Object Systems. 60-82
  
• Michael Löwe, Hartmut Ehrig, Werner Fey, Dean Jacobs:
  On the Relationship Between Algebraic Module Specifications and Program Modules. 83-98
  
• Gilles Bernot:
  Testing Against Formal Specifications: A Theoretical View. 99-119
  
• Jacques Cazin, Patrice Cros, René Jacquart, Michel Lemoine, P. Michel:
  Construction and Reuse of Formal Program Developments. 120-136
  
• G. Ramalingam, Thomas W. Reps:
  A Theory of Program Modifications. 137-152
  
• Annalisa Bossi, Nicoletta Cocco, Massimo Fabris:
  Proving Termination of Logic Programs by Exploiting Term Properties. 153-180
  
• Michael Hanus:
  Parametric Order-Sorted Types in Logic Programming. 181-200
  
• Roland Dietrich, Hendrik C. R. Lock:
  Exploiting Non-Determinism through Laziness in Guarded Functional Languages. 201-216
  
• Tommaso Bolognesi, Diego Latella, Elisabetta Zuppa:
  Non-standard Interpretations of LOTOS Specifications. 217-234
  
• David A. Wright:
  A New Technique for Strictness Analysis. 235-258
  
• Rachel Cardell-Oliver:
  Using Higher Order Logic for Modelling Real-Time Protocols. 259-282
  
• Albert John Camilleri, Paola Inverardi, Monica Nesi:
  Combining Interaction and Automation in Process Algebra Verification. 283-296
  
• Ed Brinksma, Bengt Jonsson, Fredrik Orava:
  Refining Interfaces of Communicating Systems. 297-312
  
• Bernd Krieg-Brückner, Donald Sannella:
  Structuring Specifications in-the-Large and in-the-Small: Higher-Order Functions, Dependent Types and Inheritance in SPECTRAL. 313-336
  
• John-Jules Ch. Meyer, Roel Wieringa:
  Actor-Oriented System Specification with Dynamic Logic. 337-357
  
• Joachim Cramer, Werner Fey, Michael Goedicke, Martin Große-Rhode:
  Towards a Formally Based Component Description Language. 358-378
  
• Srecko Brlek, Pierre Castéran, Robert Strandh:
  On Addition Schemes. 379-393
  
• Bernhard Steffen, Jens Knoop, Oliver Rüthing:
  Efficient Code Motion and an Adaption to Strength Reduction. 394-415
  
• David de Frutos-Escrig, María-Inés Fernández-Camacho:
  On Narrowing Strategies for Partial Non-Strict Functions. 416-437
  
• Rita Loogen:
  From Reduction Machines To Narrowing Machines. 438-457
  
• Geoffrey L. Burn:
  The Evaluation Transformer Model of Reduction and Its Correctness. 458-482
  

Last update Fri May 25 08:42:55 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page