AMAST Mail Latest Update
[Prev][Next][Index]

CfParticipation: CATS 2001, Australia



                       Call for Participation

            COMPUTING: THE AUSTRALASIAN THEORY SYMPOSIUM

                    29-30 January 2001, Australia


Computing: The Australasian Theory Symposium (CATS) is the premier
theoretical computer science conference in Australasia.  It is held
annually as part of Australasian Computer Science Week (ACSW).  CATS
2001 will be the seventh in the series.  The symposium will consist of
invited speakers and research paper presentations.


SCOPE

CATS covers all aspects of theoretical computer science.
Representative, but not exclusive, areas of interest include the
following:
  - logic, reasoning and verification
  - formal specification techniques and program semantics
  - formal development methods, program refinement,
    synthesis and transformation
  - concurrent, parallel and distributed system theory
  - theory of algorithms and data structures
  - complexity and computability
  - automata, number and category theory
  - tools for automated reasoning, and
    program analysis and development


DATES AND LOCATION

CATS 2001 will be held during Australasian Computer Science Week,
organised by the Computer Science Association.  ACSW 2001 is jointly
hosted by Bond University and Griffith University, Gold Coast
Campus. The ACSW conference will be held on the Bond University
Campus, Gold Coast, Queensland, Australia, from 29th January to 2nd
February 2001.  The CATS sessions are scheduled for Monday 29th and
Tuesday 30th January 2001.


REGISTRATION, ACCOMMODATION AND TRAVEL

Registration, accommodation and travel for CATS 2001 will be organised
centrally as part of Australasian Computer Science Week.  See the ACSW
2001 web page (http://www.it.bond.edu.au/acsw2001/) for details.


KEYNOTE ADDRESSES

* Prof Mathai Joseph
  (Tata Research Development and Design Centre, Pune, India)
  "Meta-Modelling for Formal Software Development"
  (with A. Sreenivas and R. Venkatesh)

* Prof Carroll Morgan (Software Engineering Research Group,
  Department of Computer Science and Engineering, University of New
  South Wales)
  "Almost-Certain Eventualities and Abstract Probabilities in the
  Temporal Logic PTL" (with A. McIver)


REGULAR PAPERS

* A. Arslanov (Monash University, Aus)
  "On Elementary Computability-Theoretic Properties of Algorithmic
  Randomness"

* K. Baba (Kyushu University, Japan), S. Hirokawa (Kyushu University,
  Japan) and K. Fujita (Shimane University, Japan)
  "Parallel Reduction in Type Free lambda-mu Calculus"

* A. Cerone (University of Queensland, Aus)
  "Axiomatisation of an Interval Calculus for Theorem Proving"

* J. E. Dawson and R. Gore (Australian National University, Aus)
  "Embedding Display Calculi into Logical Frameworks: Comparing Twelf
  and Isabelle"

* S. Dunne (University of Teesside, UK)
  "Abstract Commands: a Uniform Notation for Specification and
  Implementation"

* J. Ford and I. A. Mason (University of New England, Aus)
  "Operational Techniques in PVS -A Preliminary Evaluation"

* T. Gerdsmeier and R. Cardell-Oliver (University of Essex, UK)
  "Analysis of Scheduling Behaviour using Generic Timed Automata"

* S. La Torre and M. Napoli (Universita degli Studi di Salerno, Italy)
  "A Model of Finite Automata on Timed omega-Trees"

* S. Link and K.-D. Schewe (Massey University, NZ)
  "Computability and Decidability Issues in the Theory of Consistency
  Enforcement"

* A. Martin (Oxford University, UK) and C. J. Fidge (University of
  Queensland, Aus)
  "Lifting in Z"

* T. Mizutani (University of Tsukuba, Japan), S. Igarashi (University
  of Tsukuba, Japan) and M. Shio (Tokiwa University, Japan)
  "Representation of a Discretely Controlled Continuous System in
  Tense Arithmetic"

* S. Saunders and T. Takaoka (University of Canterbury, NZ)
  "Improved Shortest Path Algorithms for Nearly Acyclic Graphs"

* P. Schachte (University of Melbourne, Aus)
  "Precise Goal-Independent Abstract Interpretation of Constraint Logic
  Programs"

* J. Shield, I. J. Hayes and D. A. Carrington (University of
  Queensland, Aus)
  "Using Theory Interpretation to Mechanise the Reals in a Theorem
  Prover"


PROCEEDINGS

The proceedings of CATS 2001 will be published by Elsevier Science as
Volume 42 of the series Electronic Notes in Theoretical Computer
Science.  ENTCS is an electronic series associated with the journal
Theoretical Computer Science, and published by Elsevier Science B. V.
(The proceedings of CATS 2000 appeared as ENTCS Volume 31.)  A
hardcopy Preliminary Proceedings will be provided to conference
attendees.


PROGRAMME COMMITTEE

Mariangiola Dezani-Ciancaglini, Universita di Torino, Italy
Rod Downey, Victoria University of Wellington, New Zealand
Colin Fidge (Chair), The University of Queensland, Australia
Lance Fortnow, NEC Research Institute, USA
Joseph Goguen, University of California at San Diego, USA
Andrew Martin, Oxford University, United Kingdom
Ian Mason, University of New England, Australia
Janos Pach, New York University, USA
Igor Shparlinski, Macquarie University, Australia
Mark Utting, University of Waikato, New Zealand
Emo Welzl, ETH Zurich, Switzerland


ACSW GENERAL CHAIRS

Gopal Gupta, Bond University
Greg Cranitch, Griffith University


UPDATES AND NEWS

Up to date information about the CATS 2001 conference can be found at
its web site: http://www.csee.uq.edu.au/~cats01/


ENQUIRIES

Dr Colin Fidge (CATS 2001 Programme Chair)
Software Verification Research Centre
The University of Queensland
Queensland 4072
Australia
Fax: +61 7 3365 1533
Email: cats01@svrc.uq.edu.au
[ AMAST Mail Latest Update | AMAST Mail Meta-Index | December 2000 | AMAST Mail 2000 | AMAST ]