Program analysis and compilation, theory and practice : essays dedicated to Reinhard Wilhelm on the occasion of his 60th birthday / / Thomas Reps, Mooly Sagiv, JoÌrg Bauer (editors) |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (369 p.) |
Disciplina | 005.14 |
Collana | Lecture notes in computer science |
Soggetto topico |
Computer programs - Verification
Compilers (Computer programs) Computer programming |
ISBN |
1-280-94069-7
9786610940691 3-540-71322-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | An Appreciation -- An Appreciation of the Work of Reinhard Wilhelm -- Technical Papers -- New Developments in WCET Analysis -- Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification -- Lazy Execution of Boolean Queries -- Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses -- Infering Ownership Types for Encapsulated Object-Oriented Program Components -- ViDoC - Visual Design of Optimizing Compilers -- Abstract Interpretation for Worst and Average Case Analysis -- Grammar Analysis and Parsing by Abstract Interpretation -- Ensuring Properties of Interaction Systems -- On the Expressive Power of Live Sequence Charts -- Refinement-Based Verification for Possibly-Cyclic Lists -- Abstract Counterexample-Based Refinement for Powerset Domains -- Types from Control Flow Analysis -- Data Flow Analysis for CCS -- Towards a Source Level Compiler: Source Level Modulo Scheduling. |
Record Nr. | UNINA-9910483927403321 |
Berlin ; ; Heidelberg : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Program analysis and compilation, theory and practice : essays dedicated to Reinhard Wilhelm on the occasion of his 60th birthday / / Thomas Reps, Mooly Sagiv, JoÌrg Bauer (editors) |
Edizione | [1st ed. 2007.] |
Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [2007] |
Descrizione fisica | 1 online resource (369 p.) |
Disciplina | 005.14 |
Collana | Lecture notes in computer science |
Soggetto topico |
Computer programs - Verification
Compilers (Computer programs) Computer programming |
ISBN |
1-280-94069-7
9786610940691 3-540-71322-0 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | An Appreciation -- An Appreciation of the Work of Reinhard Wilhelm -- Technical Papers -- New Developments in WCET Analysis -- Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification -- Lazy Execution of Boolean Queries -- Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses -- Infering Ownership Types for Encapsulated Object-Oriented Program Components -- ViDoC - Visual Design of Optimizing Compilers -- Abstract Interpretation for Worst and Average Case Analysis -- Grammar Analysis and Parsing by Abstract Interpretation -- Ensuring Properties of Interaction Systems -- On the Expressive Power of Live Sequence Charts -- Refinement-Based Verification for Possibly-Cyclic Lists -- Abstract Counterexample-Based Refinement for Powerset Domains -- Types from Control Flow Analysis -- Data Flow Analysis for CCS -- Towards a Source Level Compiler: Source Level Modulo Scheduling. |
Record Nr. | UNISA-996466249303316 |
Berlin ; ; Heidelberg : , : Springer, , [2007] | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Programming Languages and Systems [[electronic resource] ] : 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings / / edited by Mooly Sagiv |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XIV, 442 p.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Compilers (Computer programs) Computer programming Computer science Machine theory Software Engineering Compilers and Interpreters Programming Techniques Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNISA-996465674303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Programming languages and systems : 14th European Symposium on Programming, ESOP 2005, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4 - 8, 2005 : proceedings / / Mooly Sagiv (ed.) |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
Descrizione fisica | 1 online resource (XIV, 442 p.) |
Disciplina | 005.1 |
Altri autori (Persone) | SagivMooly |
Collana | Lecture notes in computer science |
Soggetto topico |
Computer programming
Programming languages (Electronic computers) |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Altri titoli varianti | ESOP 2005 |
Record Nr. | UNINA-9910483685503321 |
Berlin ; ; New York, : Springer, c2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|