Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues 11th Asian Computing Science Conference, Tokyo, Japan, December 6-8, 2006, Revised Selected Papers /
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2007.
|
Σειρά: | Lecture Notes in Computer Science,
4435 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.