000 | 05096nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-46674-1 | ||
003 | DE-He213 | ||
005 | 20240423132541.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540466741 _9978-3-540-46674-1 |
||
024 | 7 |
_a10.1007/3-540-46674-6 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAdvances in Computing Science - ASIAN'99 _h[electronic resource] : _b5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999 Proceedings / _cedited by P.S. Thiagarajan, Roland Yap. |
250 | _a1st ed. 1999. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999. |
|
300 |
_aXII, 408 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1742 |
|
505 | 0 | _aInvited 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. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aComputer networks . | |
650 | 0 | _aComputers, Special purpose. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aSpecial Purpose and Application-Based Systems. |
650 | 2 | 4 | _aCompilers and Interpreters. |
700 | 1 |
_aThiagarajan, P.S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aYap, Roland. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540668565 |
776 | 0 | 8 |
_iPrinted edition: _z9783662211540 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1742 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-46674-6 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c189012 _d189012 |