LEADER 05002nam  22006735  450 
001 9910484912403321
005 20251226203116.0
010   $a3-642-54830-X
024 7 $a10.1007/978-3-642-54830-7
035   $a(CKB)3710000000095068
035   $a(DE-He213)978-3-642-54830-7
035   $a(SSID)ssj0001187188
035   $a(PQKBManifestationID)11700655
035   $a(PQKBTitleCode)TC0001187188
035   $a(PQKBWorkID)11257223
035   $a(PQKB)11367153
035   $a(MiAaPQ)EBC3093572
035   $a(PPN)177824603
035   $a(EXLCZ)993710000000095068
100   $a20140321d2014      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aFoundations of Software Science and Computation Structures $e17th 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 /$fedited by Anca Muscholl
205   $a1st ed. 2014.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2014.
215   $a1 online resource (XVI, 457 p. 48 illus.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8412
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$a3-642-54829-6 
327   $aEquivalences 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.
330   $aThis 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8412
606   $aComputer science
606   $aMachine theory
606   $aCompilers (Computer programs)
606   $aSoftware engineering
606   $aComputer Science Logic and Foundations of Programming
606   $aFormal Languages and Automata Theory
606   $aCompilers and Interpreters
606   $aSoftware Engineering
606   $aTheory of Computation
615  0$aComputer science.
615  0$aMachine theory.
615  0$aCompilers (Computer programs).
615  0$aSoftware engineering.
615 14$aComputer Science Logic and Foundations of Programming.
615 24$aFormal Languages and Automata Theory.
615 24$aCompilers and Interpreters.
615 24$aSoftware Engineering.
615 24$aTheory of Computation.
676   $a005.1015113
702   $aMuscholl$b Anca$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910484912403321
996   $aFoundations of Software Science and Computation Structures$9772187
997   $aUNINA