5. TAPSOFT 1993: Orsay, France

Invited Survey

• John V. Guttag:
  Goldilocks and the Three Specifications. 1-14
  

Invited Conference

• Pierpaolo Degano, Roberto Gorrieri, Sebastiano Vigna:
  On Relating Some Models for Concurrency. 15-30
  

CAAP: Specifications and Proofs

• Hartmut Ehrig, Rosa M. Jiménez, Fernando Orejas:
  Compositionality Results for Different Types of Parameterization and Parameter Passing in Specification Languages. 31-45
  
• Klaus Becker:
  Proving Ground Confluence and Inductive Validity in Constructor Based Equational Specifications. 46-60
  
• Leo Bachmair, Ta Chen, I. V. Ramakrishnan:
  Associative-Commutative Discrimination Nets. 61-74
  

FASE: Case Studies in Formal Design and Development

• Yves Bertrand, Jean-François Dufourd, Jean Françon, Pascal Lienhardt:
  Algebraic Specification and Development in Geometric Modeling. 75-89
  
• Ernst-Rüdiger Olderog, Stephan Rössig:
  A Case Study in Transformational Design of Concurrent Systems. 90-104
  
• Paola Inverardi, Balachander Krishnamurthy, Daniel Yankelevich:
  Yeast: A Case Study for a Practical Use of Formal Methods. 105-120
  

Invited Conference

• André Arnold:
  Verification and Comparison of Transition Systems. 121-135
  

Invited Survey

• Cliff B. Jones:
  Constraining Inference in an Object-Based Design Model. 136-150
  

CAAP: Concurrency

• Davide Sangiorgi:
  From pi-Calculus to Higher-Order pi-Calculus - and Back. 151-166
  
• Gnanamalar David, Frank Drewes, Hans-Jörg Kreowski:
  Hyperedge Replacement with Rendevous. 167-181
  
• Jean-Marc Andreoli, Lone Leth, Remo Pareschi, Bent Thomsen:
  True Concurrency Semantics for a Linear Logic Programming Language with Braodcast Communication. 182-198
  

FASE: Compositionality, Modules and Development

• Michel Bidoit, Rolf Hennicker:
  A General Framework for Modular Implementations of Modular System Specifications. 199-214
  
• Mark T. Vandevoorde:
  Specifications Can Make Programs Run Faster. 215-229
  
• Pierre Collette:
  Application of the Composition Principle to Unity-like Specifications. 230-242
  

Invited Conference

• Nachum Dershowitz:
  Trees, Ordinals and Termination. 243-250
  

CAAP: Automata and Counting

• Helmut Seidl:
  When Is a Functional Tree Transduction Deterministic? 251-265
  
• Danièle Beauquier, Damian Niwinski:
  Automata on Infinite Trees with Counting Constraints. 266-281
  
• Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli:
  Directed Column-Convex Polyominoes by Recurrence Relations. 282-298
  

FASE: Formal Development

• Jun Han, Jim Welsh:
  Object Organisation in Software Environments for Formal Methods. 299-313
  
• Françoise Bellegarde, James Hook:
  Monads, Indexes and Transformations. 314-327
  
• Ricardo Pena, Luis M. Alonso:
  A Technique for Specifying and Refining TCSP Processes by Using Guards and Liveness Conditions. 328-342
  

Invited Survey

• Bernd Mahr:
  Applications of Type Theory. 343-355
  

CAAP: Constraint Solving

• Joachim Niehren, Andreas Podelski:
  Feature Automata and Recognizable Sets of Feature Trees. 356-375
  
• Alexandre Boudet, Hubert Comon:
  About the Theory of Tree Embedding. 376-390
  
• Zhenyu Qian:
  Linear Unification of Higher-Order Patterns. 391-405
  

FASE: Foundations and Analysis of Formal Specifications

• Wei Li:
  A Theory of Requirements Capture and Its Applications. 406-420
  
• Gilles Bernot, Pascale Le Gall:
  Exception Handling and Term Labelling. 421-436
  
• Fosca Giannotti, Diego Latella:
  Gate Splitting in LOTOS Specifications Using Abstract Interpretation. 437-452
  

Invited Survey

• Hans-Dieter Ehrich, Grit Denker, Amílcar Sernadas:
  Constructing Systems as Object Communities. 453-467
  

CAAP: Rewriting

• Andrea Corradini:
  Term Rewriting in CT-Sigma. 468-484
  
• Andrea Asperti, Cosimo Laneve:
  Optimal Reductions in Interaction Systems. 485-500
  
• Laurence Puel, Ascánder Suárez:
  Optimal Solutions to Pattern Matching Problems. 501-518
  

FASE: Verification of Concurrent Systems

• Ming Yu Yao, Gregor von Bochmann:
  Testing for a Conformance Relation Based on Acceptance. 519-528
  
• Khalil Drira, Pierre Azéma, B. Soulas, A. M. Chemali:
  Testability of a Communicating System Through an Environment. 529-543
  
• Carron Kirkwood:
  Automating (Specififation = Implementation) Using Equational Reasoning and LOTOS. 544-558
  

Invited Survey

• Wolfgang Thomas:
  On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science. 559-568
  

CAAP: Logic and Trees

• Jerzy Tyszkiewicz:
  On Asymptotic Probabilities in Logics That Capture DSPACE(log n) in Presence of Ordering. 569-583
  
• Mohsin Ahmed, G. Venkatesh:
  A Propositional Dense Time Logic (Based on Nested Sequences). 584-598
  
• J. Bétréma, A. K. Zvonkin:
  La Vraie Forme d'un Arbre. 599-612
  

FASE: Model Checking

• Javier Esparza:
  Model Checking Using Net Unfoldings. 613-628
  
• Claire Diehl, Claude Jard, Jean-Xavier Rampon:
  Reachability Analysis on Distributed Executions. 629-643
  
• Susanne Graf, Claire Loiseaux:
  Property Preserving Abstractions under Parallel Composition. 644-657
  

Invited Conference

• Giuseppe Longo:
  Types as Parameters. 658-670
  

CAAP-FASE: Type Inference

• Geoffrey Smith:
  Polymorphic Type Inference with Overloading and Subtyping. 671-685
  
• Jerzy Tiuryn, Mitchell Wand:
  Type Reconstruction with Recursive Types and Atomic Subtyping. 686-701
  

CAAP: Analysis of Algorithms

• Uwe Trier:
  (Un)expected Path Lengths of Asymmetric Binary Search Trees. 702-716
  
• Guy Louchard:
  Trie Size in a Dynamic List Structure. 717-731
  

FASE: Parallel Calculus

• Diego Latella, Paola Quaglia:
  A Fully Parallel Calculus of Synchronizing Processes. 732-745
  
• E. Pascal Gribomont, Vincent Van Dongen:
  Generic Systolic Arrays: A Methodology for Systolic Design. 746-761