000 04075nam a22006135i 4500
001 978-3-540-77505-8
003 DE-He213
005 20240423125536.0
007 cr nn 008mamaa
008 100715s2007 gw | s |||| 0|eng d
020 _a9783540775058
_9978-3-540-77505-8
024 7 _a10.1007/978-3-540-77505-8
_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 Computer Science - ASIAN 2006. Secure Software and Related Issues
_h[electronic resource] :
_b11th Asian Computing Science Conference, Tokyo, Japan, December 6-8, 2006, Revised Selected Papers /
_cedited by Mitsu Okada, Ichiro Satoh.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aXV, 364 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4435
505 0 _aASIAN’2006 -- Security Evaluation of a Type of Table-Network Implementation of Block Ciphers -- A Symbolic Intruder Model for Hash-Collision Attacks -- A Denotational Approach to Scope-Based Compensable Flow Language for Web Service -- Certificateless Authenticated Two-Party Key Agreement Protocols -- FORM : A Federated Rights Expression Model for Open DRM Frameworks -- A Method of Safety Analysis for Runtime Code Update -- Automata-Based Confidentiality Monitoring -- Efficient and Practical Control Flow Monitoring for Program Security -- Modular Formalization of Reactive Modules in COQ -- Closing Internal Timing Channels by Transformation -- Responsiveness in Process Calculi -- Normal Proofs in Intruder Theories -- Breaking and Fixing Public-Key Kerberos -- Computational Soundness of Formal Indistinguishability and Static Equivalence -- Secrecy Analysis in Protocol Composition Logic -- A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations -- On Completeness of Logical Relations for Monadic Types -- A Spatial Logical Characterisation of Context Bisimulation -- Information Hiding in the Join Calculus -- Modeling Urgency in Component-Based Real-Time Systems -- Maintaining Data Consistency of XML Databases Using Verification Techniques -- An Operational Semantics of Program Dependence Graphs for Unstructured Programs -- Combination of Abstractions in the ASTRÉE Static Analyzer -- Proving Noninterference by a Fully Complete Translation to the Simply Typed ?-Calculus -- Formalization of CTL* in Calculus of Inductive Constructions -- Inferring Disjunctive Postconditions -- An Approach to Formal Verification of Arithmetic Functions in Assembly.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aData protection.
650 0 _aAlgorithms.
650 0 _aComputer networks .
650 1 4 _aTheory of Computation.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aData and Information Security.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Communication Networks.
700 1 _aOkada, Mitsu.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSatoh, Ichiro.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540775041
776 0 8 _iPrinted edition:
_z9783540847021
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v4435
856 4 0 _uhttps://doi.org/10.1007/978-3-540-77505-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c179078
_d179078