Electronic Notes in Theoretical Computer Science, Volume 40

Volume 40, 2000

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