LEADER 06174nam 22007455 450 001 9910483124903321 005 20230221063236.0 010 $a3-319-68953-3 024 7 $a10.1007/978-3-319-68953-1 035 $a(CKB)4100000000881971 035 $a(DE-He213)978-3-319-68953-1 035 $a(MiAaPQ)EBC6306611 035 $a(MiAaPQ)EBC5592695 035 $a(Au-PeEL)EBL5592695 035 $a(OCoLC)1007145843 035 $a(PPN)220121478 035 $a(EXLCZ)994100000000881971 100 $a20171013d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aTopics in Theoretical Computer Science $eSecond IFIP WG 1.8 International Conference, TTCS 2017, Tehran, Iran, September 12-14, 2017, Proceedings /$fedited by Mohammad Reza Mousavi, Ji?í Sgall 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XIX, 125 p. 25 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10608 311 $a3-319-68952-5 327 $aIntro -- Preface -- Organization -- Abstracts of Invited Talks -- The Coding Lens in Explicit Constructions -- Online Packet Scheduling -- Parallel Algorithms for Model Checking -- Design and Validation of Cloud Storage Systems Using Formal Methods -- Contents -- Invited Talk -- Design and Validation of Cloud Storage Systems Using Formal Methods -- 1 Introduction -- 2 Applications -- 3 Formal Methods at Amazon -- References -- Algorithms and Complexity -- A Characterization of Horoidal Digraphs -- 1 Introduction -- 1.1 Plane -- 1.2 Round Sphere -- 1.3 Horizontal Torus -- 2 Preliminaries -- 3 Characterization -- 4 Source-In-Sink-Out Graph of Adigraph -- 5 Conclusion and Some Open Problems -- References -- Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System -- 1 Introduction -- 2 Preliminaries -- 3 Obtaining Pendant Pairs from a Gomory Hu Tree -- 4 Gomoru Hu Tree of the Contraction of a System -- 5 Conclusion -- References -- Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance -- 1 Introduction -- 2 Preliminaries -- 3 The IMSPP Under the BWHD -- 4 Inverse Multi-objective Minimum Spanning Tree Problem Under the BWHD -- 5 Conclusion -- References -- Locality-Based Relaxation: An Efficient Method for GPU-Based Computation of Shortest Paths -- 1 Introduction -- 2 Preliminaries -- 2.1 Synchronization Mechanisms in CUDA -- 2.2 Directed Graphs and SSSP -- 2.3 Basic Functions -- 2.4 Harish et al.'s Algorithm -- 3 Locality-Based Relaxation -- 3.1 Basic Idea -- 3.2 Algorithm -- 3.3 Data Set -- 3.4 Experimental Results -- 3.5 Locality-Based Relaxation -- 4 Discussion -- 5 Conclusions and Future Work -- References -- Logic, Semantics, and Programming Theory -- Exposing Latent Mutual Exclusion by Work Automata -- 1 Introduction -- 2 Work Automata -- 2.1 Syntax -- 2.2 Semantics -- 2.3 Weak Simulation. 327 $a2.4 Composition -- 2.5 Hiding -- 3 State Space Minimization -- 3.1 Gluing -- 3.2 Translation -- 3.3 Contraction -- 4 Related Work -- 5 Conclusion -- References -- A Decidable Subtyping Logic for Intersection and Union Types -- 1 Introduction -- 1.1 Contributions -- 1.2 Related Work -- 2 System -- 3 Realizers -- 4 Subtyping Algorithm -- 4.1 The Algorithm Lg -- 5 Conclusions -- References -- Container Combinatorics: Monads and Lax Monoidal Functors -- 1 Introduction -- 2 Containers, Directed Containers -- 2.1 Containers -- 2.2 Directed Containers -- 3 Containers Monads -- 4 Containers Lax Monoidal Functors -- 5 Further Specializations -- 6 Conclusion -- References -- Unification of Hypergraph -Terms -- 1 Introduction -- 2 Hypergraph -Terms -- 2.1 HyperLMNtal -- 2.2 Hypergraph -Terms -- 3 Unification -- 4 Examples of the Unification -- 5 Implementation -- 6 Related Work and Conclusion -- A Appendix -- A.1 Adequacy of Equivalence -- A.2 Correctness of Unification -- References -- Erratum to: Topics in Theoretical Computer Science -- Erratum to: M.R. Mousavi and J. Sgall (Eds.): Topics in Theoretical Computer Science, LNCS 10608 -- Erratum to: Topics in Theoretical Computer Science -- Erratum to: M.R. Mousavi and J. Sgall (Eds.): Topics in Theoretical Computer Science, LNCS 10608 -- Author Index. 330 $aThis book constitutes the refereed proceedings of the Second IFIP WG 1.8 International Conference on Topics in Theoretical Computer Science, TTCS 2017, held in Tehran, Iran, in September 2017. The 8 papers presented in this volume were carefully reviewed and selected from 20 submissions. They were organized in topical sections named: algorithms and complexity; and logic, semantics, and programming theory. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10608 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aTheory of Computation 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aComputer Science Logic and Foundations of Programming 606 $aProgramming Techniques 606 $aCompilers and Interpreters 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aProgramming Techniques. 615 24$aCompilers and Interpreters. 676 $a004 702 $aMousavi$b Mohammad Reza$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSgall$b Ji?í$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483124903321 996 $aTopics in Theoretical Computer Science$91997593 997 $aUNINA