Formal Aspects of Computing, Volume 11

Volume 11, Number 1, 1999

• David A. Duce, David J. Duke, Giorgio P. Faconti, Ivan Herman:
  The Changing Face of Standardization: A Place for Formal Methods? 1-20
  
• Dang Van Hung, Zhou Chaochen:
  Probabilistic Duration Calculus for Continuous Time. 21-44
  
• Wim H. Hesselink:
  The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract. 45-55
  
• K. Rustan M. Leino:
  Computing Permutation Encodings. 56-74
  
• Brendan P. Mahony:
  The Least Conjunctive Refinement and Promotion in the Refinement Calculus. 75-105
  

Volume 11, Number 2, 1999

• David J. Duke, Bob Fields, Michael D. Harrison:
  A Case Study in the Specification and Analysis of Design Alternatives for a User Interface. 107-131
  
• Howard Bowman, Giorgio P. Faconti:
  Analysing Cognitive Behaviour using LOTOS and Mexitl. 132-159
  
• Monica Nesi:
  Formalising a Value-Passing Calculus in HOL. 160-199
  
• Richard S. Bird, Ross Paterson:
  Generalised folds for nested datatypes. 200-222
  

Volume 11, Number 3, 1999

• Yves Bertot:
  The CtCoq System: Design and Architecture. 225-243
  
• Richard Bornat, Bernard Sufrin:
  A Minimal Graphical User Interface for the Jape Proof Calculator. 244-271
  
• Joseph A. Goguen:
  Social and Semiotic Analyses for Theorem Prover User Interface Design 1. 272-301
  
• Andrew Ireland, Michael Jackson, Gordon Reid:
  Interactive Proof Critics. 302-325
  
• Jörg H. Siekmann, Stephan M. Hess, Christoph Benzmüller, Lassaad Cheikhrouhou, Armin Fiedler, Helmut Horacek, Michael Kohlhase, Karsten Konrad, Andreas Meier, Erica Melis, Martin Pollet, Volker Sorge:
  L<Omega>UI: Lovely <Omega>MEGA User Interface. 326-342
  
• Koichi Takahashi, Masami Hagiya:
  Proving as Editing HOL Tactics. 343-357
  

Volume 11, Number 4, 1999

• Martin C. Henson, Steve Reeves:
  Revising Z: Part I - Logic and Semantics. 359-380
  
• Martin C. Henson, Steve Reeves:
  Revising Z: Part II - Logical Development. 381-401
  
• A. Prasad Sistla, Viktor Gyuris:
  Parameterized Verification of Linear Networks using Automata as Invariants. 402-425
  
• Philippe Audebaud, Elena Zucca:
  Deriving Proof Rules from Continuation Semantics. 426-447
  
• Olivier Roux, Vlad Rusu, Franck Cassez:
  Hybrid Verifications of Reactive Programs. 448-471
  
• Steve King:
  `The Standard Logic for Z': A Clarification. 472-473
  

Volume 11, Number 5, 1999

• Amy P. Felty, Frank A. Stomp:
  Cache Coherency in SCI: Specification and a Sketch of Correctness. 475-497
  
• Richard Banach, Michael Poppleton:
  Sharp Retrenchment, Modulated Refinement and Simulation. 498-540
  
• Thomas Kleymann:
  Hoare Logic and Auxiliary Variables. 541-566
  
• David H. Pitt, M. W. Shields:
  Overtaking in Asynchronous Periodic Systems. 567-590
  

Volume 11, Number 6, 1999

• Daniel Jackson, Yu-Chung Ng, Jeannette M. Wing:
  A Nitpick Analysis of Mobile IPv6. 591-615
  
• Wim H. Hesselink:
  Predicate Transformers for Recursive Procedures with Local Variables. 616-636
  
• Diego Latella, István Majzik, Mieke Massink:
  Automatic Verification of a Behavioural Subset of UML Statechart Diagrams Using the SPIN Model-checker. 637-664
  
• David J. Duke, David A. Duce:
  The Formalization of a Cognitive Architecture and its Application to Reasoning About Human Computer Interaction. 665-689
  
• Hans-Jörg Kreowski, Sabine Kuske:
  Graph Transformation Units with Interleaving Semantics. 690-723