## Volume 42,
2001

Computing:
The Australasian Theory Symposium (CATS 2001)

Gold Coast,
Australia,
29-30 January 2001

Guest Editor:
Colin J. Fidge
- Colin J. Fidge:

**Preface.
**

- Ashok Sreenivas, R. Venkatesh, Mathai Joseph:

**Meta-Modelling for Formal Software Development.
**

- Annabelle McIver, Carroll Morgan:

**Almost-Certain Eventualities and Abstract Probabilities in the Temporal Logic PTL.
**

- Asat Arslanov:

**On Elementary Computability-Theoretic Properties of Algorithmic Randomness.
**

- Kensuke Baba, Sachio Hirokawa, Ken-etsu Fujita:

**Parallel Reduction in Type Free lambda/mu-Calculus.
**

- Antonio Cerone:

**Axiomatisation of an Interval Calculus for Theorem Proving.
**

- Jeremy E. Dawson, Rajeev Goré:

**Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle.
**

- Steve Dunne:

**Abstract Commands: a Uniform Notation for Specification and Implementation.
**

- Jonathan M. Ford, Ian A. Mason:

**Operational Techniques in PVS - A Preliminary Evaluation.
**

- Thorsten Gerdsmeier, Rachel Cardell-Oliver:

**Analysis of Scheduling Behaviour using Generic Timed Automata.
**

- Salvatore La Torre, Margherita Napoli:

**A Model of Finite Automata on Timed omega-Trees.
**

- Sebastian Link, Klaus-Dieter Schewe:

**Computability and Decidability Issues in the Theory of Consistency Enforcement.
**

- Andrew Martin, Colin J. Fidge:

**Lifting in Z.
**

- Tetsuya Mizutani, Shigeru Igarashi, Masayuki Shio:

**Representation of a Discretely Controlled Continuous System in Tense Arithmetic.
**

- Shane Saunders, Tadao Takaoka:

**Improved Shortest Path Algorithms for Nearly Acyclic Graphs.
**

- Peter Schachte:

**Precise Goal-Independent Abstract Interpretation of Constraint Logic Programs.
**

- Jamie Shield, Ian J. Hayes, David A. Carrington:

**Using Theory Interpretation to Mechanise the Reals in a Theorem Prover.
**

Copyright © Mon Mar 15 04:07:06 2010
by Michael Ley (ley@uni-trier.de)