Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Foundations of Software Science and Computational Structures [[electronic resource] ] : 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software , ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings / / edited by Andrew D. Gordon
| Foundations of Software Science and Computational Structures [[electronic resource] ] : 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software , ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings / / edited by Andrew D. Gordon |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 440 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer logic Programming languages (Electronic computers) Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Software Engineering Programming Languages, Compilers, Interpreters Computation by Abstract Devices |
| ISBN | 3-540-36576-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- A Game Semantics for Generic Polymorphism -- Contributed Papers -- Categories of Containers -- Verification of Probabilistic Systems with Faulty Communication -- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes -- Ambiguous Classes in the Games ?-Calculus Hierarchy -- Parameterized Verification by Probabilistic Abstraction -- Genericity and the ?-Calculus -- Model Checking Lossy Channels Systems Is Probably Decidable -- Verification of Cryptographic Protocols: Tagging Enforces Termination -- A Normalisation Result for Higher-Order Calculi with Explicit Substitutions -- When Ambients Cannot Be Opened -- Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time -- An Intrinsic Characterization of Approximate Probabilistic Bisimilarity -- Manipulating Trees with Hidden Labels -- The Converse of a Stochastic Relation -- Type Assignment for Intersections and Unions in Call-by-Value Languages -- Cones and Foci for Protocol Verification Revisited -- Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems -- The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard -- A Game Semantics of Linearly Used Continuations -- Counting and Equality Constraints for Multitree Automata -- Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete -- A Monadic Multi-stage Metalanguage -- Multi-level Meta-reasoning with Higher-Order Abstract Syntax -- Abstraction in Reasoning about Higraph-Based Systems -- Deriving Bisimulation Congruences: 2-Categories Vs Precategories -- On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the ?Calculus. |
| Record Nr. | UNISA-996465499803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computational Structures : 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software , ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings / / edited by Andrew D. Gordon
| Foundations of Software Science and Computational Structures : 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conference on Theory and Practice of Software , ETAPS 2003, Warsaw, Poland, April 7-11, 2003, Proceedings / / edited by Andrew D. Gordon |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 440 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer logic Programming languages (Electronic computers) Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Software Engineering Programming Languages, Compilers, Interpreters Computation by Abstract Devices |
| ISBN | 3-540-36576-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- A Game Semantics for Generic Polymorphism -- Contributed Papers -- Categories of Containers -- Verification of Probabilistic Systems with Faulty Communication -- Generalized Iteration and Coiteration for Higher-Order Nested Datatypes -- Ambiguous Classes in the Games ?-Calculus Hierarchy -- Parameterized Verification by Probabilistic Abstraction -- Genericity and the ?-Calculus -- Model Checking Lossy Channels Systems Is Probably Decidable -- Verification of Cryptographic Protocols: Tagging Enforces Termination -- A Normalisation Result for Higher-Order Calculi with Explicit Substitutions -- When Ambients Cannot Be Opened -- Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time -- An Intrinsic Characterization of Approximate Probabilistic Bisimilarity -- Manipulating Trees with Hidden Labels -- The Converse of a Stochastic Relation -- Type Assignment for Intersections and Unions in Call-by-Value Languages -- Cones and Foci for Protocol Verification Revisited -- Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems -- The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard -- A Game Semantics of Linearly Used Continuations -- Counting and Equality Constraints for Multitree Automata -- Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete -- A Monadic Multi-stage Metalanguage -- Multi-level Meta-reasoning with Higher-Order Abstract Syntax -- Abstraction in Reasoning about Higraph-Based Systems -- Deriving Bisimulation Congruences: 2-Categories Vs Precategories -- On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the ?Calculus. |
| Record Nr. | UNINA-9910143888503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the fourth ACM Workshop on Formal methods in Security
| Proceedings of the fourth ACM Workshop on Formal methods in Security |
| Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2006 |
| Descrizione fisica | 1 online resource (78 pages) |
| Collana | ACM Conferences |
| Soggetto topico |
Engineering & Applied Sciences
Computer Science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | Proceedings of the fourth Association for Computing Machinery Workshop on Formal methods in Security |
| Record Nr. | UNINA-9910376495903321 |
| [Place of publication not identified], : ACM, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Programming languages and systems : 19th European Symposium on Programming, ESOP 2010, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20 - 28, 2010; proceedings / / Andrew D. Gordon (ed.)
| Programming languages and systems : 19th European Symposium on Programming, ESOP 2010, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2010, Paphos, Cyprus, March 20 - 28, 2010; proceedings / / Andrew D. Gordon (ed.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2010 |
| Descrizione fisica | 1 online resource (XV, 632 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) | GordonAndrew D |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer programming
Programming languages (Electronic computers) |
| ISBN |
1-280-38582-0
9786613563743 3-642-11957-3 |
| Classificazione |
DAT 350f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Audacity of Hope: Thoughts on Reclaiming the Database Dream -- Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions -- Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis -- Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays -- A Semantic Framework for Declassification and Endorsement -- Amortised Resource Analysis with Separation Logic -- A PolyTime Functional Language from Light Linear Logic -- Testing Polymorphic Properties -- Formal Verification of Coalescing Graph-Coloring Register Allocation -- A Theory of Speculative Computation -- Propositional Interpolation and Abstract Interpretation -- Functional Programming in Sublinear Space -- Logical Concurrency Control from Sequential Proofs -- Fluid Updates: Beyond Strong vs. Weak Updates -- Parameterized Memory Models and Concurrent Separation Logic -- Amortized Resource Analysis with Polynomial Potential -- Generative Operational Semantics for Relaxed Memory Models -- Automating Security Mediation Placement -- TRX: A Formally Verified Parser Interpreter -- On the Expressive Power of Primitives for Compensation Handling -- Separating Shape Graphs -- Deadlock-Free Channels and Locks -- Verifying a Compiler for Java Threads -- A Grammar-Based Approach to Invertible Programs -- Faulty Logic: Reasoning about Fault Tolerant Programs -- A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While -- A Universal Calculus for Stream Processing Languages -- Enforcing Stateful Authorization and Information Flow Policies in Fine -- Stateful Contracts for Affine Types -- CFA2: A Context-Free Approach to Control-Flow Analysis -- Weighted Dynamic Pushdown Networks -- Explicit Stabilisation for Modular Rely-Guarantee Reasoning. |
| Altri titoli varianti |
19th European Symposium on Programming
European Symposium on Programming ESOP 2010 ETAPS 2010 Joint European Conferences on Theory and Practice of Software |
| Record Nr. | UNINA-9910484592703321 |
| Berlin, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||