Advances in Computing Science - ASIAN'99 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 Proceedings /
Advances in Computing Science - ASIAN'99 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 Proceedings / [electronic resource] :
edited by P.S. Thiagarajan, Roland Yap.
- 1st ed. 1999.
- XII, 408 p. online resource.
- Lecture Notes in Computer Science, 1742 1611-3349 ; .
- Lecture Notes in Computer Science, 1742 .
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.
9783540466741
10.1007/3-540-46674-6 doi
Computer science.
Machine theory.
Computer networks .
Computers, Special purpose.
Compilers (Computer programs).
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Computer Communication Networks.
Special Purpose and Application-Based Systems.
Compilers and Interpreters.
QA75.5-76.95
004.0151
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.
9783540466741
10.1007/3-540-46674-6 doi
Computer science.
Machine theory.
Computer networks .
Computers, Special purpose.
Compilers (Computer programs).
Theory of Computation.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Computer Communication Networks.
Special Purpose and Application-Based Systems.
Compilers and Interpreters.
QA75.5-76.95
004.0151