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 computation structures : Second International Conference, FOSSACS '99 held as part of the joint European Conferences on Theory and Practice of Software, ETAPS '99, Amsterdam, The Netherlands, March 22-28, 1999 : proceedings / / Wolfgang Thomas, editor
| Foundations of software science and computation structures : Second International Conference, FOSSACS '99 held as part of the joint European Conferences on Theory and Practice of Software, ETAPS '99, Amsterdam, The Netherlands, March 22-28, 1999 : proceedings / / Wolfgang Thomas, editor |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer-Verlag, , [1999] |
| Descrizione fisica | 1 online resource (X, 330 p.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer software
System analysis |
| ISBN | 3-540-49019-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Security Protocols and Specifications -- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis -- Reasoning about Concurrent Systems Using Types -- Testing Hennessy-Milner Logic with Recursion -- A Strong Logic Programming View for Static Embedded Implications -- Unfolding and Event Structure Semantics for Graph Grammars -- Expanding the Cube -- An Algebraic Characterization of Typability in ML with Subtyping -- Static Analysis of Processes for No Read-Up and No Write-Down -- A WP-calculus for OO -- The Recognizability Problem for Tree Automata with Comparisons between Brothers -- A Theory of “May” Testing for Asynchronous Languages -- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees -- Categorical Models of Explicit Substitutions -- Equational Properties of Mobile Ambients -- Model Checking Logics for Communicating Sequential Agents -- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects -- String Languages Generated by Total Deterministic Macro Tree Transducers -- Matching Specifications for Message Sequence Charts -- Probabilistic Temporal Logics via the Modal Mu-Calculus -- A ?-calculus Process Semantics of Concurrent Idealised ALGOL. |
| Record Nr. | UNINA-9910143466103321 |
| Berlin : , : Springer-Verlag, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of software science and computation structures : Second International Conference, FOSSACS '99 held as part of the joint European Conferences on Theory and Practice of Software, ETAPS '99, Amsterdam, The Netherlands, March 22-28, 1999 : proceedings / / Wolfgang Thomas, editor
| Foundations of software science and computation structures : Second International Conference, FOSSACS '99 held as part of the joint European Conferences on Theory and Practice of Software, ETAPS '99, Amsterdam, The Netherlands, March 22-28, 1999 : proceedings / / Wolfgang Thomas, editor |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer-Verlag, , [1999] |
| Descrizione fisica | 1 online resource (X, 330 p.) |
| Disciplina | 005.1 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer software
System analysis |
| ISBN | 3-540-49019-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Security Protocols and Specifications -- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis -- Reasoning about Concurrent Systems Using Types -- Testing Hennessy-Milner Logic with Recursion -- A Strong Logic Programming View for Static Embedded Implications -- Unfolding and Event Structure Semantics for Graph Grammars -- Expanding the Cube -- An Algebraic Characterization of Typability in ML with Subtyping -- Static Analysis of Processes for No Read-Up and No Write-Down -- A WP-calculus for OO -- The Recognizability Problem for Tree Automata with Comparisons between Brothers -- A Theory of “May” Testing for Asynchronous Languages -- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees -- Categorical Models of Explicit Substitutions -- Equational Properties of Mobile Ambients -- Model Checking Logics for Communicating Sequential Agents -- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects -- String Languages Generated by Total Deterministic Macro Tree Transducers -- Matching Specifications for Message Sequence Charts -- Probabilistic Temporal Logics via the Modal Mu-Calculus -- A ?-calculus Process Semantics of Concurrent Idealised ALGOL. |
| Record Nr. | UNISA-996465488403316 |
| Berlin : , : Springer-Verlag, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Logic [[electronic resource] /] / by Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas
| Mathematical Logic [[electronic resource] /] / by Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas |
| Autore | Ebbinghaus Heinz-Dieter <1939-> |
| Edizione | [3rd ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (305 pages) |
| Disciplina | 511.3 |
| Collana | Graduate Texts in Mathematics |
| Soggetto topico |
Mathematical logic
Computer science - Mathematics Mathematical Logic and Foundations Mathematics of Computing Càlcul Lògica matemàtica |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-030-73839-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A -- I Introduction -- II Syntax of First-Order Languages -- III Semantics of First-Order Languages -- IV A Sequent Calculus -- V The Completeness Theorem -- VI The Löwenheim–Skolem and the Compactness Theorem -- VII The Scope of First-Order Logic -- VIII Syntactic Interpretations and Normal Forms -- B -- IX Extensions of First-Order Logic -- X Computability and Its Limitations -- XI Free Models and Logic Programming -- XII An Algebraic Characterization of Elementary Equivalence -- XIII Lindström’s Theorems -- References -- List of Symbols -- Subject Index. |
| Record Nr. | UNISA-996466386503316 |
Ebbinghaus Heinz-Dieter <1939->
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Logic / / by Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas
| Mathematical Logic / / by Heinz-Dieter Ebbinghaus, Jörg Flum, Wolfgang Thomas |
| Autore | Ebbinghaus Heinz-Dieter <1939-> |
| Edizione | [3rd ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (305 pages) |
| Disciplina | 511.3 |
| Collana | Graduate Texts in Mathematics |
| Soggetto topico |
Mathematical logic
Computer science - Mathematics Mathematical Logic and Foundations Mathematics of Computing Càlcul Lògica matemàtica |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-030-73839-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A -- I Introduction -- II Syntax of First-Order Languages -- III Semantics of First-Order Languages -- IV A Sequent Calculus -- V The Completeness Theorem -- VI The Löwenheim–Skolem and the Compactness Theorem -- VII The Scope of First-Order Logic -- VIII Syntactic Interpretations and Normal Forms -- B -- IX Extensions of First-Order Logic -- X Computability and Its Limitations -- XI Free Models and Logic Programming -- XII An Algebraic Characterization of Elementary Equivalence -- XIII Lindström’s Theorems -- References -- List of Symbols -- Subject Index. |
| Record Nr. | UNINA-9910483447003321 |
|
Ebbinghaus Heinz-Dieter <1939->
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2006 : 23rd annual symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006 : proceedings / / Bruno Durand, Wolfgang Thomas (eds.)
| STACS 2006 : 23rd annual symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006 : proceedings / / Bruno Durand, Wolfgang Thomas (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XIX, 714 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
DurandBruno
ThomasWolfgang <1947-> |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Computer science |
| ISBN | 3-540-32288-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | The Ubiquitous Digital Tree -- Flat Holonomies on Automata Networks -- Interprocedurally Analyzing Polynomial Identities -- External String Sorting: Faster and Cache-Oblivious -- Amortized Rigidness in Dynamic Cartesian Trees -- Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes -- On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms -- Equivalence of -Algebras and Cubic Forms -- Complete Codes in a Sofic Shift -- Kolmogorov Complexity with Error -- Kolmogorov Complexity and the Recursion Theorem -- Entanglement in Interactive Proof Systems with Binary Answers -- Quantum Algorithms for Matching and Network Flows -- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound -- Estimating Entropy and Entropy Norm on Data Streams -- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems -- Exact Price of Anarchy for Polynomial Congestion Games -- Oblivious Symmetric Alternation -- Combining Multiple Heuristics -- Conflict-Free Colorings of Rectangles Ranges -- Grid Vertex-Unfolding Orthogonal Polyhedra -- Theory and Application of Width Bounded Geometric Separator -- Invariants of Automatic Presentations and Semi-synchronous Transductions -- On the Accepting Power of 2-Tape Büchi Automata -- Weighted Picture Automata and Weighted Logics -- Markov Decision Processes with Multiple Objectives -- The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms -- Convergence and Approximation in Potential Games -- Fast FPT-Algorithms for Cleaning Grids -- Tradeoffs in Depth-Two Superconcentrators -- On Hypergraph and Graph Isomorphism with Bounded Color Classes -- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences -- Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets -- Regularity Problems for Visibly Pushdown Languages -- Regular Expressions and NFAs Without ?-Transitions -- Redundancy in Complete Sets -- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds -- Linear Advice for Randomized Logarithmic Space -- Nested Pebbles and Transitive Closure -- Definability of Languages by Generalized First-Order Formulas over (N,+) -- Generalized Modal Satisfiability -- Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games -- DAG-Width and Parity Games -- Reliable Computations Based on Locally Decodable Codes -- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements -- A Faster Algorithm for the Steiner Tree Problem -- Generating Randomized Roundings with Cardinality Constraints and Derandomizations -- Online Sorting Buffers on Line -- Optimal Node Routing -- Memoryless Facility Location in One Pass -- Energy-Efficient Algorithms for Flow Time Minimization -- Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games -- Datalog and Constraint Satisfaction with Infinite Templates -- Evaluating Monotone Circuits on Cylinders, Planes and Tori -- Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two -- Weighted Asynchronous Cellular Automata -- On the Complexity of the “Most General” Firing Squad Synchronization Problem. |
| Record Nr. | UNINA-9910768161803321 |
| Berlin ; ; New York, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2007 [[electronic resource] ] : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings / / edited by Wolfgang Thomas, Pascal Weil
| STACS 2007 [[electronic resource] ] : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings / / edited by Wolfgang Thomas, Pascal Weil |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVIII, 710 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence—Data processing Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science |
| ISBN |
1-280-86534-2
9786610865345 3-540-70918-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- A Calculus and Algebra for Distributed Data Management -- The Büchi Complementation Saga -- Speed-Up Techniques for Shortest-Path Computations -- Session 1A -- Compact Forbidden-Set Routing -- A New Bound for Pure Greedy Hot Potato Routing -- Wavelength Management in WDM Rings to Maximize the Number of Connections -- Session 1B -- A First Investigation of Sturmian Trees -- On the Size of the Universal Automaton of a Regular Language -- Correlations of Partial Words -- Session 2A -- Testing Convexity Properties of Tree Colorings -- Why Almost All k-Colorable Graphs Are Easy -- Session 2B -- On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds -- A New Rank Technique for Formula Size Lower Bounds -- Session 3A -- Hard Metrics from Cayley Graphs of Abelian Groups -- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs -- Light Orthogonal Networks with Constant Geometric Dilation -- Session 3B -- Admissibility in Infinite Games -- Pure Stationary Optimal Strategies in Markov Decision Processes -- Symmetries and the Complexity of Pure Nash Equilibrium -- Session 4A -- Computing Representations of Matroids of Bounded Branch-Width -- Characterizing Minimal Interval Completions -- Session 4B -- The Complexity of Unions of Disjoint Sets -- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity -- Session 5A -- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets -- On the Complexity of Affine Image Matching -- Session 5B -- On Fixed Point Equations over Commutative Semirings -- An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings -- Session 6A -- A Cubic Kernel for Feedback Vertex Set -- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting -- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs -- Session 6B -- A Search Algorithm for the Maximal Attractor of a Cellular Automaton -- Universal Tilings -- On the Complexity of Unary Tiling-Recognizable Picture Languages -- Session 7A -- A Characterization of Strong Learnability in the Statistical Query Model -- On the Consistency of Discrete Bayesian Learning -- Session 7B -- VPSPACE and a Transfer Theorem over the Reals -- On Symmetric Signatures in Holographic Algorithms -- Session 8A -- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations -- Cheating to Get Better Roommates in a Random Stable Matching -- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window -- Session 8B -- Arithmetizing Classes Around NC 1 and L -- The Polynomially Bounded Perfect Matching Problem Is in NC 2 -- Languages with Bounded Multiparty Communication Complexity -- Session 9A -- New Approximation Algorithms for Minimum Cycle Bases of Graphs -- On Completing Latin Squares -- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications -- Session 9B -- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic -- Bounded-Variable Fragments of Hybrid Logics -- Rank-1 Modal Logics Are Coalgebraic -- Session 10A -- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups -- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem -- Quantum Network Coding -- Session 10B -- Reachability in Unions of Commutative Rewriting Systems Is Decidable -- Associative-Commutative Deducibility Constraints -- On the Automatic Analysis of Recursive Security Protocols with XOR -- Session 11A -- Improved Online Algorithms for the Sorting Buffer Problem -- Cost Sharing Methods for Makespan and Completion Time Scheduling -- Session 11B -- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests -- Enumerating All Solutions for Constraint Satisfaction Problems. |
| Record Nr. | UNISA-996465616203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings / / edited by Wolfgang Thomas, Pascal Weil
| STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings / / edited by Wolfgang Thomas, Pascal Weil |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XVIII, 710 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Artificial intelligence—Data processing Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Data Science |
| ISBN |
1-280-86534-2
9786610865345 3-540-70918-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- A Calculus and Algebra for Distributed Data Management -- The Büchi Complementation Saga -- Speed-Up Techniques for Shortest-Path Computations -- Session 1A -- Compact Forbidden-Set Routing -- A New Bound for Pure Greedy Hot Potato Routing -- Wavelength Management in WDM Rings to Maximize the Number of Connections -- Session 1B -- A First Investigation of Sturmian Trees -- On the Size of the Universal Automaton of a Regular Language -- Correlations of Partial Words -- Session 2A -- Testing Convexity Properties of Tree Colorings -- Why Almost All k-Colorable Graphs Are Easy -- Session 2B -- On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds -- A New Rank Technique for Formula Size Lower Bounds -- Session 3A -- Hard Metrics from Cayley Graphs of Abelian Groups -- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs -- Light Orthogonal Networks with Constant Geometric Dilation -- Session 3B -- Admissibility in Infinite Games -- Pure Stationary Optimal Strategies in Markov Decision Processes -- Symmetries and the Complexity of Pure Nash Equilibrium -- Session 4A -- Computing Representations of Matroids of Bounded Branch-Width -- Characterizing Minimal Interval Completions -- Session 4B -- The Complexity of Unions of Disjoint Sets -- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity -- Session 5A -- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets -- On the Complexity of Affine Image Matching -- Session 5B -- On Fixed Point Equations over Commutative Semirings -- An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings -- Session 6A -- A Cubic Kernel for Feedback Vertex Set -- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting -- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs -- Session 6B -- A Search Algorithm for the Maximal Attractor of a Cellular Automaton -- Universal Tilings -- On the Complexity of Unary Tiling-Recognizable Picture Languages -- Session 7A -- A Characterization of Strong Learnability in the Statistical Query Model -- On the Consistency of Discrete Bayesian Learning -- Session 7B -- VPSPACE and a Transfer Theorem over the Reals -- On Symmetric Signatures in Holographic Algorithms -- Session 8A -- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations -- Cheating to Get Better Roommates in a Random Stable Matching -- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window -- Session 8B -- Arithmetizing Classes Around NC 1 and L -- The Polynomially Bounded Perfect Matching Problem Is in NC 2 -- Languages with Bounded Multiparty Communication Complexity -- Session 9A -- New Approximation Algorithms for Minimum Cycle Bases of Graphs -- On Completing Latin Squares -- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications -- Session 9B -- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic -- Bounded-Variable Fragments of Hybrid Logics -- Rank-1 Modal Logics Are Coalgebraic -- Session 10A -- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups -- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem -- Quantum Network Coding -- Session 10B -- Reachability in Unions of Commutative Rewriting Systems Is Decidable -- Associative-Commutative Deducibility Constraints -- On the Automatic Analysis of Recursive Security Protocols with XOR -- Session 11A -- Improved Online Algorithms for the Sorting Buffer Problem -- Cost Sharing Methods for Makespan and Completion Time Scheduling -- Session 11B -- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests -- Enumerating All Solutions for Constraint Satisfaction Problems. |
| Record Nr. | UNINA-9910767527803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||