Volume 42, 2001

Computing: The Australasian Theory Symposium (CATS 2001)
Gold Coast, Australia, 29-30 January 2001
Guest Editor: Colin J. Fidge

• 
  Ashok Sreenivas, R. Venkatesh, Mathai Joseph: Meta-Modelling for Formal Software Development. 1-11
• 
  Annabelle McIver, Carroll Morgan: Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL. 12-40
• 
  Asat Arslanov: On Elementary Computability-Theoretic Properties of Algorithmic Randomness. 41-51
• 
  Kensuke Baba, Sachio Hirokawa, Ken-etsu Fujita: Parallel Reduction in Type Free lambda/mu-Calculus. 52-66
• 
  Antonio Cerone: Axiomatisation of an Interval Calculus for Theorem Proving. 67-88
• 
  Jeremy E. Dawson, Rajeev Goré: Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle. 89-103
• 
  Steve Dunne: Abstract Commands: a Uniform Notation for Specification and Implementation. 104-123
• 
  Jonathan M. Ford, Ian A. Mason: Operational Techniques in PVS - A Preliminary Evaluation. 124-142
• 
  Thorsten Gerdsmeier, Rachel Cardell-Oliver: Analysis of Scheduling Behaviour using Generic Timed Automata. 143-157
• 
  Salvatore La Torre, Margherita Napoli: A Model of Finite Automata on Timed omega-Trees. 158-173
• 
  Sebastian Link, Klaus-Dieter Schewe: Computability and Decidability Issues in the Theory of Consistency Enforcement. 174-196
• 
  Andrew Martin, Colin J. Fidge: Lifting in Z. 197-219
• 
  Tetsuya Mizutani, Shigeru Igarashi, Masayuki Shio: Representation of a Discretely Controlled Continuous System in Tense Arithmetic. 220-231
• 
  Shane Saunders, Tadao Takaoka: Improved Shortest Path Algorithms for Nearly Acyclic Graphs. 232-248
• 
  Peter Schachte: Precise Goal-Independent Abstract Interpretation of Constraint Logic Programs. 249-265
• 
  Jamie Shield, Ian J. Hayes, David A. Carrington: Using Theory Interpretation to Mechanise the Reals in a Theorem Prover. 266-281
• 
  Colin J. Fidge: Preface. 282-283