Foundations of Software Science and Computation Structures 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018. Proceedings
artificial intelligence; computer software; selection and evaluation; formal logic; graph theory; modal logic; petri nets; program compilers; programming language; semantics; separation logic; software engineering; theorem proving; type systems; verification
Saved in:
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Cham
Springer Nature
2018
Springer Open Springer International Publishing AG Springer |
| Edition: | 1 |
| Series: | Theoretical Computer Science and General Issues |
| Subjects: | |
| ISBN: | 3319893661, 9783319893662, 3319893653, 9783319893655 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | artificial intelligence; computer software; selection and evaluation; formal logic; graph theory; modal logic; petri nets; program compilers; programming language; semantics; separation logic; software engineering; theorem proving; type systems; verification |
|---|---|
| AbstractList | This text constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. This book constitutes the proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.The 31 papers presented in this volume were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections named: semantics; linearity; concurrency; lambda-calculi and types; category theory and quantum control; quantitative models; logics and equational theories; and graphs and automata. artificial intelligence; computer software; selection and evaluation; formal logic; graph theory; modal logic; petri nets; program compilers; programming language; semantics; separation logic; software engineering; theorem proving; type systems; verification |
| Author | Dal Lago, Ugo Baier, Christel |
| Author_xml | – sequence: 1 fullname: Baier, Christel – sequence: 2 fullname: Dal Lago, Ugo |
| BookMark | eNqFkM1v1DAQxYP4ELRUnBEcIi7AIeDv2JU4wKoFpIoeFnEdjWNnNzQbBzuh4r_H3RTYGyfr6f3ejN8cFfeGMPiieErJG0pI_dbUuuIVp6bShitVsTvFEc9yr-jdQ_GgeHK5-nJaUsIpNzkoHxYnKX0nhFCTNdePitPzMA8Opy4MqQxtuQ7tdI3Rl-um80PjSxxcuQq7cZ72ULme4txMc_TpcXG_xT75k9v3uPh2fvZ19am6uPz4efX-okIhiWAVV1YY10rPODLBvZC1UJJqqbxjAg21WlnGUHmtWqY889bS1krDmpZI5_hxActg29m-CzZgdBBGP-RPeIzNtu9sxPgLAnZwyDRhB8Y6UxMlQEmhQRDKALVRgERmobRrHckbXi8bMF3567QN_ZTgZ-9tCFcJ8uX-HpVl9uXCjjH8mH2aYI81fpgi9nD2YSVlbag0mXz1H5LTmgtBZEaf36I-9n4TYNnMONdM62y_W-yAuTaMsdv96fuv-40T4gYYAUkIUKZkDazWpM75Z4d5F3CZz6kSN-1fLG6DCftu6GAXhrCJOG4TSEEVMZz_BpFywD8 |
| ContentType | eBook |
| Copyright | https://creativecommons.org/licenses/by/4.0/legalcode |
| Copyright_xml | – notice: https://creativecommons.org/licenses/by/4.0/legalcode |
| DBID | I4C V1H A7I YSPEL BIANM |
| DEWEY | 005 |
| DOI | 10.1007/978-3-319-89366-2 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue DOAB: Directory of Open Access Books OAPEN Perlego Open Research Library (Open Access) |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: V1H name: DOAB: Directory of Open Access Books url: https://directory.doabooks.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 3319893661 9783319893662 |
| Edition | 1 1st Edition 2018 |
| Editor | Dal Lago, Ugo Baier, Christel |
| Editor_xml | – sequence: 1 fullname: Baier, Christel – sequence: 2 fullname: Dal Lago, Ugo |
| ExternalDocumentID | oai_biblioboard_com_9bd97064_6548_4012_a896_a0540168dfd0 9783319893662 EBC5579159 EBC31734405 2338288 oai_library_oapen_org_20_500_12657_27807 31640 5416093 |
| Genre | Electronic books |
| GroupedDBID | 0D6 0DA 38. A7I AABBV AAKKN AAQKC AAXZC AAYZJ ACOUV ADOGT AEDXK AEKFX AEZAY AFNRJ AKAAH ALMA_UNASSIGNED_HOLDINGS ANXHU AZZ BBABE BIANM BICGV BJAWL BUBNW CVGDX EDOXC FOYMO I4C IEZ LDH NQNQZ OEBZI PYIOH SAO SBO TPJZQ TSXQS V1H YSPEL Z7R Z7X Z83 Z88 AALJR ABEEZ ACBYE AGWHU AIQUZ ALNDD CZZ EIXGO |
| ID | FETCH-LOGICAL-a45042-36b49df5e23a243e4574651856ed24a91b86b22a6e86f26e2ebb1fb592cf05dd3 |
| IEDL.DBID | A7I |
| ISBN | 3319893661 9783319893662 3319893653 9783319893655 |
| IngestDate | Tue Dec 02 16:28:48 EST 2025 Fri Nov 08 04:09:52 EST 2024 Fri May 30 23:22:01 EDT 2025 Wed Jun 18 00:46:21 EDT 2025 Tue Dec 02 16:06:59 EST 2025 Mon Dec 01 21:27:29 EST 2025 Tue Oct 07 23:42:31 EDT 2025 Tue Nov 14 22:51:12 EST 2023 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a45042-36b49df5e23a243e4574651856ed24a91b86b22a6e86f26e2ebb1fb592cf05dd3 |
| Notes | MODID-eea0d14d732:Springer Open |
| OCLC | OCN: 1031399785 1031399785 1492949530 |
| OpenAccessLink | http://library.oapen.org/handle/20.500.12657/27807 |
| PQID | EBC31734405 |
| PageCount | 1109 |
| ParticipantIDs | biblioboard_openresearchlibrary_oai_biblioboard_com_9bd97064_6548_4012_a896_a0540168dfd0 askewsholts_vlebooks_9783319893662 proquest_ebookcentral_EBC5579159 proquest_ebookcentral_EBC31734405 perlego_books_2338288 oapen_primary_oai_library_oapen_org_20_500_12657_27807 oapen_doabooks_31640 casalini_monographs_5416093 |
| PublicationCentury | 2000 |
| PublicationDate | 2018 2018-04-14 2018-01-01T00:00:00Z |
| PublicationDateYYYYMMDD | 2018-01-01 2018-04-14 |
| PublicationDate_xml | – year: 2018 text: 2018 |
| PublicationDecade | 2010 |
| PublicationPlace | Cham |
| PublicationPlace_xml | – name: Netherlands – name: Cham |
| PublicationSeriesTitle | Theoretical Computer Science and General Issues |
| PublicationYear | 2018 |
| Publisher | Springer Nature Springer Open Springer International Publishing AG Springer |
| Publisher_xml | – name: Springer Nature – name: Springer Open – name: Springer International Publishing AG – name: Springer |
| SSID | ssj0001999738 |
| Score | 2.0528724 |
| Snippet | artificial intelligence; computer software; selection and evaluation; formal logic; graph theory; modal logic; petri nets; program compilers; programming... This book constitutes the proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2018, which... This text constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which... |
| SourceID | biblioboard askewsholts proquest perlego oapen casalini |
| SourceType | Open Access Repository Aggregation Database Publisher |
| SubjectTerms | Artificial Intelligence Computer programming, programs, data Computer science computer software Computers Computing and Information Technology formal logic graph theory modal logic petri nets program compilers programming language selection and evaluation semantics separation logic software engineering theorem proving type systems verification |
| Subtitle | 21st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018. Proceedings |
| TableOfContents | Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- Semantics -- Non-angelic Concurrent Game Semantics -- 1 Introduction -- 2 Three Interpretations of Affine Nondeterministic PCF -- 2.1 Syntax of APCF+ -- 2.2 Game Semantics and Event Structures -- 2.3 Interpretations of APCF+ with Event Structures -- 3 Uncovered Strategies up to Weak Bisimulation -- 3.1 Preliminaries on Event Structures -- 3.2 Definition of Uncovered Pre-strategies -- 3.3 A Compact-Closed Category of Uncovered Strategies -- 3.4 Interpretation of Affine Nondeterministic PCF -- 4 Essential Events -- 4.1 Definition of Essential Events -- 4.2 Essential Strategies -- 4.3 Interpretation of APCF+ -- 5 Conclusion -- References -- A Trace Semantics for System F Parametric Polymorphism -- 1 Introduction -- 2 Definition of System F and Parametricity -- 3 A Nominal Trace Semantics for System F -- 3.1 Trace Semantics Preview -- 3.2 Definition of the LTS -- 4 Parametricity in the Trace Model, and Proof of Theorem 5 -- 4.1 From Strachey to Trace Equivalence -- 4.2 Composite LTS -- 4.3 Proof of Theorem 5 -- 5 Related and Future Work -- References -- Categorical Combinatorics for Non Deterministic Strategies on Simple Games -- 1 Introduction -- 2 Non-deterministic P-strategies as P-cartesian Transductions -- 3 P-cartesian Transductions as Deterministic Strategies -- 4 The Pseudofunctor P -- 5 The Slender-Functional Factorisation Theorem -- 6 The Bicategory S of Simple Games and Non-deterministic Strategies -- 7 The Exponentional Modality on the Category G -- 8 The Exponential Modality on the Bicategory S -- 9 Conclusion -- A The Category G of Simple Games and Deterministic Strategies -- B The Tensor Product in the Category G -- C The Exponential Modality on the Category G -- D Some Bicategorical Definitions -- E Proof of Proposition2 -- F Proof that P is a pseudofunctor G Proof of Proposition6 -- H Proof of Theorem3 -- I Proof of Proposition9 -- J Proof of Theorem4 -- K Proof that ! Is a Pseudocomonad -- References -- A Syntactic View of Computational Adequacy -- 1 Introduction -- 2 PCF -- 2.1 A Rationally Continuous Theory of PCF -- 2.2 Adequacy -- 3 PCF with Sums -- 3.1 Adequacy -- 4 Call-by-Push-Value -- 4.1 Theory -- 4.2 Adequacy -- 5 Polymorphic Call-by-Push-Value -- 5.1 Adequacy -- 6 Concluding Remarks -- References -- Linearity -- A New Linear Logic for Deadlock-Free Session-Typed Processes -- 1 Introduction -- 2 PCP: Classical Processes with Mix and Cycle -- 3 Operational Semantics of PCP -- 4 Results for PLL and PCP -- 4.1 Cycle-Elimination for PLL -- 4.2 Deadlock-Freedom for PCP -- 5 Related Work and Conclusion -- References -- A Double Category Theoretic Analysis of Graded Linear Exponential Comonads -- 1 Introduction -- 2 Related Work -- 3 Graded Linear Exponential Comonad -- 3.1 Graded Linear Exponential Comonad -- 4 A Double-Category Theoretic Reformulation of Graded Linear Exponential Comonad -- 5 Multicategory of Symmetric Lax Monoidal Multifunctors -- 6 Graded Linear Exponential Comonads as Vertical Monoid Homomorphisms -- 7 From Monoid Actions to Graded Comonoid-Coalgebras -- 8 Conclusion -- References -- Depending on Session-Typed Processes -- 1 Introduction -- 2 A Dependent Type Theory of Processes -- 2.1 Syntax -- 2.2 A Dependent Typing System -- 2.3 Example - Reasoning About Processes Using Dependent Types -- 2.4 Type Soundness of the Framework -- 3 Embedding the Functional Layer in the Process Layer -- 3.1 The Embedding -- 3.2 Properties of the Embedding -- 4 Related and Future Work -- References -- FabblueUredLous Interoperability for ML and a Linear Language -- 1 Introduction -- 2 The blueU and redL Languages -- 2.1 The Core of redL -- 2.2 Linear Memory in redL 2.3 Internal redL Syntax and Typing -- 2.4 Reduction of Internal Terms -- 3 Multi-language Semantics -- 3.1 Lump Type and Language Boundaries -- 3.2 Interoperability: Static Semantics -- 3.3 Interoperability: Dynamic Semantics -- 3.4 Full Abstraction from blueU into blueUredL -- 4 Conclusion and Related Work -- References -- Concurrency -- Automata for True Concurrency Properties -- 1 Introduction -- 2 Event Structures and True Concurrent Logic -- 2.1 Prime Event Structures and Regularity -- 2.2 True Concurrent Logic -- 3 Automata-Based Model Checker -- 3.1 Infinite Parity Tree Automata -- 3.2 Infinite NPAs for Model Checking -- 3.3 Quotienting the Automaton -- 4 Model Checking Petri Nets -- 4.1 Petri Nets and Their Event Structure Semantics -- 4.2 Automata Model Checking for Petri Nets -- 4.3 A Prototype Tool -- 5 Conclusions -- References -- A Theory of Encodings and Expressiveness (Extended Abstract) -- 1 Introduction -- 2 Languages, Valid Translations, and Expressiveness -- 3 Correct = Valid + Congruence -- 4 A Hierarchy of Expressiveness Preorders -- 5 Closed-Term Languages -- 6 Translating a Synchronous into an Asynchronous -- 7 Congruence Closure -- 8 A Congruence Closure Property for Valid Translations -- 9 Integrating Language Features Through Translations -- 10 A Unique Decomposition of Terms -- 11 Invariance of Meaning Under -conversion -- 12 Compositionality -- 13 Related Work -- References -- A Framework for Parameterized Monitorability -- 1 Introduction -- 2 Background -- 3 Monitors that Detect Conditions -- 4 Instantiations -- 4.1 The Inability to Perform an Action -- 4.2 Depth-Bounded Static Analysis -- 5 Extending External Monitorability -- 5.1 External Monitoring with Conditions -- 5.2 Instantiating External Monitors with Conditions -- 6 Conclusions -- References -- Logics for Bisimulation and Divergence -- 1 Introduction Quotient Inductive-Inductive Types -- 1 Introduction -- 2 Sorts -- 3 Algebras -- 3.1 Relative Continuity and Constructor Specifications -- 3.2 Point Constructors -- 3.3 Reindexing Target Functors -- 3.4 Path Constructors -- 3.5 Categories of Algebras are Complete -- 4 Elimination Principles -- 4.1 The Section Induction Principle -- 4.2 Initiality, and its Relation to the Section Induction Principle -- 5 Conclusions and Further Work -- References -- Category Theory and Quantum Control -- Guarded Traced Categories -- 1 Introduction -- 2 Preliminaries -- 3 Guarded Categories -- 4 Guardedness via Guarded Ideals -- 5 Guarded Traces -- 6 Vacuous Guardedness and Nuclear Ideals -- 7 Conclusions and Further Work -- References -- Proper Semirings and Proper Convex Functors -- 1 Introduction -- 2 Proper Functors -- 3 Properness of Cubic Functors -- 4 A Subcubic Convex Functor -- 5 An Extension Theorem for F"0362F-coalgebras -- 6 Properness of F"0362F -- References -- From Symmetric Pattern-Matching to Quantum Control -- 1 Introduction -- 2 Pattern-Matching Isomorphisms -- 2.1 An Example -- 2.2 Terms and Types -- 2.3 Semantics -- 3 Second-Order Functions, Lists, and Recursion -- 3.1 Terms and Types -- 3.2 Semantics -- 4 Examples -- 5 From Reversible Isos to Quantum Control -- 5.1 Extending the Language to Linear Combinations of Terms -- 5.2 Modeling Types as Hilbert Spaces -- 5.3 Modeling Isos as Bounded Linear Maps -- 5.4 Modeling Isos as Unitary Maps -- 6 Conclusion -- References -- Quantitative Models -- The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes -- 1 Introduction -- 2 Preliminaries -- 2.1 Stochastic Models -- 2.2 Reachability Games Against Nature -- 3 The Never-Worse Relation -- 3.1 The Usefulness of the NWR -- 3.2 Known Efficiently-Computable Special Cases -- 4 Graph-Based Characterization of the NWR 2 Bisimulations and Divergence -- 3 Modal Characterization -- 4 Divergence in Finite State Systems -- 5 Conclusion -- References -- Lambda-Calculi and Types -- Call-by-Need, Neededness and All That -- 1 Introduction -- 2 Preliminaries -- 2.1 The Call-by-Name Lambda-Calculus -- 2.2 Head, Weak-Head and Leftmost Reductions -- 3 Towards Neededness -- 3.1 Residuals -- 3.2 Notions of Normal Form -- 3.3 Notions of Needed Reduction -- 4 The Type System V -- 5 Substitution and Reduction on Derivations -- 6 Weak-Head Neededness and Typed Occurrences -- 6.1 Weak-Head Needed Redexes Are Typed -- 6.2 Principally Typed Redexes Are Weak-Head Needed -- 7 Characterising Weak-Head Needed Normalisation -- 8 The Call-by-Need Lambda-Calculus -- 9 Observational Equivalence -- 10 Conclusion -- References -- Fitch-Style Modal Lambda Calculi -- 1 Introduction -- 2 Intuitionistic K -- 2.1 Type System -- 2.2 Computation -- 2.3 Categorical Semantics -- 3 Left Adjoints and Categorical Completeness -- 3.1 Type System and Computation -- 3.2 Categorical Semantics -- 4 Intuitionistic S4 for Idempotent Comonads -- 4.1 Type System and Computation -- 4.2 Categorical Semantics -- 4.3 Coherence -- 4.4 Left Adjoints and Categorical Completeness -- 5 Intuitionistic R -- 6 Related and Further Work -- References -- Realizability Interpretation and Normalization of Typed Call-by-Need -calculus with Control -- 1 Introduction -- 1.1 Realizability-Based Normalization -- 1.2 Contributions of the Paper -- 2 The [lv]-calculus -- 2.1 The Call-by-Need Evaluation Strategy -- 2.2 Explicit Environments -- 2.3 Syntax and Reduction Rules -- 2.4 A Type System for the [lv]-calculus -- 3 Normalization of the [lv]-calculus -- 3.1 Normalization by Realizability -- 3.2 Realizability Interpretation for the [lv]-calculus -- 3.3 Extension to 2nd-Order Type Systems -- 4 Conclusion and Further Work -- References 5 Intractability of the NWR |
| Title | Foundations of Software Science and Computation Structures |
| URI | http://digital.casalini.it/9783319893662 https://directory.doabooks.org/handle/20.500.12854/31640 http://library.oapen.org/handle/20.500.12657/27807 https://www.perlego.com/book/2338288/foundations-of-software-science-and-computation-structures-21st-international-conference-fossacs-2018-held-as-part-of-the-european-joint-conferences-on-theory-and-practice-of-software-etaps-2018-thessaloniki-greece-april-1420-2018-proceedings-pdf https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=31734405 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=5579159 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783319893662 https://openresearchlibrary.org/viewer/9bd97064-6548-4012-a896-a0540168dfd0 |
| Volume | 10803 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Bb9MwFLamjQO7DNgQ2QAZxLGZEttxHG6lajU4jEqdpt4sO7ZFtKqpmjKu_Af-IT8E8ewkayvEZZdKaZ6dl-TL8_dsv_cQ-sCpNcJZFwsD9I25nMVaUBrznLvE-HWxkoViE_n1tZjPi-kBIvtTF5e1Amc-LOS3yQbAR7_MEp8LgYMHT3LhA8iPuK9F7elQ_nk7rwKMJ6fCh3FQvx-IwgDUJtp5OCb96maXYNYHmBVxOBWTY3SsmjswMGB8Ng0c6UovqlrX8ML82KUa5UMWfX0kryPQ5pVdg4df_2PMwwg1OXnMvT1DR9bHOjxHB3b5Ap30FR5w98Gfoj_bqksNrh2egdH-oda2l8DQNW6bBSE8C-lov4MP_xGTtNngvRlHvI0vHODJ19lsOJph4AZigGH4M1g1eApQ9lcCXor7lQL8pa6Wm53GoMsSt1kFggbTLtRrV8UBHt8Mp333INzAIwUDdlcNsN9s5FUYrtbVAqfs989fJBkE0Us8fRjSmzN0OxnfjK7irmJErFjmA40o16wwLrOEKsKoZVnui72LjFtDmCpSLbgmRHEruCPcEqt16nRWkNIlmTH0JTpc1kv7CuGSZKIEPqNLkzFw6rQBdqpTkjjHEpuaCL3fAYq8X4TV7UbuIS1C8x38SF8RrUvi9K2Dg_T5vXdlwNDIQpsiB7IoOTiUElxgIpUouFSeYKdcGGeSCF30YJRgsdoE543MgGEnBY3QacCZNLVq9aLgGEMj3v69anOZhKtvNfFnAJiSJBIQKQMiZUBkhM46nMu2O0IpOOsiQu961MvwALo9xXL8aQTUlDJwCCKE_yuTZXkBjPr8sXpdoKceHO2k2Gt0CCi3b9CT8n5TNeu3wTTA72169RcfHF9U |
| linkProvider | Open Access Publishing in European Networks |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Foundations+of+Software+Science+and+Computation+Structures%3A+21st+International+Conference%2C+FOSSACS+2018%2C+Held+as+Part+of+the+European+Joint+Conferences+on+Theory+and+Practice+of+Software%2C+ETAPS+2018%2C+Thessaloniki%2C+Greece%2C+April+14%E2%80%9320%2C+2018.+Proceedings&rft.series=Theoretical+Computer+Science+and+General+Issues&rft.date=2018-01-01&rft.pub=Springer+Nature&rft.isbn=9783319893662&rft_id=info:doi/10.1007%2F978-3-319-89366-2&rft.externalDBID=A7I&rft.externalDocID=oai_library_oapen_org_20_500_12657_27807 |
| thumbnail_l | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fwww.perlego.com%2Fbooks%2FRM_Books%2Fopen_research_library_iudilif%2F9783319893662.jpg |
| thumbnail_m | http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97833198%2F9783319893662.jpg |