Advances in Computing Science - ASIAN'99

5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 Proceedings
1999
ISBN: 978-3-540-66856-5
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1742, 408 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1280 g

Reihe: Lecture Notes in Computer Science

The Asian Computing Science Conference (ASIAN) series was initiated in 1995 to provide a forum for researchers in computer science from the Asian region to meet and to promote interaction with researchers from other regions. The previous four conferences were held, respectively, in Bangkok, Singapore, Ka- mandu, and Manila. The proceedings were published in the Lecture Notes in Computer Science Series of Springer-Verlag. This year’s conference (ASIAN’99) attracted 114 submissions from which 28 papers were selected through an electronic PC meeting. In addition, 11 papers were selected for shorter presentations at the poster sessions. The themes for this year’s conference were announced to be: { Embedded and Real-Time Systems { Formal Reasoning and Veric ation { Distributed and Mobile Computing The key note speaker for ASIAN’99 is Amir Pnueli (Weizmann Institute, Israel) and the invited speakers are Nicolas Halbwachs (VERIMAG, CNRS, France) and Krishna Palem (The Georgia Institute of Technology and Courant Institute, New York University, USA). We thank them for accepting our invi- tion. Thisyear’sconferenceisbeingsponsoredbytheAsianInstituteofTechnology (Thailand), INRIA (France), the National University of Singapore (Singapore), andUNU/IIST (Macau).We thank allthese institutions fortheir continueds- port of the ASIAN series. This year’sconferencewill be held inPhuket,Thailand.We aremuchobliged to the Prince of Songkhla University for providing the conference venue and to Rattana Wetprasit for making the local arrangements. We also wish to thank the PC members and the large number of referees for the substantial work put in by them in assessing the submitted papers.

Zielgruppe

Research

Autoren/Hrsg.

Yap, Roland

Thiagarajan, P.S.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Prozedurale Programmierung
• Mathematik | Informatik EDV | Informatik Informatik
• Mathematik | Informatik EDV | Informatik Technische Informatik Netzwerk-Hardware

Inhaltsverzeichnis

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 Lemma Matching 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 Paradigm.- CASA - Structured Design of a Specification Language for Intelligent Agents.- An Efficient Location Management by Optimal Location Area Partitioning in PCS Networks.- Programming with Explicit Regions.- A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic.- Formal Verification of Secret Sharing Protocol Using Coq.- On Feasibility, Boundedness and Redundancy of Systems of Linear Constraints over R 2-Plane.- Deduction in Logic of Association Rules.- Asynchronous Migration in Parallel Genetic Programming.- Verification Results for a Multimedia Protocol.- Multipoint-to-Point ABR Service with Fair Intelligent Congestion Control in ATM Networks.