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.
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
| The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy [[electronic resource] ] : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXXIV, 461 p. 1292 illus., 45 illus. in color.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Logic programming Computer science - Mathematics Mathematical statistics Data protection Theory of Computation Software Engineering Logic in AI Probability and Statistics in Computer Science Data and Information Security |
| ISBN | 3-030-31175-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again. |
| Record Nr. | UNISA-996466338303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia
| The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy : Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday / / edited by Mário S. Alvim, Kostas Chatzikokolakis, Carlos Olarte, Frank Valencia |
| Edizione | [1st ed. 2019.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 |
| Descrizione fisica | 1 online resource (XXXIV, 461 p. 1292 illus., 45 illus. in color.) |
| Disciplina | 005.13 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Logic programming Computer science - Mathematics Mathematical statistics Data protection Theory of Computation Software Engineering Logic in AI Probability and Statistics in Computer Science Data and Information Security |
| ISBN | 3-030-31175-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Concurrency -- Variations of the Itai-Rodeh Algorithm for Computing Anonymous Ring Size -- Axiomatizing Team Equivalence for Finite-State Machines -- Asynchronous pi-calculus at work: the call-by-need strategy -- Deadlock Analysis of Wait-Notify Coordination -- Enhancing reaction systems: a process algebraic approach -- Checking the Expressivity of Firewall Languages -- Polymorphic Session Processes as Morphisms -- Guess Who's Coming: Runtime Inclusion of Participants in Choreographies -- A Complete Axiomatizion of Branching Bisimulation for a Simple Process Language with Probabilistic Choice -- Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies -- Stronger Validity Criteria for Encoding Synchrony -- Confluence of the Chinese Monoid -- Logic and Constraint Programming -- A coalgebraic approach to unification semantics of logic programming -- Polyadic Soft Constraints -- Security and Privacy -- Core-concavity, Gain Functions and Axioms for Information Leakage -- Formalisation of Probabilistic Testing Semantics in Coq -- Fully Syntactic Uniform Continuity Formats for Bisimulation Metrics -- Fooling the Parallel Or Tester with Probability 8/27 -- Categorical information flow -- Statistical Epistemic Logic -- Approximate model counting, sparse XOR constraints and minimum distance -- Verification and Control of Turn-Based Probabilistic Real-Time Games -- Refinement Metrics for Quantitative Information Flow -- Models and Puzzles -- Toward a Formal Model for Group Polarization in Social Networks -- Make Puzzles Great Again. |
| Record Nr. | UNINA-9910357851903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
SOFSEM 2009: Theory and Practice of Computer Science [[electronic resource] ] : 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings / / edited by Mogens Nielsen, Antonin Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank Valencia
| SOFSEM 2009: Theory and Practice of Computer Science [[electronic resource] ] : 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings / / edited by Mogens Nielsen, Antonin Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank Valencia |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XVII, 670 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Database management Computer programming Electronic digital computers—Evaluation Data mining Information storage and retrieval systems Theory of Computation Database Management Programming Techniques System Performance and Evaluation Data Mining and Knowledge Discovery Information Storage and Retrieval |
| ISBN | 3-540-95891-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- A New Analysis of Expected Revenue -- Can Component/Service-Based Systems Be Proved Correct? -- Probabilistic Acceptors for Languages over Infinite Words -- Automatic Verification of Heap Manipulation Using Separation Logic -- Technology Diffusion in Social Networks -- Service Oriented Architecture Pitfalls -- Algorithms for Solving Infinite Games -- Randomness and Determination, from Physics and Computing towards Biology -- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures -- Regular Papers -- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems -- Framed Versus Unframed Two-Dimensional Languages -- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes -- The Shortcut Problem – Complexity and Approximation -- Green Computing: Energy Consumption Optimized Service Hosting -- On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem -- Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems -- Epistemic Strategies and Games on Concurrent Processes -- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures -- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay -- Time and Fairness in a Process Algebra with Non-blocking Reading -- Expressiveness of Multiple Heads in CHR -- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes -- A Framework for Mutant Genetic Generation for WS-BPEL -- Implementing Services by Partial State Machines -- Pattern Matching with Swaps for Short Patterns in Linear Time -- Automatic Bug Detection in Microcontroller Software by Static Program Analysis -- On the Unification of Process Semantics: Observational Semantics -- Factoring and Testing Primes in Small Space -- Adaptive Incentive-Compatible Sponsored Search Auction -- Semantically-Aided Data-Aware Service Workflow Composition -- Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time -- Abstract Storage Devices -- On Stateless Deterministic Restarting Automata -- User Care Preference-Based Semantic Service Discovery in a Ubiquitous Environment -- Safe Reasoning with Logic LTS -- Partial Order Semantics of Types of Nets -- A Problem Kernelization for Graph Packing -- -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games -- Conjunctive Grammars with Restricted Disjunction -- Modelling and Verifying Mobile Systems Using ?-Graphs -- On Some SAT-Variants over Linear Formulas -- The Simple Reachability Problem in Switch Graphs -- Unambiguous Erasing Morphisms in Free Monoids -- An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA -- Asynchronous Deterministic Rendezvous on the Line -- Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image Manipulation -- Group Input Machine -- From Outermost Termination to Innermost Termination -- Improved Algorithms for the 2-Vertex Disjoint Paths Problem -- Event-Clock Visibly Pushdown Automata -- A Machine Checked Soundness Proof for an Intermediate Verification Language -- Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams -- Symbolic Reachability Analysis of Integer Timed Petri Nets -- On Toda’s Theorem in Structural Communication Complexity -- The Minimum Reload s-t Path/Trail/Walk Problems -- Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression -- A New Family of Regular Operators Fitting with the Position Automaton Computation -- A Formal Model of Business Application Integration from Web Services (Position Paper). |
| Record Nr. | UNISA-996465903103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||