Skip to:Content
|
Bottom
Cover image for Foundations of Software Science and Computation Structures 26th 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
Title:
Foundations of Software Science and Computation Structures 26th 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
Author:
Kupferman, Orna. editor.
ISBN:
9783031308291
Edition:
1st ed. 2023.
Physical Description:
XIV, 562 p. 187 illus., 97 illus. in color. online resource.
Series:
Lecture Notes in Computer Science, 13992
Contents:
When 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. .
Added Corporate Author:
Holds:
Copies:

Available:*

Library
Material Type
Item Barcode
Shelf Number
Status
Item Holds
Searching...
E-Book 520842-1001 XX(520842.1)
Searching...

On Order

Go to:Top of Page