Programming Languages and Systems
Springer Berlin (Verlag)
978-3-540-25435-5 (ISBN)
Programming with Explicit Security Policies.- Trace Partitioning in Abstract Interpretation Based Static Analyzers.- The ASTREÉ Analyzer.- Interprocedural Herbrand Equalities.- Analysis of Modular Arithmetic.- Forward Slicing by Conjunctive Partial 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.- Analysis of an Electronic Voting Protocol in the Applied Pi Calculus.- Streams with a Bottom in Functional Languages.- Bottom-Up ?-Reduction: Uplinks and ?-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.- Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close.- Towards a Type System for Analyzing JavaScript Programs.- Java JR: Fully Abstract Trace Semantics for a Core Java Language.
Erscheint lt. Verlag | 23.3.2005 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XIV, 442 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 690 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge |
Mathematik / Informatik ► Informatik ► Software Entwicklung | |
Informatik ► Theorie / Studium ► Compilerbau | |
Schlagworte | Complexity • Computer Languages • Erfüllbarkeitsproblem der Aussagenlogik • Formal Languages • Java • Language Implementation • Logic • programming calculi • Programming Language Design • Programming Languages • Programming Systems • Programming Theory • Program Semantics • Semantics • Software Security • verification |
ISBN-10 | 3-540-25435-8 / 3540254358 |
ISBN-13 | 978-3-540-25435-5 / 9783540254355 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich