Foundations of Software Science and Computation Structures 22nd International Conference, FOSSACS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Bojańczyk, Mikołaj, Simpson, Alex
Format: E-Book Buch
Sprache:Englisch
Veröffentlicht: Cham Springer Nature 2019
Springer
Springer International Publishing AG
Ausgabe:1
Schlagworte:
Computer software > Congresses
Mathematics. General principles
Software engineering > Congresses
ISBN:3030171272, 9783030171278, 9783030171261, 3030171264
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Inhaltsangabe:
  • Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games -- 1 Introduction -- 2 Games and automata -- 2.1 Games -- 2.2 Memory of strategies -- 2.3 Automata -- 2.4 Automata for solving games -- 3 Efficiently solving games -- 3.1 Good for small games automata -- 3.2 The case of memoryless winning conditions -- 3.3 Maximal graphs -- 4 The case of parity conditions -- 4.1 Parity and cycles -- 4.2 The shape and size of universal graphs for parity games -- References -- Resource-Tracking Concurrent Games -- 1 Introduction -- 2 From R-IPA to R-Strategies -- 2.1 Affine IPA -- 2.2 Interleaving Cost Semantics, and R-IPA -- 2.3 Non-interleaving Semantics -- 3 Concurrent Game Semantics of IPA -- 3.1 Arenas and R-Strategies -- 3.2 Interpretation of R-IPA -- 3.3 Soundness -- 4 Adequacy for Time -- 5 Conclusion -- References -- Change Actions: Models of Generalised Differentiation -- 1 Introduction -- 2 Change Actions -- 3 Change Actions on Arbitrary Categories -- 4 Higher-Order Derivatives: The Extrinsic View -- 5 Examples of Change Action Models -- 6 -Change Actions and -Differential Maps -- 7 Related Work, Future Directions and Conclusions -- References -- Coalgebra Learning via Duality -- 1 Introduction -- 2 Learning by Example -- 3 Preliminaries -- 4 Subformula Closed Collections of Formulas -- 5 Reachability and the Base -- 6 Learning Algorithm -- 6.1 Tables and Counterexamples -- 6.2 The Algorithm -- 6.3 Correctness and Termination -- 7 Future Work -- References -- Tight Worst-Case Bounds for Polynomial Loop Programs -- 1 Introduction -- 1.1 The Core Language -- 1.2 The Algorithm -- 2 Preliminaries -- 2.1 Some Notation and Terminology -- 2.2 Formal Semantics of the Core Language -- 2.3 Detailed Statement of the Main Result -- 3 Analysis Algorithm: First Concepts
  • 2.3 Partial Higher Dimensional Automata as Lax Functors -- 2.4 Completion of a pHDA -- 3 Paths in Partial Higher Dimensional Automata -- 3.1 Path Category, Open Maps, Coverings -- 3.2 Encoding Paths in pHDA -- 4 Trees and Unfolding in pHDA -- 4.1 Trees, as Colimits of Paths in pHDA -- 4.2 The Unique Path Properties of Trees -- 4.3 Trees Are Unfoldings -- 5 Cofibrant Objects -- 5.1 Cofibrant Objects in pHDAL -- 5.2 Cofibrant Objects Are Exactly Trees -- 5.3 The Unfolding Is Universal -- 6 Conclusion and Future Work -- References -- The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains -- 1 Introduction -- 2 Preliminaries -- 3 Test Formulæ for SLk -- 3.1 From Test Formulæ to FO -- 4 From Quantifier-Free SLk to Test formulæ -- 4.1 Minterms -- 4.2 Translating Quantifier-Free SLk into Minterms -- 5 Bernays-Schönfinkel-Ramsey SLk -- 5.1 Undecidability of BSR(SLk) -- 5.2 Two Decidable Fragments of BSR(SLk) -- 6 Conclusions and Future Work -- References -- Continuous Reachability for Unordered Data Petri Nets is in PTime -- 1 Introduction -- 2 Preliminaries -- 3 UDPN, Reachability and Its Variants: Our Main Results -- 4 Equivalent Formulation via Matrices -- 5 Bounding Number of Data Values Used in Q,Q+-run -- 5.1 Transformation of an X-run -- 6 Q-reachability is in PTime -- 7 Q+-reachability is in PTime -- 7.1 Characterizing Q+-reachability -- 7.2 Transforming UDPN to Loop-less UDPN -- 7.3 Encoding Q+-reachability as Linear Equations with Implications -- 8 Conclusion -- References -- Optimal Satisfiability Checking for Arithmetic -Calculi -- 1 Introduction -- 2 The Coalgebraic -Calculus -- 3 Tracking Automata -- 4 Global Caching for the Coalgebraic -Calculus -- 5 Soundness and Completeness -- 6 Conclusion -- References -- Constructing Inductive-Inductive Types in Cubical Type Theory -- 1 Introduction -- 1.1 Syntax and Conventions
  • 1.2 Running Example of an Inductive-Inductive Definition -- 2 Deriving UIP -- 2.1 Unique Goodness Implies UIP -- 2.2 Simple Elimination Rules Imply Unique Goodness -- 2.3 Simple Elimination Rules for Nordvall Forsberg's Construction only if UIP -- 3 Constructing an Inductive-Inductive Type in Cubical Type Theory -- 3.1 Pre-syntax -- 3.2 Goodness Algebras -- 3.3 Niceness -- 3.4 Successor Goodness Algebra -- 3.5 Limit of Goodness Algebras -- 4 Related Work -- 5 Conclusions and Future Work -- References -- Causal Inference by String Diagram Surgery -- 1 Introduction -- 2 Stochastic Matrices and Conditional Probabilities -- 3 Bayesian Networks as String Diagrams -- 4 Towards Causal Inference: The Smoking Scenario -- 5 Interventional Distributions as Diagram Surgery -- 6 The Comb Factorisation -- 7 Returning to the Smoking Scenario -- 8 The General Case for a Single Intervention -- 9 Conclusion and Future Work -- References -- Higher-Order Distributions for Differential Linear Logic -- 1 Introduction -- 2 Preliminaries -- 2.1 Differential Linear Logic and Its Semantics -- 2.2 Reflexive Spaces and Distributions -- 3 Higher-Order Distributions and Kernel -- 4 Structural Morphisms on the Exponential -- 4.1 Dereliction and Co-dereliction -- 4.2 (Co-)contraction and (Co-)weakening -- 4.3 Co-multiplication -- 5 A Model of DiLL0 -- 6 Conclusion -- References -- Languages Ordered by the Subword Order -- 1 Introduction -- 2 Preliminaries -- 3 The FO+MOD-Theory with Regular Predicates -- 4 The C+MOD2-Theory with Regular Predicates -- 4.1 Unambiguous Rational Relations -- 4.2 Closure Properties of the Class of Regular Languages -- 4.3 Quantifier Elimination for C+MOD2 -- 5 The 1-Theory -- 6 The 1-Theory with Constants -- References -- Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces -- 1 Introduction -- 2 The Probabilistic Language
  • 4 Reduction to Simple Disjunctive Loops -- 4.1 Symbolic Evaluation of Straight-Line Code -- 4.2 Evaluation of Non-deterministic Choice -- 4.3 Handling Loops -- 5 Simple Disjunctive Loop Analysis Algorithm -- 6 Correctness -- 7 Related Work -- 8 Conclusion and Further Work -- References -- A Complete Normal-Form Bisimilarity for State -- 1 Introduction -- 2 Global Store -- 2.1 Syntax, Semantics, and Contextual Equivalence -- 2.2 Normal-Form Bisimulation -- 2.3 Soundness -- 2.4 Completeness -- 3 Local Store -- 3.1 Syntax, Semantics, and Contextual Equivalence -- 3.2 Bisimilarity -- 3.3 Soundness and Completeness -- 3.4 Examples -- 4 Related Work and Conclusion -- References -- Identifiers in Registers -- 1 Introduction -- 2 Preliminaries -- 3 Distributed Register Automata -- 4 Functional Fixpoint Logic -- 5 Translating Between Automata and Logic -- 6 Conclusion -- References -- The Impatient May Use Limited Optimism to Minimize Regret -- 1 Introduction -- 2 Preliminaries -- 3 Admissible Strategies and Regret -- 3.1 Any Strategy Is Weakly Dominated by an Admissible Strategy -- 3.2 Being Dominated Is Regretful -- 3.3 Optipess Strategies Are both Regret-Minimal and Admissible -- 4 Minimal Values Are Witnessed by a Single Iterated Cycle -- 5 Short Witnesses for Regret, Antagonistic, and Collaborative Values -- 5.1 Regret Is Witnessed by Histories of Bounded Length -- 5.2 Short Witnesses for the Collaborative and Antagonistic Values -- 6 The Complexity of Regret -- 7 Conclusion -- References -- Causality in Linear Logic -- 1 Introduction -- 2 MALL- and Its Commuting Conversions -- 3 Concurrent Games Based on General Event Structures -- 3.1 Games as Prime Event Structures with Polarities -- 3.2 Causal Structures as Deterministic General Event Structures -- 4 Acyclicity of Causal Structures -- 4.1 Communication in Causal Structures
  • 4.2 Definition of Acyclicity on Casual Structures -- 5 Causal Nets and Sequentialisation -- 5.1 Causal Nets: Totality and Well-Linking Casual Structs -- 5.2 Strong Sequentialisation of Causal Nets -- 6 Causal Invariants and Completeness -- 6.1 Causal Invariants as Maximal Causal Nets -- 6.2 The Category of Causal Invariants -- 7 Extensions and Related Work -- References -- Rewriting Abstract Structures: Materialization Explained Categorically -- 1 Introduction -- 2 Preliminaries -- 2.1 Subobject Classifiers and Partial Map Classifiers of Graphs -- 2.2 Languages -- 3 Materialization -- 3.1 Materialization Category and Existence of Materialization -- 3.2 Characterizing the Language of Rewritable Objects -- 3.3 Rewriting Materializations -- 4 Annotated Objects -- 5 Abstract Rewriting of Annotated Objects -- 5.1 Abstract Rewriting and Soundness -- 5.2 Completeness -- 6 Conclusion -- References -- Two-Way Parikh Automata with a Visibly Pushdown Stack -- 1 Introduction -- 2 Two-Way Visibly Pushdown (Parikh) Automata -- 3 Emptiness Complexity -- 4 NExpTime-Hardness -- 5 Applications to Decision Problems for Nested Word Transducers -- References -- Kleene Algebra with Hypotheses -- 1 Introduction -- 2 The Systems KA and KA* -- 3 Closure of Regular Languages -- 3.1 Definition of the Closure -- 3.2 Properties of the Closure Operator -- 3.3 Relating Closure and Provability in KAH and KAH* -- 4 Decidability of KA and KA* with (1=x)-Hypotheses -- 5 Complexity Results for Letter Hypotheses -- 5.1 Closure and Co-reachable States of TMs and LBAs -- 5.2 Complexity Results -- 5.3 Undecidability of KAH for Sums of Letters -- References -- Trees in Partial Higher Dimensional Automata -- 1 Introduction -- 2 Fixing the Definition of pHDA -- 2.1 Higher Dimensional Automata -- 2.2 Original Definition of Partial Higher Dimensional Automata
  • 3 Probabilistic Coherence Spaces