This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995.
The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the majority of the participating researchers come from South-East Asian countries, but there is also a strong international component. The volume reflects research activities, particularly by Asian computer science researchers, in different areas. Special attention is paid to algorithms, knowledge representation, programming and specification languages, verification, concurrency, networking and distributed systems, and databases.
Author(s): Eliezer A. Albacea (auth.), Kanchana Kanchanasut, Jean-Jacques Lévy (eds.)
Series: Lecture Notes in Computer Science 1023
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1995
Language: English
Pages: 417
Tags: Algorithm Analysis and Problem Complexity
Leapfrogging samplesort....Pages 1-9
Spanning 2-trees....Pages 10-22
Minimal linear invariants....Pages 23-33
Parallel maximal matching on minimal vertex series parallel digraphs....Pages 34-47
Efficient equality-testing and updating of sets....Pages 48-58
Binary space partitions for sets of hyperrectangles....Pages 59-72
Transformation of orthogonal term rewriting systems....Pages 73-87
An automaton-driven frame disposal algorithm and its proof of correctness....Pages 88-102
Labeled λ-calculus and a generalised notion of strictness....Pages 103-110
Preemption primitives in reactive languages....Pages 111-125
Multi-action process algebra....Pages 126-140
Complexity as a basis for comparing semantic models of concurrency....Pages 141-155
Combinatory formulations of concurrent languages....Pages 156-170
Constraints for free in concurrent computation....Pages 171-186
Formalizing inductive proofs of message recovery in distributed systems....Pages 187-194
Detecting distributed termination in the presence of node failure....Pages 195-209
An extended gradient model for NUMA multiprocessor systems....Pages 210-224
Efficient parallel permutation-based range-join algorithms on mesh-connected computers....Pages 225-238
Pipelined band join in shared-nothing systems....Pages 239-253
Inductive logic programming based on genetic algorithm....Pages 254-268
The equivalence of the subsumption theorem and the refutation-completeness for unconstrained resolution....Pages 269-285
Probabilistic logic programming and Bayesian networks....Pages 286-300
Deriving and applying logic program transformers....Pages 301-318
Performance of a data-parallel concurrent constraint programming system....Pages 319-334
Formalizing inductive proofs of network algorithms....Pages 335-349
TROM — An object model for reactive system development....Pages 350-364
Duration calculus specification of scheduling for tasks with shared resources....Pages 365-380
Trace specifications of non-deterministic multi-object modules....Pages 381-395
ESP-MC: An experiment in the use of verification tools....Pages 396-410
