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.
Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis
| Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XXIV, 614 p. 78 illus.) |
| Disciplina | 005.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Computer networks Software engineering Algorithms Computer science Programming Techniques Computer Communication Networks Software Engineering Theory of Computation |
| ISBN |
1-280-38771-8
9786613565631 3-642-14162-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Informative Labeling Schemes -- Noetherian Spaces in Verification -- Towards a Theory of Time-Bounded Verification -- Physical Algorithms -- Session 1-Track B. Automata -- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata -- Pumping and Counting on the Regular Post Embedding Problem -- Alternation Removal in Büchi Automata -- Linear Orders in the Pushdown Hierarchy -- Session 1-Track C. Communication in Networks -- The Serializability of Network Codes -- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) -- Efficient Information Exchange in the Random Phone-Call Model -- An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines -- Session 2-Track B. Formal Languages -- A Topological Approach to Recognition -- On LR(k)-Parsers of Polynomial Size -- On Erasing Productions in Random Context Grammars -- Session 4-Track B. Semantics -- Game Semantics for Call-by-Value Polymorphism -- What Is a Pure Functional? -- Example-Guided Abstraction Simplification -- Compositional Closure for Bayes Risk in Probabilistic Noninterference -- Session 4-Track C. Fault Tolerance, Ranking -- Asynchronous Throughput-Optimal Routing in Malicious Networks -- Improved Fault Tolerance and Secure Computation on Sparse Networks -- Sparse Reliable Graph Backbones -- Approximation Algorithms for Diversified Search Ranking -- Session 5-Track B. Graphs, Categories and Quantum Information -- Rewriting Measurement-Based Quantum Computations with Generalised Flow -- The Compositional Structure of Multipartite Quantum Entanglement -- Compositionality in Graph Transformation -- Session 6-Track B. Best Paper Award -- On p-Optimal Proof Systems and Logics for PTIME -- Session 6-Track C. Best Paper Award -- Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests -- Session 7-Track B. Logic -- Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals -- B and D Are Enough to Make the Halpern–Shoham Logic Undecidable -- Parameterized Modal Satisfiability -- Automata for Coalgebras: An Approach Using Predicate Liftings -- Session 7-Track C. Privacy, Selfishness -- Resolving the Complexity of Some Data Privacy Problems -- Private and Continual Release of Statistics -- Envy-Free Pricing in Multi-item Markets -- Contention Resolution under Selfishness -- Session 8-Track B. Concurrency -- On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi -- On Bisimilarity and Substitution in Presence of Replication -- The Downward-Closure of Petri Net Languages -- Reachability Games on Extended Vector Addition Systems with States -- Session 8-Track C. Mobile Agents -- Modelling Mobility: A Discrete Revolution -- Tell Me Where I Am So I Can Meet You Sooner -- Rendezvous of Mobile Agents without Agreement on Local Orientation -- Session 9-Track B. Probabilistic Computation -- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems -- Space-Efficient Scheduling of Stochastically Generated Tasks -- Exponential Lower Bounds for Policy Iteration -- Session 10-Track B. Automata -- Regular Temporal Cost Functions -- Model Checking Succinct and Parametric One-Counter Automata -- Pebble Weighted Automata and Transitive Closure Logics -- Energy Parity Games. |
| Record Nr. | UNISA-996465841903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis
| Automata, Languages and Programming [[electronic resource] ] : 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I / / edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XXIII, 754 p. 42 illus.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer programming Computer networks Algorithms Artificial intelligence Computer science Software Engineering Programming Techniques Computer Communication Networks Artificial Intelligence Theory of Computation |
| ISBN |
1-280-38772-6
9786613565648 3-642-14165-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs. |
| Record Nr. | UNISA-996465839903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated deduction, CADE-15 : 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998 : proceedings / / Claude Kirchner, Hélène Kirchner, eds
| Automated deduction, CADE-15 : 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998 : proceedings / / Claude Kirchner, Hélène Kirchner, eds |
| Pubbl/distr/stampa | Springer Berlin / Heidelberg |
| Disciplina | 006.3/3 |
| Altri autori (Persone) |
KirchnerHélène
KirchnerClaude |
| Soggetto topico |
Automatic theorem proving - Congresses
Logic, Symbolic and mathematical - Congresses |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466143103316 |
| Springer Berlin / Heidelberg | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated deduction, CADE-15 : 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998 : proceedings / / Claude Kirchner, Hélène Kirchner, eds
| Automated deduction, CADE-15 : 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998 : proceedings / / Claude Kirchner, Hélène Kirchner, eds |
| Pubbl/distr/stampa | Springer Berlin / Heidelberg |
| Disciplina | 006.3/3 |
| Altri autori (Persone) |
KirchnerHélène
KirchnerClaude |
| Soggetto topico |
Automatic theorem proving - Congresses
Logic, Symbolic and mathematical - Congresses |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910143631503321 |
| Springer Berlin / Heidelberg | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal to Practical Security [[electronic resource] ] : Papers Issued from the 2005-2008 French-Japanese Collaboration / / edited by Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada
| Formal to Practical Security [[electronic resource] ] : Papers Issued from the 2005-2008 French-Japanese Collaboration / / edited by Véronique Cortier, Claude Kirchner, Mitsuhiro Okada, Hideki Sakurada |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (VII, 199 p.) |
| Disciplina | 004 |
| Collana | Security and Cryptology |
| Soggetto topico |
Data encryption (Computer science)
Computer programming Pattern recognition Computers and civilization Data structures (Computer science) Biometrics (Biology) Cryptology Programming Techniques Pattern Recognition Computers and Society Data Structures and Information Theory Biometrics |
| Soggetto genere / forma | Aufsatzsammlung |
| ISBN | 3-642-02002-X |
| Classificazione |
DAT 460f
DAT 465f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal to Practical Security -- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables -- Validating Integrity for the Ephemerizer’s Protocol with CL-Atse -- Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols -- Fake Fingers in Fingerprint Recognition: Glycerin Supersedes Gelatin -- Comparing State Spaces in Automatic Security Protocol Analysis -- Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures -- Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment -- New Anonymity Notions for Identity-Based Encryption -- Computationally Sound Formalization of Rerandomizable RCCA Secure Encryption -- Writing an OS Kernel in a Strictly and Statically Typed Language. |
| Record Nr. | UNISA-996466267503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Rewriting techniques and applications : 5th international conference, RTA-93, Montreal, Canada, June 16-18, 1993 : proceedings / / Claude Kirchner, editor
| Rewriting techniques and applications : 5th international conference, RTA-93, Montreal, Canada, June 16-18, 1993 : proceedings / / Claude Kirchner, editor |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1993] |
| Descrizione fisica | 1 online resource (XI, 492 p.) |
| Disciplina | 005.13/1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Rewriting systems (Computer science)
Computer programming Algorithms |
| Soggetto genere / forma | Electronic books. |
| ISBN | 3-662-21551-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Rewrite techniques in theorem proving -- Redundancy criteria for constrained completion -- Bi-rewriting, a term rewriting technique for monotonic order relations -- A case study of completion modulo distributivity and Abelian groups -- A semantic approach to order-sorted rewriting -- Distributing equational theorem proving -- On the correctness of a distributed memory Gröbner basis algorithm -- Improving transformation systems for general E-unification -- Equational and membership constraints for infinite trees -- Regular path expressions in feature logic -- Proving properties of typed lambda terms: Realizability, covers, and sheaves -- Some lambda calculi with categorical sums and products -- Paths, computations and labels in the ?-calculus -- Confluence and superdevelopments -- Relating graph and term rewriting via Böhm models -- Topics in termination -- Total termination of term rewriting -- Simple termination is difficult -- Optimal normalization in orthogonal term rewriting systems -- A graph reduction approach to incremental term rewriting -- Generating tables for bottom-up matching -- On some algorithmic problems for groups and monoids -- Combination techniques and decision problems for disunification -- The negation elimination from syntactic equational formula is decidable -- Encompassment properties and automata with constraints -- Recursively defined tree transductions -- AC complement problems: Satisfiability and negation elimination -- A precedence-based total AC-compatible ordering -- Extension of the associative path ordering to a chain of associative commutative symbols -- Polynomial time termination and constraint satisfaction tests -- Linear interpretations by counting patterns -- Some undecidable termination problems for semi-Thue systems -- Saturation of first-order (constrained) clauses with the Saturate system -- MERILL: An equational reasoning system in standard ML -- Reduce the redex ? ReDuX -- Agg — An implementation of algebraic graph rewriting -- Smaran: A congruence-closure based system for equational computations -- LAMBDALG: Higher order algebraic specification language -- More problems in rewriting. |
| Record Nr. | UNISA-996466085803316 |
| Berlin, Germany ; ; New York, New York : , : Springer-Verlag, , [1993] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Rewriting, Computation and Proof [[electronic resource] ] : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner
| Rewriting, Computation and Proof [[electronic resource] ] : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner |
| Autore | Comon Hubert |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 276 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Compilers (Computer programs) Computer programming Software engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Programming Techniques Software Engineering |
| ISBN | 3-540-73147-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Rewriting Foundations -- The Hydra Battle Revisited -- Orderings and Constraints: Theory and Practice of Proving Termination -- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations -- Computability Closure: Ten Years Later -- Reduction Strategies and Acyclicity -- Proof and Computation -- Towards Rewriting in Coq -- Superdeduction at Work -- Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic ?-Calculus -- Linear Recursive Functions -- Towards Safety and Security -- Deducibility Constraints, Equational Theory and Electronic Money -- Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms -- Towards Modular Algebraic Specifications for Pointer Programs: A Case Study -- Modeling Permutations in Coq for Coccinelle. |
| Record Nr. | UNISA-996466253303316 |
Comon Hubert
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Rewriting, Computation and Proof : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner
| Rewriting, Computation and Proof : Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday / / edited by Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner |
| Autore | Comon Hubert |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVI, 276 p.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Compilers (Computer programs) Computer programming Software engineering Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Compilers and Interpreters Programming Techniques Software Engineering |
| ISBN | 3-540-73147-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Rewriting Foundations -- The Hydra Battle Revisited -- Orderings and Constraints: Theory and Practice of Proving Termination -- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations -- Computability Closure: Ten Years Later -- Reduction Strategies and Acyclicity -- Proof and Computation -- Towards Rewriting in Coq -- Superdeduction at Work -- Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic ?-Calculus -- Linear Recursive Functions -- Towards Safety and Security -- Deducibility Constraints, Equational Theory and Electronic Money -- Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms -- Towards Modular Algebraic Specifications for Pointer Programs: A Case Study -- Modeling Permutations in Coq for Coccinelle. |
| Record Nr. | UNINA-9910483171803321 |
|
Comon Hubert
|
||
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||