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.
CONCUR '98 Concurrency Theory [[electronic resource] ] : 9th International Conference, Nice, France, September 8-11, 1998, Proceedings / / edited by Davide Sangiorgi, Robert de Simone
| CONCUR '98 Concurrency Theory [[electronic resource] ] : 9th International Conference, Nice, France, September 8-11, 1998, Proceedings / / edited by Davide Sangiorgi, Robert de Simone |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XIII, 663 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Computer logic Computers Computer programming Computer communication systems Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Computation by Abstract Devices Programming Techniques Computer Communication Networks |
| ISBN | 3-540-68455-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sometimes and not never re-revisited: on branching versus linear time -- Controllers for discrete event systems via morphisms -- Synthesis from knowledge-based specifications -- The regular viewpoint on PA-processes -- Herbrand automata for hardware verification -- Control flow analysis for the ?-calculus -- The tau-laws of fusion -- From higher-order ?-calculus to ?-calculus in the presence of static operators -- Minimality and separation results on asynchronous mobile processes -- Abstract games for infinite state processes -- Alternating refinement relations -- Possible worlds process algebras -- Automata and coinduction (an exercise in coalgebra) -- Axioms for real-time logics -- Priority and maximal progress are completely axiomatisable (extended abstract) -- Simulation is decidable for one-counter nets -- From rewrite to bisimulation congruences -- Reasoning about asynchronous communication in dynamically evolving object structures -- Modelling IP mobility -- Reduction in TLA -- Detecting deadlocks in concurrent systems -- Unfold/fold transformations of CCP programs -- Type systems for concurrent calculi -- Stochastic process algebras benefits for performance evaluation and challenges -- Algebraic techniques for timed systems -- Probabilistic resource failure in real-time process algebra -- Towards performance evaluation with general distributions in process algebras -- Stochastic transition systems -- It's about time: Real-time logics reviewed -- Controlled timed automata -- On discretization of delays in timed automata and digital circuits -- Partial order reductions for timed systems -- Unfolding and finite prefix for nets with read arcs -- Asynchronous cellular automata and asynchronous automata for pomsets -- Deriving unbounded Petri nets from formal languages -- Decompositions of asynchronous systems -- Synthesis of ENI-systems using minimal regions -- A categorical axiomatics for bisimulation -- Fibrational semantics of dataflow networks -- A relational model of non-deterministic dataflow -- Checking verifications of protocols and distributed systems by computer. |
| Record Nr. | UNISA-996466140303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CONCUR '98 Concurrency Theory : 9th International Conference, Nice, France, September 8-11, 1998, Proceedings / / edited by Davide Sangiorgi, Robert de Simone
| CONCUR '98 Concurrency Theory : 9th International Conference, Nice, France, September 8-11, 1998, Proceedings / / edited by Davide Sangiorgi, Robert de Simone |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (XIII, 663 p.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Programming languages (Electronic computers)
Computer logic Computers Computer programming Computer networks Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Computation by Abstract Devices Programming Techniques Computer Communication Networks |
| ISBN | 3-540-68455-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Sometimes and not never re-revisited: on branching versus linear time -- Controllers for discrete event systems via morphisms -- Synthesis from knowledge-based specifications -- The regular viewpoint on PA-processes -- Herbrand automata for hardware verification -- Control flow analysis for the ?-calculus -- The tau-laws of fusion -- From higher-order ?-calculus to ?-calculus in the presence of static operators -- Minimality and separation results on asynchronous mobile processes -- Abstract games for infinite state processes -- Alternating refinement relations -- Possible worlds process algebras -- Automata and coinduction (an exercise in coalgebra) -- Axioms for real-time logics -- Priority and maximal progress are completely axiomatisable (extended abstract) -- Simulation is decidable for one-counter nets -- From rewrite to bisimulation congruences -- Reasoning about asynchronous communication in dynamically evolving object structures -- Modelling IP mobility -- Reduction in TLA -- Detecting deadlocks in concurrent systems -- Unfold/fold transformations of CCP programs -- Type systems for concurrent calculi -- Stochastic process algebras benefits for performance evaluation and challenges -- Algebraic techniques for timed systems -- Probabilistic resource failure in real-time process algebra -- Towards performance evaluation with general distributions in process algebras -- Stochastic transition systems -- It's about time: Real-time logics reviewed -- Controlled timed automata -- On discretization of delays in timed automata and digital circuits -- Partial order reductions for timed systems -- Unfolding and finite prefix for nets with read arcs -- Asynchronous cellular automata and asynchronous automata for pomsets -- Deriving unbounded Petri nets from formal languages -- Decompositions of asynchronous systems -- Synthesis of ENI-systems using minimal regions -- A categorical axiomatics for bisimulation -- Fibrational semantics of dataflow networks -- A relational model of non-deterministic dataflow -- Checking verifications of protocols and distributed systems by computer. |
| Record Nr. | UNINA-9910767583903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theoretical Computer Science [[electronic resource] ] : 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings / / edited by Josep Diaz, Ivan Lanese, Davide Sangiorgi
| Theoretical Computer Science [[electronic resource] ] : 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings / / edited by Josep Diaz, Ivan Lanese, Davide Sangiorgi |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 355 p. 57 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-662-44602-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults -- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs -- Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks -- The Shortest Path Game: Complexity and Algorithms -- Online Scheduling of Unit Length Jobs with Commitment and Penalties -- The Lazy Matroid Problem -- Treewidth Computation and Kernelization in the Parallel External Memory Model -- Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic -- Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions -- Subshifts, MSO Logic, and Collapsing Hierarchies -- Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm -- Not All Multi-valued Partial CFL Functions Are Refined by Single-Valued Functions -- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus -- A Hoare-Like Calculus Using the SROIQσ Logic on Transformations of Graphs -- Termination Analysis for Graph Transformation Systems -- Tropical Two-Way Automata -- Parametric LTL on Markov Chains -- Specifying and Verifying Properties of Space -- Primal Infon Logic with Conjunctions as Sets -- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic -- Towards a Coalgebraic Chomsky Hierarchy (Extended Abstract) -- Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics -- Quantitative Types for the Linear Substitution Calculus -- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata -- Looking at Separation Algebras with Boolean BI-eyes -- The Inhabitation Problem for Non-idempotent Intersection Types. |
| Record Nr. | UNISA-996202528003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science : 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings / / edited by Josep Diaz, Ivan Lanese, Davide Sangiorgi
| Theoretical Computer Science : 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings / / edited by Josep Diaz, Ivan Lanese, Davide Sangiorgi |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVI, 355 p. 57 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Computer science - Mathematics Discrete mathematics Numerical analysis Theory of Computation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Discrete Mathematics in Computer Science Numerical Analysis |
| ISBN | 3-662-44602-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults -- On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs -- Perfect Pipelining for Streaming Large File in Peer-to-Peer Networks -- The Shortest Path Game: Complexity and Algorithms -- Online Scheduling of Unit Length Jobs with Commitment and Penalties -- The Lazy Matroid Problem -- Treewidth Computation and Kernelization in the Parallel External Memory Model -- Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic -- Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions -- Subshifts, MSO Logic, and Collapsing Hierarchies -- Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm -- Not All Multi-valued Partial CFL Functions Are Refined by Single-Valued Functions -- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus -- A Hoare-Like Calculus Using the SROIQσ Logic on Transformations of Graphs -- Termination Analysis for Graph Transformation Systems -- Tropical Two-Way Automata -- Parametric LTL on Markov Chains -- Specifying and Verifying Properties of Space -- Primal Infon Logic with Conjunctions as Sets -- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic -- Towards a Coalgebraic Chomsky Hierarchy (Extended Abstract) -- Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics -- Quantitative Types for the Linear Substitution Calculus -- Generic Partition Refinement Algorithms for Coalgebras and an Instantiation to Weighted Automata -- Looking at Separation Algebras with Boolean BI-eyes -- The Inhabitation Problem for Non-idempotent Intersection Types. |
| Record Nr. | UNINA-9910484599703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Trustworthy Global Computing [[electronic resource] ] : International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005. Revised Selected Papers / / edited by Rocco De Nicola, Davide Sangiorgi
| Trustworthy Global Computing [[electronic resource] ] : International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005. Revised Selected Papers / / edited by Rocco De Nicola, Davide Sangiorgi |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (VIII, 371 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer networks Computer programming Operating systems (Computers) Compilers (Computer programs) Software Engineering Computer Communication Networks Programming Techniques Operating Systems Compilers and Interpreters |
| ISBN | 3-540-31483-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Harmony: The Art of Reconciliation -- A Theory of Noninterference for the ?-Calculus -- Typed Processes in Untyped Contexts -- Model–Based Testing of Cryptographic Protocols -- A General Name Binding Mechanism -- Types for Security in a Mobile World -- History-Based Access Control for Distributed Processes -- Programming Cryptographic Protocols -- A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange -- A Formal Semantics for Protocol Narrations -- web ? at Work -- Concurrency Among Strangers -- The Modelling and Analysis of OceanStore Elements Using the CSP Dependability Library -- A Practical Formal Model for Safety Analysis in Capability-Based Systems -- Mixin Modules for Dynamic Rebinding -- A Distributed Object-Oriented Language with Session Types -- Engineering Runtime Requirements-Monitoring Systems Using MDA Technologies -- Automated Analysis of Infinite Scenarios -- Namespace Logic: A Logic for a Reflective Higher-Order Calculus -- Erratum. |
| Record Nr. | UNISA-996465952003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Trustworthy Global Computing : International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005. Revised Selected Papers / / edited by Rocco De Nicola, Davide Sangiorgi
| Trustworthy Global Computing : International Symposium, TGC 2005, Edinburgh, UK, April 7-9, 2005. Revised Selected Papers / / edited by Rocco De Nicola, Davide Sangiorgi |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (VIII, 371 p.) |
| Disciplina | 005.8 |
| Altri autori (Persone) |
De NicolaRocco
SangiorgiDavide |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Computer networks Computer programming Operating systems (Computers) Compilers (Computer programs) Software Engineering Computer Communication Networks Programming Techniques Operating Systems Compilers and Interpreters |
| ISBN | 3-540-31483-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Harmony: The Art of Reconciliation -- A Theory of Noninterference for the ?-Calculus -- Typed Processes in Untyped Contexts -- Model–Based Testing of Cryptographic Protocols -- A General Name Binding Mechanism -- Types for Security in a Mobile World -- History-Based Access Control for Distributed Processes -- Programming Cryptographic Protocols -- A Framework for Analyzing Probabilistic Protocols and Its Application to the Partial Secrets Exchange -- A Formal Semantics for Protocol Narrations -- web ? at Work -- Concurrency Among Strangers -- The Modelling and Analysis of OceanStore Elements Using the CSP Dependability Library -- A Practical Formal Model for Safety Analysis in Capability-Based Systems -- Mixin Modules for Dynamic Rebinding -- A Distributed Object-Oriented Language with Session Types -- Engineering Runtime Requirements-Monitoring Systems Using MDA Technologies -- Automated Analysis of Infinite Scenarios -- Namespace Logic: A Logic for a Reflective Higher-Order Calculus -- Erratum. |
| Record Nr. | UNINA-9910483475903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||