FLoC 2002 Satellite Events

Volume 70, Number 1, 2002

• 
  Fabio Alessi, Stefania Lusin: Simple Easy Terms. 1-18
• 
  Steffen van Bakel: Strongly Normalising Cut-Elimination with Strict Intersection Types. 19-36
• 
  Sébastien Carlier: Polar Type Inference with Intersection Types and omega. 37-52
• 
  Judicaël Courant: Strong Normalization with Singleton Types. 53-71
• 
  Ugo de'Liguoro: Subtyping in Logical Form. 72-87
• 
  Mariangiola Dezani-Ciancaglini, Alain Frisch, Elio Giovannetti, Yoko Motohama: The Relevance of Semantic Subtyping. 88-105
• 
  Silvia Ghilezan, Silvia Likavec: Reducibility: A Ubiquitous Method in Lambda Calculus with Intersection Types. 106-123
• 
  Assaf J. Kfoury, Geoffrey Washburn, Joe Wells: Implementing Compositional Analysis Using Intersection Types With Expansion Variables. 124-148
• 
  Daniel Leivant: Feasible functionals and intersection of ramified types. 149-162
• 
  Simona Ronchi Della Rocca: Intersection Typed lambda-calculus. 163-181
• 
  Frank Pfenning: Invited talk: Tri-Directional Type Checking.
• 
  Steffen van Bakel: Preface. 182-183

Volume 70, Number 2, 2002

LFM 2002 International Workshop on Logical Frameworks and Meta-Languages
Copenhagen, Denmark, July 26, 2002

• 
  Pablo López, Ernesto Pimentel, Joshua S. Hodas, Jeffrey Polakow, Lubomira Stoilova: Isolating Resource Consumption in Linear Logic Proof Search. 1-10
• 
  Joseph Vanderwaart, Karl Crary: A Simplified Account of the Metatheory of Linear LF. 11-28
• 
  Aaron Stump, Clark W. Barrett, David L. Dill: Producing Proofs from an Arithmetic Decision Procedure in Elliptical LF. 29-41
• 
  Femke van Raamsdonk, Paula Severi: Eliminating Proofs from Programs. 42-59
• 
  Alberto Momigliano, Simon Ambler, Roy L. Crole: A Hybrid Encoding of Howe's Method for Establishing Congruence of Bisimilarity. 60-75
• 
  Ivan Scagnetto, Marino Miculan: Ambient Calculus and its Logic in the Calculus of Inductive Constructions. 76-95
• 
  David Delahaye: A Proof Dedicated Meta-Language. 96-109
• 
  Brigitte Pientka: Memoization-Based Proof Search in LF - an Experimental Evaluation of a Prototype. 110-123
• 
  Carsten Schürmann, Serge Autexier: Towards Proof Planning for Mω⁺. 124-145
• 
  Frank Pfenning: Preface. 146

Volume 70, Number 3, 2002

The BCS FACS Refinement Workshop
Denmark, July 2002

• 
  John Derrick, Eerke A. Boiten, Jim Woodcock, Joakim von Wright: Preface. 1-2
• 
  Ralph-Johan Back, Joakim von Wright: Compositional Action System Refinement. 3
• 
  Steve Dunne: Junctive Compositions of specifications in total, general correctness. 4-20
• 
  Bernhard K. Aichernig: Contract-based mutation testing in the refinement calculus. 281
• 
  Antónia Lopes, José Luiz Fiadeiro: Superposition: Composition vs refinement of non-deterministic action-based systems. 282-296
• 
  Luke Wildman, Colin J. Fidge: The variety of variables in computer-aided real-time programming. 21-36
• 
  Adrian J. Hilton, Jon G. Hall: Refining specifications to programmable logic. 37-49
• 
  Susan Stepney, Fiona Polack, Ian Toyn: Refactoring in maintenance and development of Z specifications. 50-69
• 
  Lindsay Groves: Refinement and the Z schema calculus. 70-93
• 
  Christie Bolton, Jim Davies: A comparison of refinement orderings and their associated simulation rules. 297-310
• 
  Eerke A. Boiten, John Derrick: Unifying concurrent and relational refinement. 94-131
• 
  Ana Cavalcanti, Augusto Sampaio, Jim Woodcock: Refinement of actions in Circus. 132-162
• 
  Matthias Anlauff, Asuman Sünbül: Towards component based systems: refining connectors. 163-177
• 
  Kai Engelhardt: Towards a refinement theory that supports reasoning about knowledge and time for multiple agents. 178
• 
  Emil Sekerinski: Tabular verification and refinement. 179-198
• 
  Yngve Lamo, Michal Walicki: Composition and refinement of specifications and parameterised data types. 199-216
• 
  Jim Davies, Charles Crichton: Concurrency and refinement in the UML. 217-243
• 
  Harald Fecher, Mila E. Majster-Cederbaum: Taking decisions late: end-based choice combined with action refinement. 244-259
• 
  Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu: Refinement of actions in a real-time process algebra with a true concurrency model. 260-280
• 
  Márcio Cornélio, Ana Cavalcanti, Augusto Sampaio: Refactoring by Transformation. 311-330

Volume 70, Number 4, 2002

Runtime Verification 2002 (RV'02)
Copenhagen, Denmark, July 26, 2002

• 
  Karthikeyan Bhargavan, Carl A. Gunter: Requirements for a Practical Network Event Recognition Language. 1-20
• 
  Mark Brörkens, Michael Möller: Dynamic Event Generation for Runtime Checking using the JDI. 21-35
• 
  Bernd Finkbeiner, Sriram Sankaranarayanan, Henny Sipma: Collecting Statistics over Runtime Executions. 36-54
• 
  Parker Abercrombie, Murat Karaorman: jContractor: Bytecode Instrumentation Techniques for Implementing Design by Contract in Java. 55-79
• 
  Moonjoo Kim, Sampath Kannan, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan: Computational Analysis of Run-time Monitoring - Fundamentals of Java-MaC. 80-94
• 
  Moonjoo Kim, Insup Lee, Usa Sammapun, Jangwoo Shin, Oleg Sokolsky: Monitoring, Checking, and Steering of Real-Time Systems. 95-111
• 
  Joshua Levy, Hassen Saïdi, Tomás E. Uribe: Combining Monitors for Runtime System Verification. 112-127
• 
  Elsa L. Gunter, Doron Peled: Tracing the executions of concurrent programs. 128-141
• 
  Scott D. Stoller: Testing Concurrent Java Programs using Randomized Scheduling. 142-157
• 
  Suan Hsi Yong, Susan Horwitz: Reducing the Overhead of Dynamic Analysis. 158-178
• 
  Lenore D. Zuck, Amir Pnueli, Yi Fang, Benjamin Goldberg, Ying Hu: Translation and Run-Time Validation of Optimized Code. 179-200
• 
  Klaus Havelund, Grigore Rosu: Preface. 201-202

Volume 70, Number 5, 2002

CLIMA'2002 Computational Logic in Multi-Agent Systems
Copenhagen, Denmark, 1 August 2002

• 
  Michael Schroeder, Ralf Schweimeier: Arguments and Misunderstandings: Fuzzy Unification for Negotiating Agents. 1-19
• 
  João Alexandre Leite, José Júlio Alferes, Luís Moniz Pereira, Halina Przymusinska, Teodor C. Przymusinski: A Language for Multi-dimensional Updates. 20-38
• 
  Antonis C. Kakas, Pavlos Moraitis: Argumentative Agent Deliberation, Roles and Context. 39-53
• 
  Katsuhiko Toyama, Takahiro Kojima, Yasuyoshi Inagaki: Translating Multi-Agent Autoepistemic Logic into Logic Program. 54-71
• 
  Pierangelo Dell'Acqua, Ulf Nilsson, Luís Moniz Pereira: A Logic Based Asynchronous Multi-Agent System. 72-88
• 
  James Harland, Michael Winikoff: Language Design Issues for Agents based on Linear Logic (Extended Abstract). 89-107
• 
  Rafael H. Bordini, Álvaro F. Moreira: Proving the Asymmetry Thesis Principles for a BDI Agent-Oriented Programming Language. 108-125
• 
  Tadashi Araragi, Shiro Takata, Naoyuki Nide: A Verification Method for a Commitment Strategy of the BDI Architecture. 126-139
• 
  Naoyuki Nide, Shiro Takata, Tadashi Araragi: Deduction Systems for BDI Logics with Mental State Consistency. 140-152
• 
  Hisashi Hayashi, Kenta Cho, Akihiko Ohsuga: Speculative Computation and Action Execution in Multi-Agent Systems. 153-166
• 
  Koji Iwanuma, Katsumi Inoue: Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments. 167-182
• 
  Thomas Bolander: Maximal Introspection of Agents. 183-198
• 
  Paolo Torroni: Logics and Multi-agents: towards a new symbolic model of cognition. 199-203
• 
  Jürgen Dix, João Alexandre Leite, Ken Satoh: Preface. 204-206

Volume 70, Number 6, 2002

2nd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2002) - Final Proceedings
Copenhagen, Denmark, July 21, 2002

• 
  Aart Middeldorp: Approximations for Strategies and Termination. 1-20
• 
  Vincent van Oostrom, Roel C. de Vrijer: Four equivalent equivalences of reductions. 21-61
• 
  Elvira Albert, Michael Hanus, Frank Huch, Javier Oliver, Germán Vidal: An Operational Semantics for Declarative Multi-Paradigm Languages. 62-83
• 
  Mauricio Ayala-Rincón, Rinaldi Maya Neto, Ricardo P. Jacobi, Carlos H. Llanos, Reiner W. Hartenstein: Applying ELAN Strategies in Simulating Processors over Simple Architectures. 84-99
• 
  Mark van den Brand, Paul Klint, Jurgen J. Vinju: Term Rewriting with Type-safe Traversal Functions. 100-117
• 
  John R. W. Glauert, Zurab Khasidashvili: An Abstract Böhm-normalization. 118-134
• 
  Ralf Lämmel: The Sketch of a Polymorphic Symphony. 135-155
• 
  Karina Olmos, Eelco Visser: Strategies for Source-to-Source Constant Progagation. 156-175
• 
  Pierre Réty, Julie Vuotto: Regular Sets of Descendants by Leftmost Strategy. 176-195
• 
  Bernhard Gramlich, Salvador Lucas: Preface. 196-197