Papers accepted for Computing: The Australasian Theory Symposium
CATS 2002
-
A Category-Theoretic Approach to Social Network Analysis
Anthony Dekker
-
Typed Behavioural Equivalences for Processes in the Presence of Subtyping
Matthew Hennessy, Julian Rathke
-
Drawing Ruled Surfaces Using the Dual De Boor Algorithm
Rena Ding, Ian Parkin
-
Towards an Arithmetic Theory of Consistency Enforcement based on the
Preservation of \delta-Constraints
Sebastian Link, Klaus-Dieter Schewe
-
Dedekind completion as a method for constructing new Scott domains
Klaus Grue
-
On the Structure of Counterexamples to Symmetric Orderings for BDDs
Rakesh Verma, Sarah Hwang
-
Bisimulation-based Non-deterministic Admissible Interference with
Applications to the Analysis of Cryptographic Protocols
John Mullins, Stephane Lafrance
-
Efficient Algorithms for Maximum Subarray Problem by Distance Matrix Multiplication
Tadao Takaoka
-
Computing over K-modules
Neil Ghani, Anne Heyworth
-
Zooming out on Higraph-based Diagrams: Syntactic and Semantic Issues
Stuart Anderson, John Power, Konstantinos Tourlas
-
Don't Care Non-determinism in Logic Program Refinement
David Hemer, Ian Hayes, Paul Strooper, Robert Colvin
-
Sketch Data Models, Relational Schema and Data Specifications
Michael Johnson, Robert Rosebrugh