CONCUR 2006 : concurrency theory : 17th international conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 : proceedings / / Christel Baier, Holger Hermanns (eds.) |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, : Springer, 2006 |
Descrizione fisica | 1 online resource (XIII, 525 p.) |
Disciplina | 004/.35 |
Altri autori (Persone) |
BaierChristel
HermannsHolger <1967-> |
Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Soggetto topico | Parallel processing (Electronic computers) |
ISBN | 3-540-37377-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Contributions -- Modeling Timed Concurrent Systems -- Some Remarks on Definability of Process Graphs -- Sanity Checks in Formal Verification -- Invited Tutorials -- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi -- Probability and Nondeterminism in Operational Models of Concurrency -- Model Checking -- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems -- Proving Liveness by Backwards Reachability -- Model Checking Quantified Computation Tree Logic -- Process Calculi -- Liveness, Fairness and Impossible Futures -- Checking a Mutex Algorithm in a Process Algebra with Fairness -- A Complete Axiomatic Semantics for the CSP Stable-Failures Model -- Transition Systems of Elementary Net Systems with Localities -- Minimization and Equivalence Checking -- Operational Determinism and Fast Algorithms -- Minimization, Learning, and Conformance Testing of Boolean Programs -- A Capability Calculus for Concurrency and Determinism -- Types -- A New Type System for Deadlock-Free Processes -- Sortings for Reactive Systems -- Dynamic Access Control in a Concurrent Object Calculus -- Semantics -- Concurrent Rewriting for Graphs with Equivalences -- Event Structure Semantics for Nominal Calculi -- Encoding ?Duce in the ??-Calculus -- Probability -- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification -- Probabilistic I/O Automata: Theories of Two Equivalences -- Reachability in Recursive Markov Decision Processes -- Strategy Improvement for Stochastic Rabin and Streett Games -- Bisimulation and Simulation -- Weak Bisimulation Up to Elaboration -- Generic Forward and Backward Simulations -- On Finite Alphabets and Infinite Bases III: Simulation -- Real Time -- Inference of Event-Recording Automata Using Timed Decision Trees -- Controller Synthesis for MTL Specifications -- On Interleaving in Timed Automata -- Formal Languages -- A Language for Task Orchestration and Its Semantic Properties -- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words -- Second-Order Simple Grammars. |
Record Nr. | UNINA-9910483851903321 |
Berlin, : Springer, 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
CONCUR 2006 - Concurrency Theory [[electronic resource] ] : 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 / / edited by Christel Baier, Holger Hermanns |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XIII, 525 p.) |
Disciplina | 004/.35 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer systems
Computer science Compilers (Computer programs) Computer programming Computer networks Computer System Implementation Computer Science Logic and Foundations of Programming Theory of Computation Compilers and Interpreters Programming Techniques Computer Communication Networks |
ISBN | 3-540-37377-2 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Contributions -- Modeling Timed Concurrent Systems -- Some Remarks on Definability of Process Graphs -- Sanity Checks in Formal Verification -- Invited Tutorials -- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi -- Probability and Nondeterminism in Operational Models of Concurrency -- Model Checking -- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems -- Proving Liveness by Backwards Reachability -- Model Checking Quantified Computation Tree Logic -- Process Calculi -- Liveness, Fairness and Impossible Futures -- Checking a Mutex Algorithm in a Process Algebra with Fairness -- A Complete Axiomatic Semantics for the CSP Stable-Failures Model -- Transition Systems of Elementary Net Systems with Localities -- Minimization and Equivalence Checking -- Operational Determinism and Fast Algorithms -- Minimization, Learning, and Conformance Testing of Boolean Programs -- A Capability Calculus for Concurrency and Determinism -- Types -- A New Type System for Deadlock-Free Processes -- Sortings for Reactive Systems -- Dynamic Access Control in a Concurrent Object Calculus -- Semantics -- Concurrent Rewriting for Graphs with Equivalences -- Event Structure Semantics for Nominal Calculi -- Encoding ?Duce in the ??-Calculus -- Probability -- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification -- Probabilistic I/O Automata: Theories of Two Equivalences -- Reachability in Recursive Markov Decision Processes -- Strategy Improvement for Stochastic Rabin and Streett Games -- Bisimulation and Simulation -- Weak Bisimulation Up to Elaboration -- Generic Forward and Backward Simulations -- On Finite Alphabets and Infinite Bases III: Simulation -- Real Time -- Inference of Event-Recording Automata Using Timed Decision Trees -- Controller Synthesis for MTL Specifications -- On Interleaving in Timed Automata -- Formal Languages -- A Language for Task Orchestration and Its Semantic Properties -- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words -- Second-Order Simple Grammars. |
Record Nr. | UNISA-996465601303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Formal Techniques for Distributed Objects, Components, and Systems [[electronic resource] ] : 38th IFIP WG 6.1 International Conference, FORTE 2018, Held as Part of the 13th International Federated Conference on Distributed Computing Techniques, DisCoTec 2018, Madrid, Spain, June 18-21, 2018, Proceedings / / edited by Christel Baier, Luís Caires |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XI, 197 p. 41 illus.) |
Disciplina | 004.36 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Operating systems (Computers) Programming languages (Electronic computers) Computer security Computer communication systems Architecture, Computer Software Engineering Operating Systems Programming Languages, Compilers, Interpreters Systems and Data Security Computer Communication Networks Computer System Implementation |
ISBN | 3-319-92612-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Component- and Model-Based Design.-Object Technology -- Service-Oriented Computing Systems -- Mobile Computing Systems -- Security -- Privacy -- Adaptive Distributed Systems -- Self-Stabilization -- Self-Healing -- Verification -- Formal Analysis. |
Record Nr. | UNISA-996465823103316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Formal Techniques for Distributed Objects, Components, and Systems : 38th IFIP WG 6.1 International Conference, FORTE 2018, Held as Part of the 13th International Federated Conference on Distributed Computing Techniques, DisCoTec 2018, Madrid, Spain, June 18-21, 2018, Proceedings / / edited by Christel Baier, Luís Caires |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XI, 197 p. 41 illus.) |
Disciplina | 004.36 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Operating systems (Computers) Programming languages (Electronic computers) Computer security Computer communication systems Architecture, Computer Software Engineering Operating Systems Programming Languages, Compilers, Interpreters Systems and Data Security Computer Communication Networks Computer System Implementation |
ISBN | 3-319-92612-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Component- and Model-Based Design.-Object Technology -- Service-Oriented Computing Systems -- Mobile Computing Systems -- Security -- Privacy -- Adaptive Distributed Systems -- Self-Stabilization -- Self-Healing -- Verification -- Formal Analysis. |
Record Nr. | UNINA-9910349428003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Foundations of Software Science and Computation Structures [[electronic resource] ] : 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings / / edited by Christel Baier, Ugo Dal Lago |
Autore | Baier Christel |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XV, 583 p. 75 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Artificial intelligence Electronic digital computers—Evaluation Computers Professions Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence System Performance and Evaluation The Computing Profession Discrete Mathematics in Computer Science |
ISBN | 3-319-89366-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Semantics -- Non-angelic Concurrent Game Semantics -- A Trace Semantics for System F Parametric Polymorphism -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- A Syntactic View of Computational Adequacy -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- Depending on Session-Typed Processes -- FabULous Interoperability for ML and a Linear Language -- Concurrency -- Automata for True Concurrency Properties -- A Theory of Encodings and Expressiveness -- A Framework for Parameterized Monitorability -- Logics for Bisimulation and Divergence -- Lambda-Calculi and Types -- Call-by-need, Neededness and All That -- Fitch-Style Modal Lambda Calculi -- Realizability Interpretation and Normalization of Typed Call-by-Need -- Quotient Inductive-Inductive Types -- Category Theory and Quantum Control -- Guarded Traced Categories -- Proper Semirings and Proper Convex Functors -- From Symmetric Pattern-Matching to Quantum Control -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- A Hierarchy of Scheduler Classes for Stochastic Automata -- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings -- Comparator Automata in Quantitative Verification -- Logics and Equational Theories -- Modular Tableaux Calculi for Separation Theories -- Differential Calculus with Imprecise Input and its Logical Framework -- The Effects of Adding Reachability Predicates in Propositional Separation Logic -- The Equational Theory of the Natural Join and of Inner Union is Decidable -- Graphs and Automata -- Minimization of Graph Weighted Models over Circular Strings -- Games on Graphs with a Public Signal Monitoring -- WQO Dichotomy for 3-Graphs -- Verifying Higher-Order Functions with Tree Automata. |
Record Nr. | UNISA-996465597703316 |
Baier Christel | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Foundations of Software Science and Computation Structures : 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings / / edited by Christel Baier, Ugo Dal Lago |
Autore | Baier Christel |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (XV, 583 p. 75 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Artificial intelligence Electronic digital computers—Evaluation Computers Professions Computer science—Mathematics Discrete mathematics Computer Science Logic and Foundations of Programming Software Engineering Artificial Intelligence System Performance and Evaluation The Computing Profession Discrete Mathematics in Computer Science |
ISBN | 3-319-89366-1 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Semantics -- Non-angelic Concurrent Game Semantics -- A Trace Semantics for System F Parametric Polymorphism -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- A Syntactic View of Computational Adequacy -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- Depending on Session-Typed Processes -- FabULous Interoperability for ML and a Linear Language -- Concurrency -- Automata for True Concurrency Properties -- A Theory of Encodings and Expressiveness -- A Framework for Parameterized Monitorability -- Logics for Bisimulation and Divergence -- Lambda-Calculi and Types -- Call-by-need, Neededness and All That -- Fitch-Style Modal Lambda Calculi -- Realizability Interpretation and Normalization of Typed Call-by-Need -- Quotient Inductive-Inductive Types -- Category Theory and Quantum Control -- Guarded Traced Categories -- Proper Semirings and Proper Convex Functors -- From Symmetric Pattern-Matching to Quantum Control -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- A Hierarchy of Scheduler Classes for Stochastic Automata -- Symbolically Quantifying Response Time in Stochastic Models using Moments and Semirings -- Comparator Automata in Quantitative Verification -- Logics and Equational Theories -- Modular Tableaux Calculi for Separation Theories -- Differential Calculus with Imprecise Input and its Logical Framework -- The Effects of Adding Reachability Predicates in Propositional Separation Logic -- The Equational Theory of the Natural Join and of Inner Union is Decidable -- Graphs and Automata -- Minimization of Graph Weighted Models over Circular Strings -- Games on Graphs with a Public Signal Monitoring -- WQO Dichotomy for 3-Graphs -- Verifying Higher-Order Functions with Tree Automata. |
Record Nr. | UNINA-9910293144603321 |
Baier Christel | ||
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
International Workshop on Synthesis and Analysis of Component Connectors |
Pubbl/distr/stampa | [Place of publication not identified], : ACM, 2007 |
Descrizione fisica | 1 online resource (39 pages) |
Collana | ACM Conferences |
Soggetto topico |
Engineering & Applied Sciences
Computer Science |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Altri titoli varianti | SYANCO |
Record Nr. | UNINA-9910376413703321 |
[Place of publication not identified], : ACM, 2007 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science / / edited by Christel Baier |
Pubbl/distr/stampa | New York, New York : , : Association for Computing Machinery, , 2022 |
Descrizione fisica | 1 online resource |
Disciplina | 004.015113 |
Collana | ACM Conferences |
Soggetto topico | Computer logic |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNINA-9910588792903321 |
New York, New York : , : Association for Computing Machinery, , 2022 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
SOFSEM 2017: Theory and Practice of Computer Science [[electronic resource] ] : 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings / / edited by Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XVIII, 526 p. 109 illus.) |
Disciplina | 004.015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Information storage and retrieval systems Application software Software engineering Computer networks Artificial intelligence Information Storage and Retrieval Computer and Information Systems Applications Software Engineering Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-51963-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Dependable and Optimal Cyber-Physical Systems -- Verifying Parametric Thread Creation -- Network Constructors: A Model for Programmable Matter -- Logical characterisations and compositionality of input-output conformance simulation -- A Linear-Time Branching-Time Spectrum of Behavioral Specification Theories -- Symbolic semantics for multiparty interactions in the link-calculus -- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs -- Deciding structural liveness of Petri nets -- Distributed Network Generation based on Preferential Attachment in ABS -- Completeness of Hoare Logic Relative to the Standard Model -- Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict -- Hardness of deriving invertible sequences from finite state machines -- A Graph-theoretical Characterisation of State Separation -- Selfish Transportation Games -- Decomposable Relaxation for Concurrent Data Structures -- Sufficient Conditions for a Connected Graph to have a Hamiltonian Path -- Enumerating Minimal Tropical Connected Sets -- Bamboo Garden Trimming Problem (Perpetual maintenance of machines with different attendance urgency factors) -- Exact quantum query complexity of EXACT_{k,l}^n -- Adjacent vertices can be hard to find by quantum walks -- Matrix semigroup freeness problems in SL(2,Z) -- Order-preserving 1-string representations of planar graphs -- How to Draw a Planarization -- Finding Largest Common Substructures of Molecules in Quadratic Time -- Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints -- Parameterized and Exact Algorithms for Class Domination Coloring -- The Approximability of Partial Vertex Covers in Trees -- Longest Common Subsequence in at Least k Length Order-isomorphic Substrings -- Computing longest single-arm-gapped palindromes in a string -- Edit-Distance between Visibly Pushdown Languages -- Trends and Challenges in Predictive Analytics -- Model-driven Development in Practice: From Requirements to Code -- Webpage Menu Detection Based on DOM -- A Hybrid Model for Linking Multiple Social Identities across Heterogeneous Online Social Networks -- Eco Data Warehouse Design Through Logical Variability -- On Featured Transition Systems -- Domain-Specific Languages: A Systematic Mapping Study -- Characterising Malicious Software with High-Level Behavioural Patterns -- AErlang at work -- Software Systems Migration towards Cloud-native Architectures for SME-sized Software Vendors -- Using n-grams for the Automated Clustering of Structural Models. |
Record Nr. | UNISA-996465736303316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
SOFSEM 2017: Theory and Practice of Computer Science : 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings / / edited by Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (XVIII, 526 p. 109 illus.) |
Disciplina | 004.015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Information storage and retrieval systems Application software Software engineering Computer networks Artificial intelligence Information Storage and Retrieval Computer and Information Systems Applications Software Engineering Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-51963-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Dependable and Optimal Cyber-Physical Systems -- Verifying Parametric Thread Creation -- Network Constructors: A Model for Programmable Matter -- Logical characterisations and compositionality of input-output conformance simulation -- A Linear-Time Branching-Time Spectrum of Behavioral Specification Theories -- Symbolic semantics for multiparty interactions in the link-calculus -- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs -- Deciding structural liveness of Petri nets -- Distributed Network Generation based on Preferential Attachment in ABS -- Completeness of Hoare Logic Relative to the Standard Model -- Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict -- Hardness of deriving invertible sequences from finite state machines -- A Graph-theoretical Characterisation of State Separation -- Selfish Transportation Games -- Decomposable Relaxation for Concurrent Data Structures -- Sufficient Conditions for a Connected Graph to have a Hamiltonian Path -- Enumerating Minimal Tropical Connected Sets -- Bamboo Garden Trimming Problem (Perpetual maintenance of machines with different attendance urgency factors) -- Exact quantum query complexity of EXACT_{k,l}^n -- Adjacent vertices can be hard to find by quantum walks -- Matrix semigroup freeness problems in SL(2,Z) -- Order-preserving 1-string representations of planar graphs -- How to Draw a Planarization -- Finding Largest Common Substructures of Molecules in Quadratic Time -- Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints -- Parameterized and Exact Algorithms for Class Domination Coloring -- The Approximability of Partial Vertex Covers in Trees -- Longest Common Subsequence in at Least k Length Order-isomorphic Substrings -- Computing longest single-arm-gapped palindromes in a string -- Edit-Distance between Visibly Pushdown Languages -- Trends and Challenges in Predictive Analytics -- Model-driven Development in Practice: From Requirements to Code -- Webpage Menu Detection Based on DOM -- A Hybrid Model for Linking Multiple Social Identities across Heterogeneous Online Social Networks -- Eco Data Warehouse Design Through Logical Variability -- On Featured Transition Systems -- Domain-Specific Languages: A Systematic Mapping Study -- Characterising Malicious Software with High-Level Behavioural Patterns -- AErlang at work -- Software Systems Migration towards Cloud-native Architectures for SME-sized Software Vendors -- Using n-grams for the Automated Clustering of Structural Models. |
Record Nr. | UNINA-9910484047003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|