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.
Application and theory of petri nets 2002 : 23rd international conference, icatpn 2002, adelaide, australia, june 24-30, 2002. proceedings / / edited by Javier Esparza, Charles Lakos
| Application and theory of petri nets 2002 : 23rd international conference, icatpn 2002, adelaide, australia, june 24-30, 2002. proceedings / / edited by Javier Esparza, Charles Lakos |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Germany : , : Springer, , [2002] |
| Descrizione fisica | 1 online resource (X, 445 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer tech nieken
Wiskunde Mathematics |
| ISBN | 3-540-48068-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Making Work Flow: On the Application of Petri Nets to Business Process Management -- Model Validation — A Theoretical Issue? -- The Real-Time Refinement Calculus: A Foundation for Machine-Independent Real-Time Programming -- The Challenge of Object Orientation for the Analysis of Concurrent Systems -- Abstract Cyclic Communicating Processes: A Logical View -- Is the Die Cast for the Token Game? -- Regular Papers -- Quasi-Static Scheduling of Independent Tasks for Reactive Systems -- Data Decision Diagrams for Petri Net Analysis -- Non-controllable Choice Robustness Expressing the Controllability of Workflow Processes -- Real-Time Synchronised Petri Nets -- Computing a Finite Prefix of a Time Petri Net -- Verification of a Revised WAP Wireless Transaction Protocol -- Characterizing Liveness of Petri Nets in Terms of Siphons -- Petri Nets, Situations, and Automata -- Reproducibility of the Empty Marking -- Modeling and Analysis of Multi-class Threshold-Based Queues with Hysteresis Using Stochastic Petri Nets -- Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification -- Modelling of Features and Feature Interactions in Nokia Mobile Phones Using Coloured Petri Nets -- Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method -- Regular Event Structures and Finite Petri Nets: The Conflict-Free Case -- A Formal Service Specification for the Internet Open Trading Protocol -- Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm -- Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow -- Translating TPAL Specifications into Timed-Arc Petri Nets -- Tool Presentation -- Maria: Modular Reachability Analyser for Algebraic System Nets. |
| Record Nr. | UNINA-9910143902603321 |
| Germany : , : Springer, , [2002] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Application and theory of petri nets 2002 : 23rd international conference, icatpn 2002, adelaide, australia, june 24-30, 2002. proceedings / / edited by Javier Esparza, Charles Lakos
| Application and theory of petri nets 2002 : 23rd international conference, icatpn 2002, adelaide, australia, june 24-30, 2002. proceedings / / edited by Javier Esparza, Charles Lakos |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Germany : , : Springer, , [2002] |
| Descrizione fisica | 1 online resource (X, 445 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer tech nieken
Wiskunde Mathematics |
| ISBN | 3-540-48068-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Making Work Flow: On the Application of Petri Nets to Business Process Management -- Model Validation — A Theoretical Issue? -- The Real-Time Refinement Calculus: A Foundation for Machine-Independent Real-Time Programming -- The Challenge of Object Orientation for the Analysis of Concurrent Systems -- Abstract Cyclic Communicating Processes: A Logical View -- Is the Die Cast for the Token Game? -- Regular Papers -- Quasi-Static Scheduling of Independent Tasks for Reactive Systems -- Data Decision Diagrams for Petri Net Analysis -- Non-controllable Choice Robustness Expressing the Controllability of Workflow Processes -- Real-Time Synchronised Petri Nets -- Computing a Finite Prefix of a Time Petri Net -- Verification of a Revised WAP Wireless Transaction Protocol -- Characterizing Liveness of Petri Nets in Terms of Siphons -- Petri Nets, Situations, and Automata -- Reproducibility of the Empty Marking -- Modeling and Analysis of Multi-class Threshold-Based Queues with Hysteresis Using Stochastic Petri Nets -- Tackling the Infinite State Space of a Multimedia Control Protocol Service Specification -- Modelling of Features and Feature Interactions in Nokia Mobile Phones Using Coloured Petri Nets -- Analysing Infinite-State Systems by Combining Equivalence Reduction and the Sweep-Line Method -- Regular Event Structures and Finite Petri Nets: The Conflict-Free Case -- A Formal Service Specification for the Internet Open Trading Protocol -- Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm -- Token-Controlled Place Refinement in Hierarchical Petri Nets with Application to Active Document Workflow -- Translating TPAL Specifications into Timed-Arc Petri Nets -- Tool Presentation -- Maria: Modular Reachability Analyser for Algebraic System Nets. |
| Record Nr. | UNISA-996466217103316 |
| Germany : , : Springer, , [2002] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXX, 624 p. 49 illus.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43951-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Track B: Logic, Semantics, Automata, and Theory of Programming -- Symmetric Groups and Quotient Complexity of Boolean Operations -- Handling Infinitely Branching WSTS -- Transducers with Origin Information -- Weak MSO+U with Path Quantifiers over Infinite Trees -- On the Decidability of MSO+U on Infinite Trees -- A Coalgebraic Foundation for Coinductive Union Types -- Turing Degrees of Limit Sets of Cellular Automata -- On the Complexity of Temporal-Logic Path Checking -- Parameterised Linearisability -- Games with a Weak Adversary -- The Complexity of Ergodic Mean-payoff Games -- Toward a Structure Theory of Regular Infinitary Trace Languages -- Unary Pushdown Automata and Straight-Line Programs -- Robustness against Power is PSpace-complete -- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic -- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs -- Coalgebraic Weak Bisimulation from Recursive Equations over Monads -- Piecewise Boolean Algebras and Their Domains -- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency -- Bisimulation Equivalence of First-Order Grammars -- Context Unification is in PSPACE -- Monodic Fragments of Probabilistic First-Order Logic -- Stability and Complexity of Minimising Probabilistic Automata -- Kleene Algebra with Equations -- All–Instances Termination of Chase is Undecidable -- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus -- On the Positivity Problem for Simple Linear Recurrence Sequences -- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences -- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words -- Hardness Results for Intersection Non-Emptiness -- Branching Bisimilarity Checking for PRS -- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs -- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints -- Distributed Computing on Core-Periphery Networks: Axiom-Based Design 399 -- Fault-Tolerant Rendezvous in Networks -- Data Delivery by Energy-Constrained Mobile Agents on a Line -- The Power of Two Choices in Distributed Voting -- Jamming-Resistant Learning in Wireless Networks -- Facility Location in Evolving Metrics -- Solving the ANTS Problem with Asynchronous Finite State Machines -- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set -- Randomized Rumor Spreading in Dynamic Graphs -- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods -- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems -- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds -- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router -- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud -- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems -- Bypassing Erdos’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. |
| Record Nr. | UNISA-996200139403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXXIV, 1090 p. 74 illus.) |
| Disciplina | 001.642 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43948-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs. |
| Record Nr. | UNISA-996200139803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXXIV, 1090 p. 74 illus.) |
| Disciplina | 001.642 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43948-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs. |
| Record Nr. | UNINA-9910484091103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXX, 624 p. 49 illus.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43951-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Track B: Logic, Semantics, Automata, and Theory of Programming -- Symmetric Groups and Quotient Complexity of Boolean Operations -- Handling Infinitely Branching WSTS -- Transducers with Origin Information -- Weak MSO+U with Path Quantifiers over Infinite Trees -- On the Decidability of MSO+U on Infinite Trees -- A Coalgebraic Foundation for Coinductive Union Types -- Turing Degrees of Limit Sets of Cellular Automata -- On the Complexity of Temporal-Logic Path Checking -- Parameterised Linearisability -- Games with a Weak Adversary -- The Complexity of Ergodic Mean-payoff Games -- Toward a Structure Theory of Regular Infinitary Trace Languages -- Unary Pushdown Automata and Straight-Line Programs -- Robustness against Power is PSpace-complete -- A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic -- Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs -- Coalgebraic Weak Bisimulation from Recursive Equations over Monads -- Piecewise Boolean Algebras and Their Domains -- Between Linearizability and Quiescent Consistency: Quantitative Quiescent Consistency -- Bisimulation Equivalence of First-Order Grammars -- Context Unification is in PSPACE -- Monodic Fragments of Probabilistic First-Order Logic -- Stability and Complexity of Minimising Probabilistic Automata -- Kleene Algebra with Equations -- All–Instances Termination of Chase is Undecidable -- Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus -- On the Positivity Problem for Simple Linear Recurrence Sequences -- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences -- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words -- Hardness Results for Intersection Non-Emptiness -- Branching Bisimilarity Checking for PRS -- Track C: Foundations of Networked Computing Labeling Schemes for Bounded Degree Graphs -- Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints -- Distributed Computing on Core-Periphery Networks: Axiom-Based Design 399 -- Fault-Tolerant Rendezvous in Networks -- Data Delivery by Energy-Constrained Mobile Agents on a Line -- The Power of Two Choices in Distributed Voting -- Jamming-Resistant Learning in Wireless Networks -- Facility Location in Evolving Metrics -- Solving the ANTS Problem with Asynchronous Finite State Machines -- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set -- Randomized Rumor Spreading in Dynamic Graphs -- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods -- Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems -- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds -- Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router -- The Melbourne Shuffle: Improving Oblivious Storage in the Cloud -- Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems -- Bypassing Erdos’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners. |
| Record Nr. | UNINA-9910484021803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automated Technology for Verification and Analysis [[electronic resource] ] : 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings / / edited by Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza
| Automated Technology for Verification and Analysis [[electronic resource] ] : 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings / / edited by Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (xi, 552 pages) : illustrations |
| Disciplina | 004.015113 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer logic Mathematical logic Artificial intelligence Algorithms Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Artificial Intelligence Algorithm Analysis and Problem Complexity |
| ISBN | 3-030-31784-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Note on Game Theory and Verification -- Lazy Abstraction-Based Controller Synthesis -- Truth Assignments as Conditional Autarkies -- Can We Trust Autonomous Systems? Boundaries and Risks -- Teaching Stratego to Play Ball : Optimal Synthesis for Continuous Space MDPs -- Using Symmetry Transformations in Equivariant Dynamical Systems for their Safety Verification -- Parametric Timed Model Checking for Guaranteeing Timed Opacity -- Adaptive Online First-Order Monitoring -- Multi-Head Monitoring of Metric Temporal Logic -- An Efficient Algorithm for Computing Causal Trace Sets in Causality Checking -- Conditional Testing: O -the-Shelf Combination of Test-Case Generators -- Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation -- BUBEN: Automated Library Abstractions Enabling Scalable Bug Detection for Large Programs with I/O and Complex Environment -- KLUZZER: Whitebox Fuzzing on top of LLVM -- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops -- Chain Free String Constraints -- Synthesizing Efficient Low-Precision Kernels -- New Optimizations and Heuristics for Determinization of Büchi Automata -- Approximate Automata for Omega-regular Languages -- DEQ : Equivalence Checker for Deterministic Register Automata -- LTL3TELA: Small Deterministic or Nondeterministic Automata from LTL -- Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems -- Reactive Synthesis of Graphical User Interface Glue Code -- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis -- Program Repair for Hyperproperties -- Generic Emptiness Check for Fun and Profit -- Deciding Fast Termination for Probabilistic VASS with Nondeterminism -- Are Parametric Markov Chains Monotonic -- Efficient Information-Flow Verification under Speculative Execution -- Model Checking Data Flows in Concurrent Network Updates.-Performance Evaluation of NDN Data Plane Using Statistical Model Checking. |
| Record Nr. | UNISA-996466283103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automated Technology for Verification and Analysis : 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings / / edited by Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza
| Automated Technology for Verification and Analysis : 17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings / / edited by Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (xi, 552 pages) : illustrations |
| Disciplina |
004.015113
006.333 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer logic Mathematical logic Artificial intelligence Algorithms Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Artificial Intelligence Algorithm Analysis and Problem Complexity |
| ISBN | 3-030-31784-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Note on Game Theory and Verification -- Lazy Abstraction-Based Controller Synthesis -- Truth Assignments as Conditional Autarkies -- Can We Trust Autonomous Systems? Boundaries and Risks -- Teaching Stratego to Play Ball : Optimal Synthesis for Continuous Space MDPs -- Using Symmetry Transformations in Equivariant Dynamical Systems for their Safety Verification -- Parametric Timed Model Checking for Guaranteeing Timed Opacity -- Adaptive Online First-Order Monitoring -- Multi-Head Monitoring of Metric Temporal Logic -- An Efficient Algorithm for Computing Causal Trace Sets in Causality Checking -- Conditional Testing: O -the-Shelf Combination of Test-Case Generators -- Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation -- BUBEN: Automated Library Abstractions Enabling Scalable Bug Detection for Large Programs with I/O and Complex Environment -- KLUZZER: Whitebox Fuzzing on top of LLVM -- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops -- Chain Free String Constraints -- Synthesizing Efficient Low-Precision Kernels -- New Optimizations and Heuristics for Determinization of Büchi Automata -- Approximate Automata for Omega-regular Languages -- DEQ : Equivalence Checker for Deterministic Register Automata -- LTL3TELA: Small Deterministic or Nondeterministic Automata from LTL -- Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems -- Reactive Synthesis of Graphical User Interface Glue Code -- Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis -- Program Repair for Hyperproperties -- Generic Emptiness Check for Fun and Profit -- Deciding Fast Termination for Probabilistic VASS with Nondeterminism -- Are Parametric Markov Chains Monotonic -- Efficient Information-Flow Verification under Speculative Execution -- Model Checking Data Flows in Concurrent Network Updates.-Performance Evaluation of NDN Data Plane Using Statistical Model Checking. |
| Record Nr. | UNINA-9910349272103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Dependable software systems engineering / / edited by Javier Esparza, Orna Grumberg, Salomon Sickert
| Dependable software systems engineering / / edited by Javier Esparza, Orna Grumberg, Salomon Sickert |
| Pubbl/distr/stampa | Amsterdam, Netherlands : , : IOS Press, , 2016 |
| Descrizione fisica | 1 online resource (296 pages) |
| Disciplina | 005.8 |
| Collana | NATO Science for Peace and Security Series : Sub-Series D: Information and Communication Security |
| Soggetto topico |
Computer security
Computer networks - Security measures Software engineering |
| Soggetto genere / forma | Electronic books. |
| ISBN |
9781614996279
1-61499-627-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Probabilistic Model Checking -- SMT Solvers: Foundations and Applications -- 2. Formal Models for Analyzing Security Protocols: Some Lecture Notes -- 3. Parameterized Verification of Crowds of Anonymous Processes -- 4. Synthesis of Reactive Systems -- 5. Between Testing and Verification: Dynamic Software Model Checking -- 6. Learning-Based Compositional Model Checking of Behavioral UML Systems -- 7. Programming by Examples (and Its Applications in Data Wrangling) -- 8. Verification of Concurrent Software -- 9. A Tutorial on Mean-Payoff and Energy Games -- 10. Equivalence - Combinatorics, Algebra, Proofs -- 11. Analysis and Synthesis with "Big Code" |
| Record Nr. | UNINA-9910465467003321 |
| Amsterdam, Netherlands : , : IOS Press, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Dependable software systems engineering / / edited by Javier Esparza, Orna Grumberg, Salomon Sickert
| Dependable software systems engineering / / edited by Javier Esparza, Orna Grumberg, Salomon Sickert |
| Pubbl/distr/stampa | Amsterdam, Netherlands : , : IOS Press, , 2016 |
| Descrizione fisica | 1 online resource (296 pages) |
| Disciplina | 005.8 |
| Collana | NATO Science for Peace and Security Series : Sub-Series D: Information and Communication Security |
| Soggetto topico |
Computer security
Computer networks - Security measures Software engineering |
| ISBN |
9781614996279
1-61499-627-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Probabilistic Model Checking -- SMT Solvers: Foundations and Applications -- 2. Formal Models for Analyzing Security Protocols: Some Lecture Notes -- 3. Parameterized Verification of Crowds of Anonymous Processes -- 4. Synthesis of Reactive Systems -- 5. Between Testing and Verification: Dynamic Software Model Checking -- 6. Learning-Based Compositional Model Checking of Behavioral UML Systems -- 7. Programming by Examples (and Its Applications in Data Wrangling) -- 8. Verification of Concurrent Software -- 9. A Tutorial on Mean-Payoff and Energy Games -- 10. Equivalence - Combinatorics, Algebra, Proofs -- 11. Analysis and Synthesis with "Big Code" |
| Record Nr. | UNINA-9910798482303321 |
| Amsterdam, Netherlands : , : IOS Press, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
