Theoretical Computer Science, Volume 167

Volume 167, Numbers 1&2, 30 October 1996

• Peter D. Mosses, Mogens Nielsen, Michael I. Schwartzbach:
  Foreword: Special Volume of TAPSOFT 1995 Papers. 1
• Martin Hofmann, Donald Sannella:
  On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic. 3-45
  
• Bengt Jonsson, Yih-Kuen Tsay:
  Assumption/Guarantee Specifications in Linear-Time Temporal Logic. 47-72
  
• Dexter Kozen:
  Rational Spaces and Set Constraints. 73-94
  
• Aart Middeldorp, Satoshi Okui, Tetsuo Ida:
  Lazy Narrowing: Strong Completeness and Eager Variable Elimination. 95-130
  
• Shmuel Sagiv, Thomas W. Reps, Susan Horwitz:
  Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation. 131-170
  
• Kai Salomaa:
  Decidability of Equivalence for Deterministic Synchronized Tree Automata. 171-192
  
• David Sands:
  Proving the Correctness of Recursion-Based Automatic Program Transformations. 193-233
  
• Davide Sangiorgi:
  pi-Calculus, Internal Mobility, and Agent-Passing Calculi. 235-274