REX Workshop 1989: Mook, The Netherlands

Invited Lecture

• Martín Abadi, Leslie Lamport:
  Composing Specifications. 1-41
  

Technical Contributions

• Ralph-Johan Back, Joakim von Wright:
  Refinement Calculus, Part I: Sequential Nondeterministic Programs. 42-66
  
• Ralph-Johan Back:
  Refinement Calculus, Part II: Parallel and Reactive Programs. 67-93
  
• Howard Barringer, Michael Fisher, Dov M. Gabbay, Graham Gough, Richard Owens:
  METATEM: A Framework for Programming in Temporal Logic. 94-129
  
• Ed Brinksma:
  Constraint-Oriented Specification in a Constructive Formal Description Technique. 130-152
  
• Manfred Broy:
  Functional Specification of Time Sensitive Communicating Systems. 153-179
  
• Werner Damm, Gert Döhmen, Volker Gerstner, Bernhard Josko:
  Modular Verification of Petri Nets: The Temporal Logic Approach. 180-207
  
• Eduard Diepstraten, Ruurd Kuiper:
  Abadi & Lamport and Stark: towards a Proof Theory for Stuttering, Dense Domains and Refinement Mappings. 208-238
  
• Hans-Dieter Ehrich, Amílcar Sernadas:
  Algebraic Implementation of Objects over Objects. 239-266
  
• Rob J. van Glabbeek, Ursula Goltz:
  Refinement of Actions in Causality Based Models. 267-300
  
• Martin Große-Rhode, Hartmut Ehrig:
  Transformation of Combined Data Type and Process Specifications Using Projection Algebras. 301-339
  
• Jifeng He:
  Various Simulations and Refinements. 340-360
  
• Bengt Jonsson:
  On Decomposing and Refining Specifications of Distributed Systems. 361-385
  
• Bernhard Josko:
  Verifying the Correctness of AADL Modules Using Model Checking. 386-400
  
• Joost N. Kok:
  Specializtion in Logic Programming: from Horn Clause Logic to Prolog and Concurrent Prolog. 401-413
  
• Robert P. Kurshan:
  Analysis of Discrete Event Coordination. 414-453
  
• Simon S. Lam, A. Udaya Shankar:
  Refinement and Projection of Relational Specifications. 454-486
  
• Kim Guldstrand Larsen:
  Compositional Theories Based on an Operational Semantics of Contexts. 487-518
  
• Nancy A. Lynch:
  Multivalued Possibilities Mappings. 519-543
  
• Michael Merritt:
  Completeness Theorems for Automata. 544-560
  
• Tobias Nipkow:
  Formal Verification of Data Type Refinement - Theory and Practice. 561-591
  
• Ernst-Rüdiger Olderog:
  From Trace Specifications to Process Terms. 592-621
  
• Paritosh K. Pandya:
  Some Comments on the Assumption-Commitment Framework for Compositional Verification of Distributed Programs. 622-640
  
• Lucia Pomello:
  Refinement of Concurrent Systems Based on Local State Transformations. 641-668
  
• A. Udaya Shankar, Simon S. Lam:
  Construction of Network Protocols by Stepwise Refinement. 669-695
  
• Frank A. Stomp:
  A Derivation of a Broadcasting Protocol Using Sequentially Phased Reasoning. 696-730
  
• Jeannette M. Wing:
  Verifying Atomic Data Types. 731-758
  
• Job Zwiers:
  Predicated, Predicate Transformers and Refinement. 759-776
  
• Rob Gerth:
  Foundations of Compositional Program Refinement - Safety Properties. 777-807