Foundations of Software Science and Computation Structures - Info and Reading Options
24th International Conference, FOSSACS 2021, Held As Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27-April 1, 2021, Proceedings
By Stefan Kiefer and Christine Tasson
"Foundations of Software Science and Computation Structures" was published by Springer International Publishing AG in 2021 - Cham, it has 1 pages and the language of the book is English.
“Foundations of Software Science and Computation Structures” Metadata:
- Title: ➤ Foundations of Software Science and Computation Structures
- Authors: Stefan KieferChristine Tasson
- Language: English
- Number of Pages: 1
- Publisher: ➤ Springer International Publishing AG
- Publish Date: 2021
- Publish Location: Cham
Edition Specifications:
- Weight: 0.896
- Pagination: xv, 574
Edition Identifiers:
- The Open Library ID: OL37323534M - OL27406711W
- ISBN-13: 9783030719944 - 9783030719951
- All ISBNs: 9783030719944 - 9783030719951
AI-generated Review of “Foundations of Software Science and Computation Structures”:
"Foundations of Software Science and Computation Structures" Description:
Open Data:
Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- Constructing a universe for the setoid model -- 1 Introduction -- 1.1 Related work -- 2 MLTT^Prop -- 2.1 Formalization -- 3 Setoid model -- 3.1 Setoid model as a CwF -- 3.2 Setoid Type Theory -- 4 Universe of setoids -- 4.1 Inductive-recursive universes -- 4.2 Inductive-recursive setoid universe -- 4.3 Inductive-inductive setoid universe -- 4.4 Inductive setoid universe -- 5 Conclusions and further work -- References -- Nominal Equational Problems -- 1 Introduction -- 2 Background -- 3 Nominal Equational Problems -- 4 A rule-based procedure -- 4.1 Simplification Rules -- 4.2 Soundness and Preservation of Solutions -- 4.3 Termination -- 5 Nominal Equational Solved Forms -- 6 Conclusion -- References -- Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy -- 1 Introduction -- 2 Preliminaries -- 3 The cut-off problem for acyclic Petri nets -- 3.1 Characterizing acyclic systems with cut-offs -- 3.2 Polynomial time algorithm -- 4 The Scaling and Insertion lemmas -- 4.1 The Scaling Lemma -- 4.2 The Insertion Lemma -- 5 Polynomial time algorithm for the general case -- 5.1 Characterizing systems with cut-offs -- 5.2 Polynomial time algorithm -- 6 Symmetric rendez-vous protocols -- 7 Symmetric protocols with leaders -- 7.1 A non-deterministic polynomial time algorithm -- References -- Fixpoint Theory - Upside Down -- 1 Introduction -- 2 Lattices and MV-Algebras -- 3 Non-expansive Functions and Their Approximations -- 4 Proof Rules -- 5 (De)Composing Functions and Approximations -- 6 Applications -- 6.1 Termination Probability -- 6.2 Behavioural Metrics for Probabilistic Automata -- 6.3 Bisimilarity -- 7 Simple Stochastic Games -- 8 Conclusion -- References -- Most of'' leads to undecidability: Failure of adding frequencies to LTL -- 1 Introduction -- 1.1 Related work
Read “Foundations of Software Science and Computation Structures”:
Read “Foundations of Software Science and Computation Structures” by choosing from the options below.
Search for “Foundations of Software Science and Computation Structures” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Foundations of Software Science and Computation Structures” in Libraries Near You:
Read or borrow “Foundations of Software Science and Computation Structures” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Foundations of Software Science and Computation Structures” at a library near you.
Buy “Foundations of Software Science and Computation Structures” online:
Shop for “Foundations of Software Science and Computation Structures” on popular online marketplaces.
- Ebay: New and used books.