Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues [electronic resource] : 11th Asian Computing Science Conference, Tokyo, Japan, December 6-8, 2006, Revised Selected Papers / edited by Mitsu Okada, Ichiro Satoh.

Contributor(s): Okada, Mitsu [editor.] | Satoh, Ichiro [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 4435Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: XV, 364 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540775058Subject(s): Computer science | Computer Communication Networks | Data protection | Data structures (Computer science) | Computer software | Logic design | Information Systems | Computer Science | Logics and Meanings of Programs | Data Structures, Cryptology and Information Theory | Systems and Data Security | Algorithm Analysis and Problem Complexity | Computer Communication Networks | Management of Computing and Information SystemsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1015113 LOC classification: QA76.9.L63QA76.5913QA76.63Online resources: Click here to access online
Contents:
ASIAN’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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK7995

ASIAN’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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha