Advances in Computing Science - ASIAN'98

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).

Includes supplementary material: sn.pub/extras