000 03466nam a22005535i 4500
001 978-3-540-49366-2
003 DE-He213
005 20240423132448.0
007 cr nn 008mamaa
008 121227s1998 gw | s |||| 0|eng d
020 _a9783540493662
_9978-3-540-49366-2
024 7 _a10.1007/3-540-49366-2
_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'98
_h[electronic resource] :
_b4th Asian Computing Science Conference, Manila, The Philippines, December 8-10, 1998, Proceedings /
_cedited by Jieh Hsiang, Atsushi Ohori.
250 _a1st ed. 1998.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1998.
300 _aX, 314 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 ;
_v1538
505 0 _aInvited Talk 1 -- Testing Proofs by Examples -- Session 1 -- Rigid Reachability -- Mechanizing Reasoning about Large Finite Tables in a Rewrite Based Theorem Prover -- A Polymorphic Language Which Is Typable and Poly-step -- Cut Elimination for Classical Proofs as Continuation Passing Style Computation -- Tutorial 1 -- Semantics and Logic for Provable Fault-Tolerance, A Tutorial -- Invited Talk 2 -- The Rewriting Calculus as a Semantics of ELAN -- Session 2 -- Tried Linear Hashing -- A New Factoring Algorithm for Magic Predicates -- An Optimal Parallel Algorithm for the Perfect Dominating Set Problem on Distance-Hereditary Graphs -- Session 3 -- Taxonomy and Expressiveness of Preemption: A Syntactic Approach -- Exploring Regional Locality in Distributed Shared Memory -- Guaranteed Mutually Consistent Checkpointing in Distributed Computations -- Session 4 -- Type Inference for First-Class Messages with Feature Constraints -- Two Flavors of Offine Partial Evaluation -- First-Class Contexts in ML -- Keynote Address -- Formal Methods: Past, Present, and Future -- Session 5 -- A Comparison of Petri Net Semantics under the Collective Token Philosophy -- Bisimulation Lattice of Chi Processes -- Eventuality in LOTOS with a Disjunction Operator -- Towards a Characterisation of Finite-State Message-Passing Systems -- Tutorial 2 -- Mobile Computation: Calculus and Languages (A Tutorial).
650 0 _aComputer science.
650 0 _aCompilers (Computer programs).
650 0 _aArtificial intelligence.
650 1 4 _aTheory of Computation.
650 2 4 _aCompilers and Interpreters.
650 2 4 _aArtificial Intelligence.
700 1 _aHsiang, Jieh.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aOhori, Atsushi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540653882
776 0 8 _iPrinted edition:
_z9783662203552
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1538
856 4 0 _uhttps://doi.org/10.1007/3-540-49366-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188020
_d188020