Advances in Computing Science - ASIAN'98

This volume contains the proceedings of the Fourth Asian Computing Science Conference (ASIAN98), held December 8{10, 1998, in Manila, the Philippines. The previous three ASIAN conferences were also published as Lecture Notes in Computer Science, Volumes 1023 (Bangkok, 1995), 1179 (Singapore, 1996), and 1345 (Kathmandu, 1997). Initiated in 1995 by the Asian Institute of Technology in partnership with INRIAandUNU,the ASIANconferenceseriesaimsatprovidingaforuminAsia fortheexchangeofthemostrecentresearchideasandresultsincomputerscience andinformationtechnology.Whileeachyearfeaturesseveralemphasizedthemes, the 1998 conference focuses on the research areas of (1) formal reasoning and veri cation,(2) programminglanguages,(3) dataand knowledgerepresentation, and (4) networking and Web computing. There were 43 submissions to the conference, out of which 17 were chosen for presentation and inclusion in this proceedings. The papers were submitted fromAustralia,Brazil,China,France,Germany,India,Italy,Japan,Korea,New Zealand, the Philippines, Russia, Singapore, Spain, Switzerland, Taiwan, Th- land, the United Kindom, and the United States of America. The program c- mittee meeting was held virtually over the Internet. The selection was nalized after a fteen-day period of lively discussion. Each paper was carefully reviewed and received at least three reports. In addition to 17 highly selective papers, this year s conference also features a keynotespeechby Jeannette M.Wing (CarnegieMellonUniversity)onFormal Methods:Past,Present,andFuture,twoinvitedtalksbySusumuHayashi(Kobe University) on Testing Proofs by Examples and Claude Kirchner (INRIA) on The RewritingCalculus as a Semantics ofELAN, and two tutorials by Tomasz Janowski(UNU/IIST)onSemanticsandLogicforProvableFault-Tolerance and R.K. Shyamasundar (TIFR) onMobile Computation: Calculus and Languages.

Includes supplementary material: sn.pub/extras

Klappentext

R.K. Shyamasundar (TIFR) onMobile Computation: Calculus and Languages.

Inhalt
Invited Talk 1.- Testing Proofs by Examples.- Session 1.- Rigid Reachability.- Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover.- A Polymorphic Language Which Is Typable and Poly-step.- Cut Elimination for Classical Proofs as Continuation Passing Style Computation.- Tutorial 1.- Semantics and Logic for Provable Fault-Tolerance, A Tutorial.- Invited Talk 2.- The Rewriting Calculus as a Semantics of ELAN.- Session 2.- Tried Linear Hashing.- A New Factoring Algorithm for Magic Predicates.- An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs.- Session 3.- Taxonomy and Expressiveness of Preemption: A Syntactic Approach.- Exploring Regional Locality in Distributed Shared Memory.- Guaranteed Mutually Consistent Checkpointing in Distributed Computations.- Session 4.- Type Inference for First-Class Messages with Feature Constraints.- Two Flavors of Offine Partial Evaluation.- First-Class Contexts in ML.- Keynote Address.- Formal Methods: Past, Present, and Future.- Session 5.- A Comparison of Petri Net Semantics under the Collective Token Philosophy.- Bisimulation Lattice of Chi Processes.- Eventuality in LOTOS with a Disjunction Operator.- Towards a Characterisation of Finite-State Message-Passing Systems.- Tutorial 2.- Mobile Computation: Calculus and Languages (A Tutorial).