000 04674nam a22006015i 4500
001 978-3-642-54830-7
003 DE-He213
005 20200420221257.0
007 cr nn 008mamaa
008 140321s2014 gw | s |||| 0|eng d
020 _a9783642548307
_9978-3-642-54830-7
024 7 _a10.1007/978-3-642-54830-7
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
245 1 0 _aFoundations of Software Science and Computation Structures
_h[electronic resource] :
_b17th 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 /
_cedited by Anca Muscholl.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2014.
300 _aXVI, 457 p. 48 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8412
505 0 _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 (Ss(B-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 (So(B-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.
520 _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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aProgramming languages (Electronic computers).
650 0 _aComputers.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputation by Abstract Devices.
700 1 _aMuscholl, Anca.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642548291
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8412
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-54830-7
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c52986
_d52986