Advances in Computing Science ASIAN 98: 4th Asian Computing Science Conference Manila, The Philippines, December 8–10, 1998 Proceedings

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 4th Asian Computing Science Conference, ASIAN'98, held in Manila, The Philippines, in December 1998.
The 17 revised full papers presented were carefully reviewed and selected from a total of 43 submissions. Also included are a few invited contributions. Among the topics covered are automated deduction, proof theory, rewriting systems, program semantics, distributed processing, algorithms, and graph-theoretical aspects.

Author(s): Susumu Hayashi, Ryosuke Sumitomo (auth.), Jieh Hsiang, Atsushi Ohori (eds.)
Series: Lecture Notes in Computer Science 1538
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998

Language: English
Pages: 314
Tags: Theory of Computation; Programming Languages, Compilers, Interpreters; Artificial Intelligence (incl. Robotics)

Testing Proofs by Examples....Pages 1-3
Rigid Reachability....Pages 4-21
Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover....Pages 22-42
A Polymorphic Language Which Is Typable and Poly-step....Pages 43-60
Cut Elimination for Classical Proofs as Continuation Passing Style Computation....Pages 61-78
Semantics and Logic for Provable Fault-Tolerance, A Tutorial....Pages 79-83
The Rewriting Calculus as a Semantics of ELAN....Pages 84-85
Tried Linear Hashing....Pages 86-94
A New Factoring Algorithm for Magic Predicates....Pages 95-112
An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs....Pages 113-124
Taxonomy and Expressiveness of Preemption: A Syntactic Approach....Pages 125-141
Exploring Regional Locality in Distributed Shared Memory....Pages 142-156
Guaranteed Mutually Consistent Checkpointing in Distributed Computations....Pages 157-168
Type Inference for First-Class Messages with Feature Constraints....Pages 169-187
Two Flavors of Offine Partial Evaluation....Pages 188-205
First-Class Contexts in ML....Pages 206-223
Formal Methods: Past, Present, and Future....Pages 224-224
A Comparison of Petri Net Semantics under the Collective Token Philosophy....Pages 225-244
Bisimulation Lattice of Chi Processes....Pages 245-262
Eventuality in LOTOS with a Disjunction Operator....Pages 263-281
Towards a Characterisation of Finite-State Message-Passing Systems....Pages 282-299
Mobile Computation: Calculus and Languages (A Tutorial)....Pages 300-304