18 December 2000

Venue: S17 Level 5 Executive Conference Room

0830    Registration

Session 1

0900    Abstraction of Link Structures by Regular Expressions and
             Abstract Model Checking of Concurrent Garbage Collection
             Masami Hagiya
             University of Tokyo, Japan

0945    Pre-Condition Synthesis for Array Bound Check
             Wei-Ngan Chin, Siau-Cheng Khoo, Dana Xu    Na
             National University of Singapore, Singapore
   
1030-1100    Tea Break

Session 2

1100    Proving Syntactic Properties of Exceptions in an
             Ordered Logical Framework
             Jeff Polakow and Kwangkuen Yi
             KAIST, Korea

1145    Conditional Analysis and Verification
             Nevin Heintze, Joxan Jaffar and Razvan Voicu
             National University of Singapore, Singapore

1230-1400    Lunch

Session 3

1400    Linearity Analysis of Concurrent Logic Programs
             Kazunori Ueda
             Waseda University, Japan   

1445    A Note on Model Checking Reuse
             Shilov Nikolay
             KAIST, Korea

1530-1600    Tea Break

Session 4

1600    A Generalization of Hybrid Let-Polymorphic Type
             Inference Algorithms
             Oukseh Lee, Kwangkuen Yi
             Korea Advanced Institute of Science and Technology, Korea

1645    A Declarative Approach to Concurrency in Java
             Rafael Ramirez, Andrew E. Santosa, Roland H. C. Yap
             National University of Singapore, Singapore

1800    Dinner

19 December 2000

Session 5

0900    Mining Optimized Ranges
             Haiyan Zhao, Zhenjiang Hu, Masato Takeichi
             University of Tokyo, Japan

0945    Generic Validation of Structural Content with
             Parametric Modules
             Tyng-Ruey Chuang
             Academia Sinica, Taiwan
   
1030-1100    Tea Break

Session 6

1100    Inverse Computation in a functional Language
             Robert Glueck
             Waseda University, Japan

1145    Algebra Methods for Optimal Bracketing Problems
             Shin-Cheng Mu
             Oxford University, UK

1230-1400    Lunch

Session 7

1400    An Open Environment for Cooperative Equational Solving
             Tetsuo Ida and Mircea Marin
             University of Tsukuba, Japan

1445    An Efficient Algorithm for Scheduling Instructions
             with Deadline Constraints on ILP Machines
             Hui Wu, Joxan Jaffar
             National University of Singapore, Singapore


1530-1600    Tea Break

Session 8

1600    Logical Analysis of Assembly Language
             Atsushi Ohori
             JAIST, Japan

1645    Light Logic and Resource Bounded Computation
             Luke Ong C.H.
             Oxford University, UK

1730    A note on algebraic structure of tree decomposition of graphs
             Mizuhito Ogawa
             JST PRESTO / NTT Communicaion Science Laboratories, Japan

1800    Kima - An Automated Error Correction System for
             Concurrent Logic Programs
             Yasuhiro Ajiro and Kazunori Ueda
             Waseda University

1930    Dinner

20 December 2000

Session 9

0900    Automatic Generation of Very Efficient Programs by
             Generlized Partial Computation
             Yoshihiko Futamura
             Waseda University, Japan
   
0945    Partial CPS Transformation Using Static Analysis
            Jungtaek Kim
             KAIST, Korea

1030-1100    Tea Break

Session 10

1100    A New Criterion for Safe Program Transformations
             Yasuhiko Minamide
             University of Tsukuba, Japan
   
1145    Berlioz: Compiling Oz to Java Bytecode
             Thang X. Le
             National University of Singapore, Singapore


1230    Lunch and End of Workship