| The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available. The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes. -proceedings(published in time for the respective conference) -post-proceedings(consisting of thoroughly revised final full papers) -research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.) |
| Programming with Explicit Security Policies Trace Partitioning in Abstract Interpretation Based Static Analyzers The ASTRt~E Analyzer Interprocedural Herbrand Equalities Analysis of Modular Arithmetic Forward Slicing by Conjunctive PartiM Deduction and Argument Filtering A New Foundation for Control-Dependence and Slicing for Modern Program Structures Summaries for While Programs with Recursion Determinacy Inference for Logic Programs Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis A Type Discipline for Authorization Policies Computationally Sound, Automated Proofs for Security Protocols Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries (Extended Abstract) Analysis of an Electronic Voting Protocol in the Applied Pi Calculus Streams with a Bottom in Functional Languages Bottom-Up fl-Reduction: Uplinks and A-DAGs BI Hyperdoctrines and Higher-Order Separation Logic Deciding Reachability in Mobile Ambients Denotational Semantics for Abadi and Leino's Logic of Objects A Design for a Security-Typed Language with Certificate-Based Declassification Adjoining Declassification and Attack Models by Abstract Interpretation Enforcing Resource Bounds via Static Verification of Dynamic Checks Asserting Bytecode Safety Subtyping First-Class Polymorphic Components Complexity of Subtype Satisfiability over Posets A Type System Equivalent to a Model Checker …… Author Index |
内容加载中，请稍后...
商品评论（0条）