[Prev][Next][Index][Thread]

Call for Participation : ASIAN 98

	           Preliminary Program and Call for Participation

---------------------------------------------------------------------------
For registration and other information, please visit our home page at
http://www.cs.ait.ac.th/ASIAN98/ 
---------------------------------------------------------------------------

The series of annual Asian Computing Science Conferences (ASIAN) was started
in 1995 to provide a forum for researchers in computer science from the Asian
region and to promote interaction with researchers from other regions. The
conference series was initiated by the Asian Institute of Technology in
partnership with INRIA, France, and the UNU/IIST, Macau.  The first three
conferences were held, respectively, in Bangkok, Singapore, and Katmandu. The
proceedings were published as Lecture Notes in Computer Science 1023, 1179,
and 1345 from Springer-Verlag.

Although the scope of the conferences was a broad coverage of Computer
Science, there was a focus on the more theoretical areas of algorithms,
programming, concurrency and parallelism, networking and security. The 1998
conference will continue to emphasize the conceptual areas of Computer
Science, though papers in all areas will be considered.  The following themes
represent the areas of focus for this year:

   * Formal Reasoning and Verification
   * Programming Languages
   * Data and Knowledge Representation
   * Networking and Web Computing

The proceedings will be published by Springer-Verlag in the LNCS series. We
also plan to edit a special journal issue dedicated to ASIAN'98 conference,
expected to be published from International Journal of Foundations of Computer
Science.

----------------------------------------------------------------------------
                            Preliminary Program

                           Thursday, December 8th

Invited Talk 1: 9:00 - 10:00  

Testing Proofs by Examples
 Susumu Hayashi (Kobe University, Japan)

Session 1 : 10:30 - 12:30 

 * Rigid Reachability
    Harald Ganzinger, Florent Jacquemard and Margus Veanes
 * Mechanizing Reasoning about Large Finite Tables in a Rewrite based
   Theorem Prover
    Deepak Kapur and M. Subramaniam
 * Concrete Syntax for Intuitionistic Light Affine Logic with Polymorphic
   Type Assignment a la ML
    Luca Roversi
 * Cut Elimination for Classical Proofs as Continuation Passing Style
   Computation 
    Ichiro Ogata

Tutorial 1 : 2:00 - 5:00 

 Semantics and Logic for Provable Fault-Tolerance
 Tomasz Janowski (UNU/IIST, Macau)


                           Wednesday, December 9th

Invited Talk 2: 9:00 - 10:00  

 The rewriting calculus as a semantics of ELAN
 Claude Kirchner (INRIA, France)

Session 2 : 10:30 - 12:00  

 * Tried Linear Hashing
    C.H. Ang, S.T. Tan, and T.C. Tan
 * A New Factoring Algorithm for Magic Predicates
    Xiaoyong Du, Zhibin Liu, and Naohiro Ishii
 * An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on
   Distance-Hereditary Graphs
    Sun-yuan Hsieh, Gen-huey Chen, Chin-wen Ho

Session 3 : 13:30 - 15:00 

 * Taxonomy and Expressiveness of Preemption: A syntactic approach
    Sophie Pinchinat, Eric Rutten, R.K. Shyamasundar
 * Exploring Regional Locality in Distributed Shared Memory
    Zhiyi Huang, Chengzheng Sun, and Abdul Sattar
 * Guaranteed Mutually Consistent Checkpointing in Distributed
   Computations
    Zhonghua Yang, Chengzheng Sun, Abdul Sattar, and Yanyan Yang

Session 4 : 15:30 - 17:30  

 * Type Inference for First-Class Messages with Feature Constraints
    Martin Mueller and Susumu Nishimura
 * Unrestrictive Overloading without Declarations or Annotations
    Carlos Camarao and Lucilia Figueiredo
 * Two flavors of Offline Partial Evaluation
    Simon Helsen and Peter Thiemann
 * First-class Contexts in ML
    Masatomo Hashimoto

                           Tuesday, December 10th

Keynote Address: 9:00-10:00 

 Formal Methods: Past, Present, and Future
 Jeannette M. Wing (CMU, USA)

Session 5: 10:30 - 12:30 

 * A Comparison of Petri Net Semantics under the Collective Token
   Philosophy
    Roberto Bruni, Jose' Meseguer, Ugo Montanari, Vladimiro Sassone
 * Bisimulation Lattice of Chi Processes
    Yuxi Fu
 * Eventuality in LOTOS with a Disjunction Operator
    Yoshinao Isobe, Yutaka Sato, and Kazuhito Ohmaki
 * Towards a characterisation of finite-state message-passing systems
    Madhavan Mukund, K Narayan Kumar,Jaikumar Radhakrishnan, and Milind Sohoni

Tutorial 2: 14:00 - 17:00 

 Mobile Computation: Calculus and Languages
 R.K. Shyamasundar (TIFR Bombay, India)
----------------------------------------------------------------------------