Volume 40, 2000

The First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT2000)
Cork, Ireland, 20th and 21st July, 2000

• 
  Anthony Karel Seda: Preface. 1-2
• 
  Howard A. Blair: The Differential Scheme for Models of Computation. 3
• 
  Howard A. Blair: Locating Self-Organization at the Edge of Chaos. 4
• 
  Vasco Brattka: Recursion and Computability over Topological Structures. 5
• 
  Bruce S. Burdick: Iterated Duals of Certain Topological Spaces. 6
• 
  Luca Cardelli, Andy Gordon, Giorgio Ghelli: Secrecy, Group Creation. 7
• 
  Iliano Cervesato: Typed Multiset Rewriting Specifications of Security Protocols. 8-51
• 
  Marco Comini, Roberta Gori, Giorgio Levi: Assertion based Inductive Verification Methods for Logic Programs. 52-69
• 
  J. W. de Bakker: Fixed Points in Metric Semantics. 70-71
• 
  Jerry den Hartog, Erik P. de Vink, J. W. de Bakker: Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice. 72-99
• 
  Alessandra Di Pierro, Herbert Wiklicky: Linear Structures for Concurrency in Probabilistic Programming Languages. 100-143
• 
  Abbas Edalat: The domain of differentiable functions. 144
• 
  Patrik Eklund, Maria A. Galán, Jesús Medina, Manuel Ojeda-Aciego, Agustín Valverde: A graphical approach to monad compositions. 145-160
• 
  Martín Hötzel Escardó: Hausdorff compactifications of topological function spaces via the theory of continuous lattices. 161
• 
  Klemens Hägele, Colm Ó'Dúnlaing, Søren Riis: The complexity of scheduling TV commercials. 162-185
• 
  Dick Hamlet: Mathematics, Computer Science, Software Engineering. 186
• 
  Reinhold Heckmann: A Non-Topological View of Dcpos as Convergence Spaces (Extended Abstract). 187
• 
  Thomas T. Hildebrandt: Categorical Models for Fairness: Completion vs Delay. 188
• 
  Pascal Hitzler, Anthony Karel Seda: On the Coincidence of Semantics for Uniquely Determined Programs. 189-205
• 
  Reinhard Kahle: Proof-theoretic notions for software maintenance. 206-219
• 
  Ralph Kopperman: The other topology. 220
• 
  Ralph Kummetz: Uniform Completion versus Ideal Completion of Posets with Projections. 221-241
• 
  Jimmie Lawson: Presentation. 242
• 
  Giorgio Levi: Abstract Interpretation Based Verification of Logic Programs. 243
• 
  Keye Martin: The space of maximal elements in a compact domain. 244-253
• 
  Stephen G. Matthews: Pixel Geometry. 254-268
• 
  Claus Pahl: A Superposition Operator for the Refinement of Algebraic Models. 269-287
• 
  John Power: Models for the computational lambda-calculus. 288-301
• 
  Steven David Prestwich: Parallel Software Performance Metrics as Continuous Functions of Event Times. 302
• 
  George M. Reed: Measurements on domains and topology. 303
• 
  Joy N. Reed, J. E. Sinclair: Refinement-Preserving Plug-In Components. 304-322
• 
  Michael D. Rice, Michael Siff: Clusters, Concepts, and Pseudometrics. 323-346
• 
  Salvador Romaguera, Michel P. Schellekens: Weightable quasi-metric semigroups and semilattices. 347-358
• 
  A. W. Roscoe, Philippa J. Broadfoot, Gavin Lowe: Data independent verification of crypto-protocols. 359
• 
  Peter Y. A. Ryan: Process Algebra and Information Flow. 360
• 
  Steve Schneider: May Testing, Non-interference, and Compositionality. 361-391
• 
  Dana S. Scott: Powersets, Fixed Points, and Lambda Calculus. 392
• 
  Michael B. Smyth, Rueiher Tsaur: A Digital Version of the Kakutani Fixed Point Theorem for Convex-valued Multifunctions. 393-407
• 
  Marc R. C. van Dongen: Polynomial Ideals, Gröbner Bases and Constraints. 408
• 
  Milan Vojvoda: Enhancements of a clock-controlled running key generator. 409
• 
  Bart Windels: Solve[order/topology == quasi-metric/x, x]. 410