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 2005 -- concurrency theory : 16th international conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005 : proceedings / / Martin Abadi, Luca de Alfaro (eds.)
| CONCUR 2005 -- concurrency theory : 16th international conference, CONCUR 2005, San Francisco, CA, USA, August 23-26, 2005 : proceedings / / Martin Abadi, Luca de Alfaro (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XXIV, 1280 p.) |
| Disciplina | 004/.35 |
| Altri autori (Persone) |
AbadiMartin
De AlfaroLuca <1966-> |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Parallel processing (Electronic computers)
Computer multitasking Processament en paral·lel (Ordinadors) Programació multitasca (Informàtica) |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Static Analysis Versus Model Checking for Bug Finding -- The Benefits of Exposing Calls and Returns -- A Compositional Approach to the Stochastic Dynamics of Gene Networks -- Contributed Papers -- Games Other People Play -- Type-Directed Concurrency -- Multiport Interaction Nets and Concurrency -- Model Checking for ?-Calculus Using Proof Search -- A Game Semantics of the Asynchronous ?-Calculus -- Efficient On-the-Fly Algorithms for the Analysis of Timed Games -- Modal Logics for Timed Control -- Timed Shuffle Expressions -- A New Modality for Almost Everywhere Properties in Timed Automata -- The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation -- A Behavioural Pseudometric for Metric Labelled Transition Systems -- On Probabilistic Program Equivalence and Refinement -- Probabilistic Anonymity -- Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus -- Timed Spi-Calculus with Types for Secrecy and Authenticity -- Selecting Theories and Recursive Protocols -- Constraint Solving for Contract-Signing Protocols -- A Ground-Complete Axiomatization of Finite State Processes in Process Algebra -- Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP -- Bisimulations Up-to for the Linear Time Branching Time Spectrum -- Deriving Weak Bisimulation Congruences from Reduction Systems -- SOS for Higher Order Processes -- The Individual and Collective Token Interpretations of Petri Nets -- Merged Processes — A New Condensed Representation of Petri Net Behaviour -- Concurrent Clustered Programming -- A Theory of System Behaviour in the Presence of Node and Link Failures -- Comparing Two Approaches to Compensable Flow Composition -- Transactions in RCCS -- Two-Player Nonzero-Sum ?-Regular Games -- Games Where You Can Play Optimally Without Any Memory -- On Implementation of Global Concurrent Systems with Local Asynchronous Controllers -- Defining Fairness -- Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems -- Termination Analysis of Integer Linear Loops -- A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs -- Verification of Qualitative ? Constraints -- Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces -- Taming Interface Specifications -- Synthesis of Distributed Systems from Knowledge-Based Specifications. |
| Altri titoli varianti | CONCUR 2005 |
| Record Nr. | UNINA-9910483511203321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of software science and computational structures : 12th international conference, FOSSACS 2009, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22 - 29, 2009 : proceedings / / Luca de Alfaro (ed.)
| Foundations of software science and computational structures : 12th international conference, FOSSACS 2009, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22 - 29, 2009 : proceedings / / Luca de Alfaro (ed.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XV, 471 p.) |
| Disciplina | 005.13 |
| Altri autori (Persone) | De AlfaroLuca <1966-> |
| Collana | Lecture notes in computer science |
| Soggetto topico |
System analysis
Computer systems |
| ISBN | 3-642-00596-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Facets of Synthesis: Revisiting Church’s Problem -- Temporal Reasoning about Program Executions -- Semantics -- Least and Greatest Fixpoints in Game Semantics -- Full Abstraction for Reduced ML -- Logics and Bisimulation Games for Concurrency, Causality and Conflict -- Logics and Automata -- Separating Graph Logic from MSO -- On the Completeness of Dynamic Logic -- Dependency Tree Automata -- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes -- Algebras -- A Kleene Theorem for Polynomial Coalgebras -- Coalgebraic Hybrid Logic -- A Description of Iterative Reflections of Monads (Extended Abstract) -- Automata Theory -- Tighter Bounds for the Determinisation of Büchi Automata -- Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata -- Interrupt Timed Automata -- Parameter Reduction in Grammar-Compressed Trees -- Processes and Models -- The Calculus of Handshake Configurations -- On the Expressive Power of Restriction and Priorities in CCS with Replication -- Normal Bisimulations in Calculi with Passivation -- Reactive Systems, Barbed Semantics, and the Mobile Ambients -- Security -- On the Foundations of Quantitative Information Flow -- Cryptographic Protocol Composition via the Authentication Tests -- Bisimulation for Demonic Schedulers -- Probabilistic and Quantitative Models -- On Omega-Languages Defined by Mean-Payoff Conditions -- Minimal Cost Reachability/Coverability in Priced Timed Petri Nets -- Delayed Nondeterminism in Continuous-Time Markov Decision Processes -- Concurrency, ?-Algebras, and Probabilistic Fairness -- Synthesis -- Synthesis from Component Libraries -- Realizability of Concurrent Recursive Programs -- Program Analysis and Semantics -- Beyond Shapes: Lists with Ordered Data -- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains -- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types. |
| Altri titoli varianti |
FOSSACS 2009
Joint European Conferences on Theory and Practice of Software |
| Record Nr. | UNINA-9910483792803321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Proceedings of the 8th Acm International Conference on Embedded Software
| Proceedings of the 8th Acm International Conference on Embedded Software |
| Autore | De Alfaro Luca <1966-> |
| Pubbl/distr/stampa | [Place of publication not identified], : Association for Computing Machinery, 2008 |
| Descrizione fisica | 1 online resource (284 p.;) |
| Collana | ACM Conferences |
| Soggetto topico | Information Technology - Computer Science (Hardware & Networks) |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Altri titoli varianti | EMSOFT '08 |
| Record Nr. | UNINA-9910376164303321 |
De Alfaro Luca <1966->
|
||
| [Place of publication not identified], : Association for Computing Machinery, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||