Advances in Computing Science ASIAN'99
Contributors: P.S. Thiagarajan (Editor); Roland Yap (Editor)
Edition: 1 edition
Publisher: Springer
Published: January 14, 2000
Language: eng
Format: Paperback
Number of pages: 395
ISBN-13: 9783540668565
Subjects: General Theory of Computing; Electronic data processing; Computer Science (General); Computers; Computers - General Information; Science/Mathematics; General; Logic Design; Computer Aided Verification; Computers / Logic Design; Distributed Systems; Formal Methods; Mobile Computing; Real-Time Systems; Theoretical Computer Science; Computer Science; Congresses
First sentence: Synchronous languages [Hal93, BG92, LGLL91, HCRP91] have been proposed to design so-called "reactive systems", which are systems that maintain a permanent interaction with a physical environment.
Description: Advances in Computing Science — ASIAN’99: 5th Asian Computing Science Conference Phuket, Thailand, December 10–12,1999 Proceedings<br />Author: P. S. Thiagarajan, Roland Yap<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-66856-5<br /> DOI: 10.1007/3-540-46674-6<br /><br />Table of Contents:<p></p><ul><li>Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing
</li><li>Emerging Application Domains and the Computing Fabric
</li><li>The Game of the Name in Cryptographic Tables
</li><li>A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
</li><li>Rapid Prototyping Techniques for Fuzzy Controllers
</li><li>Transactional Cache Management with A periodic Invalidation Scheme in Mobile Environments
</li><li>Observable Sharing for Functional Circuit Description
</li><li>Relating May and Must Testing Semantics for Discrete Timed Process Algebras
</li><li>A Framework for Formal Reasoning about Open Distributed Systems
</li><li>Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic Logic
</li><li>Verifying Probabilistic Programs Using a Hoare like Logic
</li><li>An Expressive Extension of TLC
</li><li>Completeness and Decidability of a Fragment of Duration Calculus with Iteration
</li><li>Logical Relations in Circuit Verification
</li><li>Lemma Generalization and Non-unit Lemma Matching for Model Elimination
</li><li>On Automating Inductive and Non-inductive Termination Methods
</li><li>Asynchronous Links in the PBC and M-Nets
</li><li>Demand-Driven Model Checking for Context-Free Processes
</li><li>Programming the Mobility Behaviour of Agents by Composing Itineraries
</li><li>Faster Model Checking for Open Systems</li></ul>