000 04793nam a22005775i 4500
001 978-3-642-54830-7
003 DE-He213
005 20240730184933.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 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_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.
250 _a1st ed. 2014.
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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_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 π-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.
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.
_99832
650 0 _aMachine theory.
_9137285
650 0 _aCompilers (Computer programs).
_93350
650 0 _aSoftware engineering.
_94138
650 1 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9137286
650 2 4 _aCompilers and Interpreters.
_931853
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aTheory of Computation.
_9137287
700 1 _aMuscholl, Anca.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9137288
710 2 _aSpringerLink (Online service)
_9137289
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642548291
776 0 8 _iPrinted edition:
_z9783642548314
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8412
_9137290
856 4 0 _uhttps://doi.org/10.1007/978-3-642-54830-7
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c92563
_d92563