000 04285nam a22005655i 4500
001 978-3-642-37075-5
003 DE-He213
005 20200421112039.0
007 cr nn 008mamaa
008 130220s2013 gw | s |||| 0|eng d
020 _a9783642370755
_9978-3-642-37075-5
024 7 _a10.1007/978-3-642-37075-5
_2doi
050 4 _aQA8.9-QA10.3
072 7 _aUYA
_2bicssc
072 7 _aMAT018000
_2bisacsh
072 7 _aCOM051010
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aFoundations of Software Science and Computation Structures
_h[electronic resource] :
_b16th International Conference, FOSSACS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings /
_cedited by Frank Pfenning.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXXIV, 451 p. 51 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 ;
_v7794
505 0 _aPattern Graphs and Rule-Based Models: The Semantics of Kappa -- History-Register Automata -- Fatal Attractors in Parity Games -- On Unique Decomposition of Processes in the Applied (Ss(B-Calculus -- Bounded Context-Switching and Reentrant Locking -- Reachability of Communicating Timed Processes -- Modular Bisimulation Theory for Computations and Values -- Checking Bisimilarity for Attributed Graph Transformation -- Comodels and Effects in Mathematical Operational Semantics -- Preorders on Monads and Coalgebraic Simulations -- A Proof System for Compositional Verification of Probabilistic Concurrent Processes -- Partiality and Recursion in Higher-Order Logic -- Some Sahlqvist Completeness Results for Coalgebraic Logics -- Cut Elimination in Nested Sequents for Intuitionistic Modal Logics -- On Monadic Parametricity of Second-Order Functionals -- Deconstructing General References via Game Semantics -- Separation Logic for Non-local Control Flow and Block Scope Variables -- The Parametric Ordinal-Recursive Complexity of Post Embedding Problems -- Deciding Definability by Deterministic Regular Expressions -- Type-Based Complexity Analysis for Fork Processes -- Pure Pointer Programs and Tree Isomorphism -- A Language for Differentiable Functions -- Computing Quantiles in Markov Reward Models -- Parameterized Weighted Containment -- Weighted Specifications over Nested Words -- An Algebraic Presentation of Predicate Logic -- Strategies as Profunctors -- Generalised Name Abstraction for Nominal Sets.
520 _aThis book constitutes the proceedings of the 16th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2013, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2013, which took place in Rome, Italy, in March 2013 The 28 papers presented in this volume were carefully reviewed and selected from 109 submissions. They are organized in topical sections named: models of computation; reasoning about processes; bisimulation; modal and higher-order logics; reasoning about programs; computational complexity; quantitative models; and categorical models.
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 _aMathematical Logic and Formal Languages.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Languages, Compilers, Interpreters.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputation by Abstract Devices.
700 1 _aPfenning, Frank.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642370748
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7794
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-37075-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c56539
_d56539