000 04213nam a22005175i 4500
001 978-3-031-30829-1
003 DE-He213
005 20240507155720.0
007 cr nn 008mamaa
008 230420s2023 sz | s |||| 0|eng d
020 _a9783031308291
_9978-3-031-30829-1
024 7 _a10.1007/978-3-031-30829-1
_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] :
_b26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22–27, 2023, Proceedings /
_cedited by Orna Kupferman, Pawel Sobocinski.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXIV, 562 p. 187 illus., 97 illus. in color.
_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,
_x1611-3349 ;
_v13992
505 0 _aWhen Programs Have to Watch Paint Dry -- Deciding contextual equivalence of nu-calculus with effectful contexts -- Kantorovich Functors and Characteristic Logics for Behavioural Distances -- A Logical Framework with Higher-Order Rational (Circular) Terms -- A Higher-Order Language for Markov Kernels and Linear Operators -- A Formal Logic for Formal Category Theory -- A Strict Constrained Superposition Calculus for Graphs -- A programming language characterizing quantum polynomial time -- On the Existential Arithmetics with Addition and Bitwise Minimum -- Coverability in 2-VASS with One Unary Counter is in NP -- On History-Deterministic One-Counter Nets -- Unboundedness problems for machines with reversal-bounded counters -- Reverse Bisimilarity vs. Forward Bisimilarity -- Explainability of Probabilistic Bisimilarity Distances for Labelled Markov Chains -- Weighted and Branching Bisimilarities from Generalized Open Maps -- Preservation and Reflection of Bisimilarity via Invertible Steps -- QuantitativeSafety and Liveness -- On the Comparison of Discounted-Sum Automata with Multiple Discount Factors -- Fast Matching of Regular Patterns with Synchronizing Counting -- Compositional Learning for Interleaving Parallel Automata -- Pebble minimization: the last theorems -- Noetherian topologies defined via fixed-points -- An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic -- Just Testing -- Model and Program Repair via Group Actions -- Subgame optimal strategies in finite concurrent games with prefix-independent objectives. .
506 0 _aOpen Access
520 _aThis open access book constitutes the proceedings of the 26th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2023, which was held during April 22-27, 2023, in Paris, France, as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023. The 26 regular papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with research on theories and methods to support the analysis, integration, synthesis, transformation, and verification of programs and software systems.
650 0 _aComputer science.
650 1 4 _aTheory of Computation.
700 1 _aKupferman, Orna.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSobocinski, Pawel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031308284
776 0 8 _iPrinted edition:
_z9783031308307
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v13992
856 4 0 _uhttps://doi.org/10.1007/978-3-031-30829-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-SOB
999 _c37527
_d37527