Advances in Computing Science - ASIAN'99

Invited Talks.- Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing.- Emerging Application Domains and the Computing Fabric.- Regular Papers.- The Game of the Name in Cryptographic Tables.- A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.- Rapid Prototyping Techniques for Fuzzy Controllers.- Transactional Cache Management with A periodic Invalidation Scheme in Mobile Environments.- Observable Sharing for Functional Circuit Description.- Relating May and Must Testing Semantics for Discrete Timed Process Algebras.- A Framework for Formal Reasoning about Open Distributed Systems.- Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic.- Verifying Probabilistic Programs Using a Hoare like Logic.- An Expressive Extension of TLC.- Completeness and Decidability of a Fragment of Duration Calculus with Iteration.- Logical Relations in Circuit Verification.- Lemma Generalization and Non-unit LemmaMatching for Model Elimination.- On Automating Inductive and Non-inductive Termination Methods.- Asynchronous Links in the PBC and M-Nets.- Demand-Driven Model Checking for Context-Free Processes.- Programming the Mobility Behaviour of Agents by Composing Itineraries.- Faster Model Checking for Open Systems.- An Argumentation Approach to Semantics of Declarative Programs with Defeasible Inheritance.- Entailment of Non-structural Subtype Constraints.- A CPS-Transform of Constructive Classical Logic.- Formal Verification of the MCS List-Based Queuing Lock.- BDD-Nodes Can Be More Expressive.- Formal Verification of Descriptions with Distinct Order of Memory Operations.- Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs.- On L k (Q) Types and Boundedness of IFP(Q) on Finite Structures.- Separators Are as Simple as Cutsets.- Ant Colony Optimization for the Ship Berthing Problem.- Poster Session Abstracts.- Security Modeling and Evaluation for the Mobile Code