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 [[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 | ||
| ||
Concurrency, Graphs and Models [[electronic resource] ] : Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday / / edited by Pierpaolo Degano, Rocco de Nicola, José Meseguer
| Concurrency, Graphs and Models [[electronic resource] ] : Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday / / edited by Pierpaolo Degano, Rocco de Nicola, José Meseguer |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XV, 810 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Algorithms Software engineering Artificial intelligence Theory of Computation Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Software Engineering Artificial Intelligence |
| ISBN | 3-540-68679-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Ugo Montanari in a Nutshell -- Ugo Montanari in a Nutshell -- Graph Transformation -- Ugo Montanari and Graph Transformation -- Unfolding Graph Transformation Systems: Theory and Applications to Verification -- Graph-Based Design and Analysis of Dynamic Software Architectures -- Graph Transformation Units – An Overview -- Synchronous Multiparty Synchronizations and Transactions -- Transformations in Reconfigurable Place/Transition Systems -- Explicit State Model Checking for Graph Grammars -- Linear-Ordered Graph Grammars: Applications to Distributed Systems Design -- Constraint and Logic Programming -- Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section -- Semiring-Based Soft Constraints -- Declarative Debugging of Membership Equational Logic Specifications -- SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets -- An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy -- AND/OR Multi-valued Decision Diagrams for Constraint Networks -- Software Engineering -- Software Engineering: Ugo Montanari’s Main Contributions and Introduction to the Section -- Modeling Business within a UML-Based Rigorous Software Development Approach -- From Domain to Requirements -- Business Process Modeling for Organizational Knowledge Management -- Event-Based Service Coordination -- Dynamically Evolvable Dependable Software: From Oxymoron to Reality -- The Temporal Logic of Rewriting: A Gentle Introduction -- A Heterogeneous Approach to UML Semantics -- Concurrency Theory -- Ugo Montanari and Concurrency Theory -- On the Synthesis of Zero-Safe Nets -- A Note on Persistent Petri Nets -- Secure Data Flow in a Calculus for Context Awareness -- On Beta-Binders Communications -- On the Asynchronous Nature of the Asynchronous ?-Calculus -- StonyCam: A Formal Framework for Modeling, Analyzing and Regulating Cardiac Myocytes -- Models of Computation -- Models of Computation: A Tribute to Ugo Montanari’s Vision -- Automatic Mutual Exclusion and Atomicity Checks -- Petri Nets, Discrete Physics, and Distributed Quantum Computation -- A Category of Explicit Fusions -- What Do Semantics Matter When the Meat Is Overcooked? -- Calculating Colimits Compositionally -- Observability Concepts in Abstract Data Type Specification, 30 Years Later -- Software Verification -- Ugo Montanari and Software Verification -- History Dependent Automata for Service Compatibility -- A Type System for Client Progress in a Service-Oriented Calculus -- Session and Union Types for Object Oriented Programming -- The Pairing of Contracts and Session Types -- Specifying and Analysing SOC Applications with COWS -- Approximating Behaviors in Embedded System Design -- Friends -- Ugo Montanari and Friends -- Calculating with Automata -- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra -- Some Theorems Concerning the Core Function -- The Seventies -- Categories, Software and Meaning -- A Roman Senator -- The Semantics of Ugo Montanari -- Abstraction for a Career in Industry: A Praise for Ugo’s 65 Years. |
| Record Nr. | UNISA-996465283403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Concurrency, graphs and models : essays dedicated to Ugo Montanari on the occasion of his 65th birthday / / Pierpaolo Degano, Rocco De Nicola, Jose Meseguer (eds.)
| Concurrency, graphs and models : essays dedicated to Ugo Montanari on the occasion of his 65th birthday / / Pierpaolo Degano, Rocco De Nicola, Jose Meseguer (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (XV, 810 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
DeganoPierpaolo
De NicolaRocco MeseguerJose |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Graph theory
Computer science - Mathematics |
| ISBN | 3-540-68679-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Ugo Montanari in a Nutshell -- Ugo Montanari in a Nutshell -- Graph Transformation -- Ugo Montanari and Graph Transformation -- Unfolding Graph Transformation Systems: Theory and Applications to Verification -- Graph-Based Design and Analysis of Dynamic Software Architectures -- Graph Transformation Units – An Overview -- Synchronous Multiparty Synchronizations and Transactions -- Transformations in Reconfigurable Place/Transition Systems -- Explicit State Model Checking for Graph Grammars -- Linear-Ordered Graph Grammars: Applications to Distributed Systems Design -- Constraint and Logic Programming -- Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section -- Semiring-Based Soft Constraints -- Declarative Debugging of Membership Equational Logic Specifications -- SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets -- An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy -- AND/OR Multi-valued Decision Diagrams for Constraint Networks -- Software Engineering -- Software Engineering: Ugo Montanari’s Main Contributions and Introduction to the Section -- Modeling Business within a UML-Based Rigorous Software Development Approach -- From Domain to Requirements -- Business Process Modeling for Organizational Knowledge Management -- Event-Based Service Coordination -- Dynamically Evolvable Dependable Software: From Oxymoron to Reality -- The Temporal Logic of Rewriting: A Gentle Introduction -- A Heterogeneous Approach to UML Semantics -- Concurrency Theory -- Ugo Montanari and Concurrency Theory -- On the Synthesis of Zero-Safe Nets -- A Note on Persistent Petri Nets -- Secure Data Flow in a Calculus for Context Awareness -- On Beta-Binders Communications -- On the Asynchronous Nature of the Asynchronous ?-Calculus -- StonyCam: A Formal Framework for Modeling, Analyzing and Regulating Cardiac Myocytes -- Models of Computation -- Models of Computation: A Tribute to Ugo Montanari’s Vision -- Automatic Mutual Exclusion and Atomicity Checks -- Petri Nets, Discrete Physics, and Distributed Quantum Computation -- A Category of Explicit Fusions -- What Do Semantics Matter When the Meat Is Overcooked? -- Calculating Colimits Compositionally -- Observability Concepts in Abstract Data Type Specification, 30 Years Later -- Software Verification -- Ugo Montanari and Software Verification -- History Dependent Automata for Service Compatibility -- A Type System for Client Progress in a Service-Oriented Calculus -- Session and Union Types for Object Oriented Programming -- The Pairing of Contracts and Session Types -- Specifying and Analysing SOC Applications with COWS -- Approximating Behaviors in Embedded System Design -- Friends -- Ugo Montanari and Friends -- Calculating with Automata -- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra -- Some Theorems Concerning the Core Function -- The Seventies -- Categories, Software and Meaning -- A Roman Senator -- The Semantics of Ugo Montanari -- Abstraction for a Career in Industry: A Praise for Ugo’s 65 Years. |
| Record Nr. | UNINA-9910484825303321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal Aspects in Security and Trust [[electronic resource] ] : 6th International Workshop, FAST 2009, Eindhoven, The Netherlands, November 5-6, 2009, Revised Selected Papers / / edited by Pierpaolo Degano, Joshua D. Guttman
| Formal Aspects in Security and Trust [[electronic resource] ] : 6th International Workshop, FAST 2009, Eindhoven, The Netherlands, November 5-6, 2009, Revised Selected Papers / / edited by Pierpaolo Degano, Joshua D. Guttman |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 279 p. 46 illus.) |
| Disciplina | 004.6 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer communication systems
Data encryption (Computer science) Computer security Computers and civilization Management information systems Computer science Information storage and retrieval Computer Communication Networks Cryptology Systems and Data Security Computers and Society Management of Computing and Information Systems Information Storage and Retrieval |
| ISBN |
1-280-38625-8
9786613564177 3-642-12459-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lecture -- Semantics and Enforcement of Expressive Information Flow Policies -- Session 1. Trust -- An Algebra for Trust Dilution and Trust Fusion -- HMM-Based Trust Model -- Deriving Trust from Experience -- Reflections on Trust: Trust Assurance by Dynamic Discovery of Static Properties -- Session 2. Workflow and Orchestration -- Model Checking of Security-Sensitive Business Processes -- Session 3. Secure Flow -- Analysing the Information Flow Properties of Object-Capability Patterns -- Applied Quantitative Information Flow and Statistical Databases -- Specification and Verification of Side Channel Declassification -- Secure Information Flow for Distributed Systems -- Session 4. Mobility and Deniability -- Probable Innocence in the Presence of Independent Knowledge -- A Calculus of Trustworthy Ad Hoc Networks -- Session 5. Protocols 1 -- Comparison of Cryptographic Verification Tools Dealing with Algebraic Properties -- Game-Based Verification of Multi-Party Contract Signing Protocols -- Attack, Solution and Verification for Shared Authorisation Data in TCG TPM -- Session 6. Protocols 2 -- Trusted Multiplexing of Cryptographic Protocols -- Specifying and Modelling Secure Channels in Strand Spaces -- Session 7. Protocols 3 -- Integrating Automated and Interactive Protocol Verification -- A User Interface for a Game-Based Protocol Verification Tool. |
| Record Nr. | UNISA-996465278403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal aspects in security and trust : 6th international workshop, FAST 2009, Eindhoven, The Netherlands, November 5-6, 2009, revised selected papers / / Pierpaolo Degano, Joshua D. Guttman (eds.)
| Formal aspects in security and trust : 6th international workshop, FAST 2009, Eindhoven, The Netherlands, November 5-6, 2009, revised selected papers / / Pierpaolo Degano, Joshua D. Guttman (eds.) |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (X, 279 p. 46 illus.) |
| Disciplina | 004.6 |
| Altri autori (Persone) |
DeganoPierpaolo
GuttmanJoshua D |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer security
Formal methods (Computer science) Trust |
| ISBN |
1-280-38625-8
9786613564177 3-642-12459-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session 1. Trust -- Session 2. Workflow and orchestration -- Session 3. Secure flow -- Session 4. Mobility and deniability -- Session 5. Protocols 1 -- Session 6. Protocols 2 -- Session 7. Protocols 3. |
| Record Nr. | UNINA-9910484167003321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal Aspects in Security and Trust [[electronic resource] ] : 5th International Workshop, FAST 2008 Malaga, Spain, October 9-10, 2008, Revised Selected Papers / / edited by Pierpaolo Degano, Joshua D. Guttman, Fabio Martinelli
| Formal Aspects in Security and Trust [[electronic resource] ] : 5th International Workshop, FAST 2008 Malaga, Spain, October 9-10, 2008, Revised Selected Papers / / edited by Pierpaolo Degano, Joshua D. Guttman, Fabio Martinelli |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (X, 331 p.) |
| Disciplina | 005.8 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer security
Computer communication systems Data encryption (Computer science) Computers and civilization Management information systems Computer science Information storage and retrieval Systems and Data Security Computer Communication Networks Cryptology Computers and Society Management of Computing and Information Systems Information Storage and Retrieval |
| ISBN | 3-642-01465-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Formal Certification of ElGamal Encryption -- Secure Information Flow as a Safety Property -- Who Can Declassify? -- Non-Interference for Deterministic Interactive Programs -- Information-Theoretic Modeling and Analysis of Interrupt-Related Covert Channels -- Causality and Accountability -- Dynamics, Robustness and Fragility of Trust -- Trust within the Context of Organizations: A Formal Approach -- Know What You Trust -- Privacy-Friendly Electronic Traffic Pricing via Commits -- A Formal Privacy Management Framework -- Parameterised Anonymity -- Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder -- Petri Net Security Checker: Structural Non-interference at Work -- Verifying Multi-party Authentication Using Rank Functions and PVS -- The Append-Only Web Bulletin Board -- Secure Broadcast Ambients -- Extending Anticipation Games with Location, Penalty and Timeline -- Do You Really Mean What You Actually Enforced? -- Delegating Privileges over Finite Resources: A Quota Based Delegation Approach -- Access Control and Information Flow in Transactional Memory. |
| Record Nr. | UNISA-996466037203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Aspects of Security and Trust [[electronic resource] ] : 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers / / edited by Pierpaolo Degano, Sandro Etalle, Joshua Guttman
| Formal Aspects of Security and Trust [[electronic resource] ] : 7th International Workshop, FAST 2010, Pisa, Italy, September 16-17, 2010. Revised Selected Papers / / edited by Pierpaolo Degano, Sandro Etalle, Joshua Guttman |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (X, 239 p.) |
| Disciplina | 004.6 |
| Collana | Security and Cryptology |
| Soggetto topico |
Computer communication systems
Data encryption (Computer science) Computer security Computers and civilization Management information systems Computer science Information storage and retrieval Computer Communication Networks Cryptology Systems and Data Security Computers and Society Management of Computing and Information Systems Information Storage and Retrieval |
| ISBN | 3-642-19751-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465930903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Methods for Computational Systems Biology [[electronic resource] ] : 8th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2008 Bertinoro, Italy, June 2-7, 2008 / / edited by Marco Bernardo, Pierpaolo Degano, Gianluigi Zavattaro
| Formal Methods for Computational Systems Biology [[electronic resource] ] : 8th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2008 Bertinoro, Italy, June 2-7, 2008 / / edited by Marco Bernardo, Pierpaolo Degano, Gianluigi Zavattaro |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 527 p.) |
| Disciplina | 005.1 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Software engineering
Programming languages (Electronic computers) Computer logic Special purpose computers Computer communication systems Software Engineering/Programming and Operating Systems Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Special Purpose and Application-Based Systems Computer Communication Networks |
| ISBN | 3-540-68894-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular Lectures -- Sensitivity Analysis of Stochastic Models of Bistable Biochemical Reactions -- Pathway Logic -- Formal Cell Biology in Biocham -- Hierarchical Modeling for Computational Biology -- Simulation Methods in Systems Biology -- Membrane Computing as a Modeling Framework. Cellular Systems Case Studies -- Petri Nets for Systems and Synthetic Biology -- Process Algebras in Systems Biology -- The BlenX Language: A Tutorial -- BISCA Talks -- Cells in Silico: A Holistic Approach -- The Calculus of Looping Sequences -- Hybrid Systems and Biology -- ?@: A ?-Based Process Calculus for the Implementation of Compartmentalised Bio-inspired Calculi -- A Gentle Introduction to Stochastic (Poly)Automata Collectives and the (Bio)Chemical Ground Form. |
| Record Nr. | UNISA-996465616403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
