Cantitate/Preț
Produs

Foundations of Software Science and Computation Structures: 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8412

Editat de Anca Muscholl
en Limba Engleză Paperback – 18 mar 2014
This book constitutes the proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2014, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, which took place in Grenoble, France, in April 2014. The 28 papers included in this book, together with one invited talk, were selected from 106 full-paper submissions. The following topical areas are covered: probabilistic systems, semantics of programming languages, networks, program analysis, games and synthesis, compositional reasoning, bisimulation, categorical and algebraic models and logics of programming.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33443 lei

Preț vechi: 41804 lei
-20% Nou

Puncte Express: 502

Preț estimativ în valută:
6400 6648$ 5316£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642548291
ISBN-10: 3642548296
Pagini: 476
Ilustrații: XVI, 457 p. 48 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.66 kg
Ediția:2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Equivalences of Pushdown Systems Are Hard.- Active Diagnosis for Probabilistic Systems.- Analysis of Probabilistic Basic Parallel Processes.- Limit Synchronization in Markov Decision Processes.- Maximal Cost-Bounded Reachability Probability on Continuous-Time.- Markov Decision Processes.- Type Reconstruction for the Linear π-Calculus with Composite and Equi-Recursive Types.- A Semantical and Operational Account of Call-by-Value Solvability.- Network-Formation Games with Regular Objectives.- Playing with Probabilities in Reconfigurable Broadcast Networks.- Unsafe Order-2 Tree Languages Are Context-Sensitive.- Game Semantics for Nominal Exceptions.- Complexity of Model-Checking Call-by-Value Programs.- Resource Reachability Games on Pushdown Graphs.- Perfect-Information Stochastic Mean-Payoff Parity Games.- Latticed-LTL Synthesis in the Presence of Noisy Inputs.- The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.- On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations.- On Asymmetric Unification and the Combination Problem in Disjoint Theories.- Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules.- Generalized Synchronization Trees.- Bisimulations for Communicating Transactions.- Upper-Expectation Bisimilarity and Lukasiewicz μ-Calculus.- Interacting Bialgebras Are Frobenius.- Generalized Eilenberg Theorem I: Local Varieties of Languages.- Combining Bialgebraic Semantics and Equations.- Models of a Non-associative Composition.- Foundations for Decision Problems in Separation Logic with General Inductive Predicates.- A Coalgebraic Approach to Linear-Time Logics.- A Relatively Complete Calculus for Structured Heterogeneous Specifications.