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] ] : 24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, Proceedings / / edited by Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela
| Automata, Languages and Programming [[electronic resource] ] : 24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, Proceedings / / edited by Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XXXII, 864 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Programming languages (Electronic computers) Computer communication systems Computer science—Mathematics Theory of Computation Programming Techniques Programming Languages, Compilers, Interpreters Computer Communication Networks Mathematics of Computing |
| ISBN | 3-540-69194-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graphical calculi for interaction -- NP-completeness: A retrospective -- The LEDA platform for combinatorial and geometric computing -- The Wadge-Wagner hierarchy of ?-rational sets -- From chaotic iteration to constraint propagation -- DNA2DNA computations: A potential “killer app”? -- Tilings and quasiperiodicity -- Enumerative sequences of leaves in rational trees -- A completion algorithm for codes with bounded synchronization delay -- The expressibility of languages and relations by word equations -- Finite loops recognize exactly the regular open languages -- An abstract data type for real numbers -- Recursive computational depth -- Some bounds on the computational power of piecewise constant derivative systems (extended abstract) -- Monadic simultaneous rigid E-unification and related problems -- Computability on the probability measures on the Borel sets of the unit interval -- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs -- Results on resource-bounded measure -- Randomization and nondeterminism are comparable for ordered read-once branching programs -- Checking properties of polynomials -- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP -- Game theoretic analysis of call-by-value computation -- On modular properties of higher order extensional lambda calculi -- On explicit substitutions and names (extended abstract) -- On the dynamics of sharing graphs -- Minimizing diameters of dynamic trees -- Improving spanning trees by upgrading nodes -- Dynamic algorithms for graphs of bounded treewidth -- The name discipline of uniform receptiveness (extended abstract) -- On confluence in the ?-calculus -- A proof theoretical approach to communication -- Solving trace equations using lexicographical normal forms -- Star-free picture expressions are strictly weaker than first-order logic -- An algebra-based method to associate rewards with EMPA terms -- A semantics preserving actor translation -- Periodic and non-periodic min-max equations -- Efficient parallel graph algorithms for coarse grained multicomputers and BSP -- Upper bound on the communication complexity of private information retrieval -- Computation paths logic: An expressive, yet elementary, process logic -- Model checking the full modal mu-calculus for infinite sequential processes -- Symbolic model checking for probabilistic processes -- On the concentration of the height of binary search trees -- An improved master theorem for divide-and-conquer recurrences -- Bisimulation for probabilistic transition systems: A coalgebraic approach -- Distributed processes and location failures -- Basic observables for processes -- Constrained bipartite edge coloring with applications to wavelength routing -- Colouring paths in directed symmetric trees with applications to WDM routing -- On-line routing in all-optical networks -- A complete characterization of the path layout construction problem for ATM networks with given hop count and load -- Efficiency of asynchronous systems and read arcs in petri nets -- Bisimulation equivalence is decidable for one-counter processes -- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations -- Axiomatizations for the perpetual loop in process algebra -- Discrete-time control for rectangular hybrid automata -- Maintaining minimum spanning trees in dynamic graphs -- Efficient splitting and merging algorithms for order decomposable problems -- Efficient array partitioning -- Constructive linear time algorithms for branchwidth -- The word matching problem is undecidable for finite special string-rewriting systems that are confluent -- The geometry of orthogonal reduction spaces -- The theory of vaccines -- The equivalence problem for deterministic pushdown automata is decidable -- On recognizable and rational formal power series in partially commuting variables -- On a conjecture of J. Shallit -- On characterizations of escrow encryption schemes -- Randomness-efficient non-interactive zero knowledge -- Approximation results for the optimum cost chromatic partition problem -- The minimum color sum of bipartite graphs -- A primal-dual approach to approximation of node-deletion problems for matroidal properties -- Independent sets in asteroidal triple-free graphs -- Refining and compressing abstract domains -- Labelled reductions, runtime errors, and operational subsumption -- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m -- Recognizability equals definability for partial k-paths -- Molecular computing, bounded nondeterminism, and efficient recursion -- Constructing big trees from short sequences -- Termination of constraint logic programs -- The expressive power of unique total stable model semantics. |
| Record Nr. | UNISA-996465393303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming [[electronic resource] ] : 24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, Proceedings / / edited by Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela
| Automata, Languages and Programming [[electronic resource] ] : 24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, Proceedings / / edited by Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XXXII, 864 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Programming languages (Electronic computers) Computer networks Computer science—Mathematics Theory of Computation Programming Techniques Programming Languages, Compilers, Interpreters Computer Communication Networks Mathematics of Computing |
| ISBN | 3-540-69194-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graphical calculi for interaction -- NP-completeness: A retrospective -- The LEDA platform for combinatorial and geometric computing -- The Wadge-Wagner hierarchy of ?-rational sets -- From chaotic iteration to constraint propagation -- DNA2DNA computations: A potential “killer app”? -- Tilings and quasiperiodicity -- Enumerative sequences of leaves in rational trees -- A completion algorithm for codes with bounded synchronization delay -- The expressibility of languages and relations by word equations -- Finite loops recognize exactly the regular open languages -- An abstract data type for real numbers -- Recursive computational depth -- Some bounds on the computational power of piecewise constant derivative systems (extended abstract) -- Monadic simultaneous rigid E-unification and related problems -- Computability on the probability measures on the Borel sets of the unit interval -- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs -- Results on resource-bounded measure -- Randomization and nondeterminism are comparable for ordered read-once branching programs -- Checking properties of polynomials -- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP -- Game theoretic analysis of call-by-value computation -- On modular properties of higher order extensional lambda calculi -- On explicit substitutions and names (extended abstract) -- On the dynamics of sharing graphs -- Minimizing diameters of dynamic trees -- Improving spanning trees by upgrading nodes -- Dynamic algorithms for graphs of bounded treewidth -- The name discipline of uniform receptiveness (extended abstract) -- On confluence in the ?-calculus -- A proof theoretical approach to communication -- Solving trace equations using lexicographical normal forms -- Star-free picture expressions are strictly weaker than first-order logic -- An algebra-based method to associate rewards with EMPA terms -- A semantics preserving actor translation -- Periodic and non-periodic min-max equations -- Efficient parallel graph algorithms for coarse grained multicomputers and BSP -- Upper bound on the communication complexity of private information retrieval -- Computation paths logic: An expressive, yet elementary, process logic -- Model checking the full modal mu-calculus for infinite sequential processes -- Symbolic model checking for probabilistic processes -- On the concentration of the height of binary search trees -- An improved master theorem for divide-and-conquer recurrences -- Bisimulation for probabilistic transition systems: A coalgebraic approach -- Distributed processes and location failures -- Basic observables for processes -- Constrained bipartite edge coloring with applications to wavelength routing -- Colouring paths in directed symmetric trees with applications to WDM routing -- On-line routing in all-optical networks -- A complete characterization of the path layout construction problem for ATM networks with given hop count and load -- Efficiency of asynchronous systems and read arcs in petri nets -- Bisimulation equivalence is decidable for one-counter processes -- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations -- Axiomatizations for the perpetual loop in process algebra -- Discrete-time control for rectangular hybrid automata -- Maintaining minimum spanning trees in dynamic graphs -- Efficient splitting and merging algorithms for order decomposable problems -- Efficient array partitioning -- Constructive linear time algorithms for branchwidth -- The word matching problem is undecidable for finite special string-rewriting systems that are confluent -- The geometry of orthogonal reduction spaces -- The theory of vaccines -- The equivalence problem for deterministic pushdown automata is decidable -- On recognizable and rational formal power series in partially commuting variables -- On a conjecture of J. Shallit -- On characterizations of escrow encryption schemes -- Randomness-efficient non-interactive zero knowledge -- Approximation results for the optimum cost chromatic partition problem -- The minimum color sum of bipartite graphs -- A primal-dual approach to approximation of node-deletion problems for matroidal properties -- Independent sets in asteroidal triple-free graphs -- Refining and compressing abstract domains -- Labelled reductions, runtime errors, and operational subsumption -- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m -- Recognizability equals definability for partial k-paths -- Molecular computing, bounded nondeterminism, and efficient recursion -- Constructing big trees from short sequences -- Termination of constraint logic programs -- The expressive power of unique total stable model semantics. |
| Record Nr. | UNINA-9910768477803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational methods in systems biology : 7th international conference, CMSB 2009, Bologna, Italy, August 31-September 1, 2009. proceedings / / Pierpaolo Degano, Roberto Gorrieri (eds.)
| Computational methods in systems biology : 7th international conference, CMSB 2009, Bologna, Italy, August 31-September 1, 2009. proceedings / / Pierpaolo Degano, Roberto Gorrieri (eds.) |
| Autore | Degano Pierpaolo |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg, : Springer-Verlag, 2009 |
| Descrizione fisica | 1 online resource (X, 329 p.) |
| Disciplina | 570 |
| Altri autori (Persone) | GorrieriRoberto |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computational biology
Molecular biology - Data processing |
| ISBN | 3-642-03845-X |
| Classificazione |
BIO 110f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Prediction of Protein-Protein Interacting Sites: How to Bridge Molecular Events to Large Scale Protein Interaction Networks -- The Equivalence between Biology and Computation -- BlenX4Bio – BlenX for Biologists -- Modelling Biological Clocks with Bio-PEPA: Stochasticity and Robustness for the Neurospora crassa Circadian Network -- Quantitative Pathway Logic for Computational Biology -- A Prize-Collecting Steiner Tree Approach for Transduction Network Inference -- Formal Analysis of the Genetic Toggle -- Control Strategies for the Regulation of the Eukaryotic Heat Shock Response -- Computing Reachable States for Nonlinear Biological Models -- On Coupling Models Using Model-Checking: Effects of Irinotecan Injections on the Mammalian Cell Cycle -- The ?-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages -- Approximation of Event Probabilities in Noisy Cellular Processes -- Equivalence and Discretisation in Bio-PEPA -- Improved Parameter Estimation for Completely Observed Ordinary Differential Equations with Application to Biological Systems -- A Bayesian Approach to Model Checking Biological Systems -- Dynamic Compartments in the Imperative ?-Calculus -- Probabilistic Approximations of Signaling Pathway Dynamics -- A Reduction of Logical Regulatory Graphs Preserving Essential Dynamical Properties -- On the Use of Stochastic Petri Nets in the Analysis of Signal Transduction Pathways for Angiogenesis Process -- CSL Model Checking of Biochemical Networks with Interval Decision Diagrams -- Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models. |
| Record Nr. | UNINA-9910483490403321 |
Degano Pierpaolo
|
||
| Berlin ; ; Heidelberg, : Springer-Verlag, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computational Methods in Systems Biology [[electronic resource] ] : 7th International Conference, CMSB 2009 / / edited by Pierpaolo Degano, Roberto Gorrieri
| Computational Methods in Systems Biology [[electronic resource] ] : 7th International Conference, CMSB 2009 / / edited by Pierpaolo Degano, Roberto Gorrieri |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 329 p.) |
| Disciplina | 570 |
| Collana | Lecture Notes in Bioinformatics |
| Soggetto topico |
Life sciences
Computers Bioinformatics Computer simulation Numerical analysis Life Sciences, general Theory of Computation Computational Biology/Bioinformatics Simulation and Modeling Computation by Abstract Devices Numeric Computing |
| Soggetto genere / forma |
Bologna (2009)
Kongress. |
| ISBN | 3-642-03845-X |
| Classificazione |
BIO 110f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Prediction of Protein-Protein Interacting Sites: How to Bridge Molecular Events to Large Scale Protein Interaction Networks -- The Equivalence between Biology and Computation -- BlenX4Bio – BlenX for Biologists -- Modelling Biological Clocks with Bio-PEPA: Stochasticity and Robustness for the Neurospora crassa Circadian Network -- Quantitative Pathway Logic for Computational Biology -- A Prize-Collecting Steiner Tree Approach for Transduction Network Inference -- Formal Analysis of the Genetic Toggle -- Control Strategies for the Regulation of the Eukaryotic Heat Shock Response -- Computing Reachable States for Nonlinear Biological Models -- On Coupling Models Using Model-Checking: Effects of Irinotecan Injections on the Mammalian Cell Cycle -- The ?-Lattice: Decidability Boundaries for Qualitative Analysis in Biological Languages -- Approximation of Event Probabilities in Noisy Cellular Processes -- Equivalence and Discretisation in Bio-PEPA -- Improved Parameter Estimation for Completely Observed Ordinary Differential Equations with Application to Biological Systems -- A Bayesian Approach to Model Checking Biological Systems -- Dynamic Compartments in the Imperative ?-Calculus -- Probabilistic Approximations of Signaling Pathway Dynamics -- A Reduction of Logical Regulatory Graphs Preserving Essential Dynamical Properties -- On the Use of Stochastic Petri Nets in the Analysis of Signal Transduction Pathways for Angiogenesis Process -- CSL Model Checking of Biochemical Networks with Interval Decision Diagrams -- Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models. |
| Record Nr. | UNISA-996465732503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Methods for Open Object-Based Distributed Systems [[electronic resource] ] : 8th IFIP WG 6.1 International Conference, FMOODS 2006, Bologna, Italy, June 14-16, 2006, Proceedings / / edited by Roberto Gorrieri, Heike Wehrheim
| Formal Methods for Open Object-Based Distributed Systems [[electronic resource] ] : 8th IFIP WG 6.1 International Conference, FMOODS 2006, Bologna, Italy, June 14-16, 2006, Proceedings / / edited by Roberto Gorrieri, Heike Wehrheim |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 005.1/17 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Computer communication systems
Computer programming Software engineering Operating systems (Computers) Programming languages (Electronic computers) Computer logic Computer Communication Networks Programming Techniques Software Engineering Operating Systems Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
| ISBN | 3-540-34895-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Speakers -- Security Issues in Service Composition -- Separating Distribution from Coordination and Computation as Architectural Dimensions -- The Bisimulation Proof Method: Enhancements and Open Problems -- Regular Papers -- An Approach to Quality Achievement at the Architectural Level: AQUA -- Bounded Analysis and Decomposition for Behavioural Descriptions of Components -- Modeling and Validation of a Software Architecture for the Ariane-5 Launcher -- Synchronizing Behavioural Mismatch in Software Composition -- Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation -- Temporal Superimposition of Aspects for Dynamic Software Architecture -- Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata -- Transformation Laws for UML-RT -- Underspecification, Inherent Nondeterminism and Probability in Sequence Diagrams -- Generating Instance Models from Meta Models -- KM3: A DSL for Metamodel Specification -- Defining Object-Oriented Execution Semantics Using Graph Transformations -- Type-Safe Runtime Class Upgrades in Creol -- Abstract Interface Behavior of Object-Oriented Languages with Monitors -- Mobility Mechanisms in Service Oriented Computing -- Theoretical Foundations of Scope-Based Compensable Flow Language for Web Service. |
| Record Nr. | UNISA-996465504003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal methods for open object-based distributed systems : 8th IFIP WG 6.1 international conference, FMOODS 2006, Bologna, Italy, June 14-16, 2006 : proceedings / / Roberto Gorrieri, Heike Wehrheim (eds.)
| Formal methods for open object-based distributed systems : 8th IFIP WG 6.1 international conference, FMOODS 2006, Bologna, Italy, June 14-16, 2006 : proceedings / / Roberto Gorrieri, Heike Wehrheim (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (X, 270 p.) |
| Disciplina | 005.1/17 |
| Altri autori (Persone) |
GorrieriRoberto
WehrheimHeike |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 2, Programming and software engineering |
| Soggetto topico |
Electronic data processing - Distributed processing
Object-oriented programming (Computer science) |
| ISBN | 3-540-34895-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Speakers -- Security Issues in Service Composition -- Separating Distribution from Coordination and Computation as Architectural Dimensions -- The Bisimulation Proof Method: Enhancements and Open Problems -- Regular Papers -- An Approach to Quality Achievement at the Architectural Level: AQUA -- Bounded Analysis and Decomposition for Behavioural Descriptions of Components -- Modeling and Validation of a Software Architecture for the Ariane-5 Launcher -- Synchronizing Behavioural Mismatch in Software Composition -- Static Safety for an Actor Dedicated Process Calculus by Abstract Interpretation -- Temporal Superimposition of Aspects for Dynamic Software Architecture -- Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata -- Transformation Laws for UML-RT -- Underspecification, Inherent Nondeterminism and Probability in Sequence Diagrams -- Generating Instance Models from Meta Models -- KM3: A DSL for Metamodel Specification -- Defining Object-Oriented Execution Semantics Using Graph Transformations -- Type-Safe Runtime Class Upgrades in Creol -- Abstract Interface Behavior of Object-Oriented Languages with Monitors -- Mobility Mechanisms in Service Oriented Computing -- Theoretical Foundations of Scope-Based Compensable Flow Language for Web Service. |
| Altri titoli varianti | FMOODS 2006 |
| Record Nr. | UNINA-9910483966503321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Security Analysis and Design [[electronic resource] ] : Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri
| Foundations of Security Analysis and Design [[electronic resource] ] : Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 405 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer security
Data encryption (Computer science) Operating systems (Computers) Computer communication systems Computers and civilization Programming languages (Electronic computers) Systems and Data Security Cryptology Operating Systems Computer Communication Networks Computers and Society Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45608-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mathematical Models of Computer Security -- The Logic of Authentication Protocols -- Access Control: Policies, Models, and Mechanisms -- Security Goals: Packet Trajectories and Strand Spaces -- Notes on Nominal Calculi for Security and Mobility -- Classification of Security Properties. |
| Record Nr. | UNISA-996465805303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Security Analysis and Design : Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri
| Foundations of Security Analysis and Design : Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (VII, 405 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer security
Data encryption (Computer science) Operating systems (Computers) Computer networks Computers and civilization Programming languages (Electronic computers) Systems and Data Security Cryptology Operating Systems Computer Communication Networks Computers and Society Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-45608-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Mathematical Models of Computer Security -- The Logic of Authentication Protocols -- Access Control: Policies, Models, and Mechanisms -- Security Goals: Packet Trajectories and Strand Spaces -- Notes on Nominal Calculi for Security and Mobility -- Classification of Security Properties. |
| Record Nr. | UNINA-9910143624203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Security Analysis and Design II [[electronic resource] ] : FOSAD 2001/2002 Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri
| Foundations of Security Analysis and Design II [[electronic resource] ] : FOSAD 2001/2002 Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (VIII, 272 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Programming languages (Electronic computers) Computer logic Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Management of Computing and Information Systems |
| ISBN |
1-280-30683-1
9786610306831 3-540-24631-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Two Formal Approaches for Approximating Noninterference Properties -- The Key Establishment Problem -- A Survey of Name-Passing Calculi and Crypto-Primitives -- Classification of Security Properties -- Cryptographic Algorithms for Multimedia Traffic -- Security for Mobility. |
| Record Nr. | UNISA-996465930803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Security Analysis and Design II : FOSAD 2001/2002 Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri
| Foundations of Security Analysis and Design II : FOSAD 2001/2002 Tutorial Lectures / / edited by Riccardo Focardi, Roberto Gorrieri |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (VIII, 272 p.) |
| Disciplina | 005.8 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data encryption (Computer science)
Computer networks Operating systems (Computers) Programming languages (Electronic computers) Computer logic Management information systems Computer science Cryptology Computer Communication Networks Operating Systems Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Management of Computing and Information Systems |
| ISBN |
1-280-30683-1
9786610306831 3-540-24631-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Two Formal Approaches for Approximating Noninterference Properties -- The Key Establishment Problem -- A Survey of Name-Passing Calculi and Crypto-Primitives -- Classification of Security Properties -- Cryptographic Algorithms for Multimedia Traffic -- Security for Mobility. |
| Record Nr. | UNINA-9910768193903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
