Preliminary program for ASIAN'99

8.00 - 8.45

Registration

8.45 - 9.00

Inaugural Session

9.00 -10.00

Keynote Talk

From Requirements to Implementations: A Seamless Development Process for Embedded Systems

Amir Pnueli

10.00-10.30

Tea/Coffee Break

10.30-12.20

Session 1: Temporal Logic

Relating May and Must Testing Semantics for Discrete Timed Process Algebras

Luis Fernando Llana Diaz and David de Frutos Escrig

An Expressive Extension of TLC

Jesper G. Henriksen

Completeness and Decidability of a Fragment of Duration Calculus with Iteration

Dang Van Hung and Dimitar P. Guelev

Faster Model Checking for Open Systems

Madhavan Mukund, K Narayan Kumar, Scott A. Smolka

12.20-14.00

Lunch

14.00-15.50

Session 2: Logic

Structural sharing and efficient proof search in propositional intuitionistic logic

D. Galmiche, D. Larchey-Wendling

Lemma Generalization and Non-Unit Lemma Matching for Model Elimination

Koji Iwanuma, Kenichi Kishino

A CPS-transform of the Constructive Classical Logic

Ichiro Ogata

On L^k(Q) Types and Boundedness of IFP(Q) on Finite Structures

Anil Seth

15.50-16.10

Tea/Coffee Break

16.10-17.30

Session 3: Mobility

The game of the name in cryptographic tables

Roberto M. Amadio, Sanjiva Prasad

Transactional Cache Management with Aperiodic Invalidation Scheme in Mobile Environments

IlYoung Chung, Chong-Sun Hwang

Programming the Mobility Behaviour of Agents by Composing Itineraries

Seng Wai Loke, Heinz Schmidt, and Arkady Zaslavsky

9.00 -10.00

Invited Talk

Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing

Nicolas Halbwachs

10.00-10.30

Tea/Coffee Break

10.30-12.20

Session 4: Verification

A Framework for Formal Reasoning about Open Distributed Systems

L. Fredlund and D. Gurov

Verifying probabilistic programs using a Hoare like logic

J.I. den Hartog

Demand-Driven Model Checking for Context-Free Processes

Jens Knoop

Formal Verification of the MCS List-based Queuing Lock

Kazuhiro Ogata and Kokichi Futatsugi

12.20-14.00

Lunch

14.00-15.20

Entailment of Non-Structural Subtype Constraints

Joachim Niehren, Tim Priesnitz

Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs

Abhik Roychoudhury, K. Narayan Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan

An Argumentation Approach to Semantics of Declarative Programs with Defeasible Inheritance

Ekawit Nantajeewarawat, Vilas Wuwongse

15.20-15.50

Tea/Coffee Break

16.00-16.55

Session 6: General

On Automating Inductive and Non-Inductive Termination Methods

Fairouz Kamareddine and Francois Monin

Asynchronous links in the PBC and M-nets

Hanna Klaudel, Franck Pommereau

17.00-18.50

Poster Presentation and Tea/Coffee break

19.00

19.30

9.00 -10.00

Invited Talk

Emerging Application Domains and the Computing Fabric

Krishna Palem

10.00-10.30

Tea/Coffee Break

10.30-12.20

Session 7: Hardware

Rapid Prototyping Techniques for Fuzzy Controllers

Chantana Chantrapornchai, Sissades Tongsima, Edwin Sha

Observable Sharing for Functional Circuit Description

Koen Claessen, David Sands

Formal Verification of Descriptions with Distinct Order of Memory Operations

G. Ritter, H. Hinrichsen, and H. Eveking

Logical Relations in Circuit Verification

Mia Indrika

12.20-14.00

Lunch

14.00-15.50

Session 8: Hardware & Algorithms

BDD-nodes can be more expressive

Frank Reffel

Separators are as Simple as Cutsets

Hong Shen

Ant Colony System for the Ship-berthing Problem

Chia Jim Tong, Andrew Lim

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs

Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi

16.00

Excursion: Evening Cruise