Advances in computing science ASIAN '99 : 5th Asian Computing Science Conference, Phuket, Thailand, December
User Rating: Be the first one!
Author: Asian Computing Science Conference (5th : 1999 : Phuket, Thailand), Thiagarajan, P. S, Yap, Roland H. C., 1963-
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer science, Electronic data processing
Publishers: Berlin ; New York : Springer
Collections: journals contributions, journals
ISBN Number: 354066856X
Pages Count: 600
PPI Count: 600
PDF Count: 1
Total Size: 944.60 MB
PDF Size: 10.22 MB
Extensions: djvu, epub, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 385
Views: 435
Total Files: 20
Media Type: texts
Total Files: 7
TORRENT
springer 10 1007 3 540 46674 6 archive t...torrent
Last Modified: 2024-01-30 12:14:28
Download
Size: 41.41 KB
Description
Advances in Computing Science — ASIAN’99: 5th Asian Computing Science Conference Phuket, Thailand, December 10–12,1999 Proceedings
Author: P. S. Thiagarajan, Roland Yap
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66856-5
DOI: 10.1007/3-540-46674-6
Table of Contents:
Includes bibliographical references and index
Author: P. S. Thiagarajan, Roland Yap
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-66856-5
DOI: 10.1007/3-540-46674-6
Table of Contents:
- Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing
- Emerging Application Domains and the Computing Fabric
- 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
Includes bibliographical references and index
You May Also Like
We will be happy to hear your thoughts