| Description |
1 online resource (xv, 542 pages) : illustrations (some color) |
| Series |
Lecture notes in computer science ; 11425 |
|
Advanced research in computing and software science |
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
|
Lecture notes in computer science ; 11425
|
|
Lecture notes in computer science. Advanced research in computing and software science
|
|
LNCS sublibrary. SL 1, Theoretical computer science and general issues
|
| Contents |
1. Universal graphs and good for games automata : new tools for infinite duration games / Thomas Colcombet and Nathanaël Fijalkow -- 2. Resource-tracking concurrent games / Aurore Alcolei, Pierre Clairambault, and Olivier Laurent -- 3. Change actions : models of generalised differentiation / Mario Alvarez-Picallo and C.-H. Luke Ong -- 4. Coalgebra learning via duality / Simone Barlocco, Clemens Kupke, and Jurriaan Rot -- 5. Tight worst-case bounds for polynomial loop programs / Amir M. Ben-Amram and Geoff W. Hamilton -- 6. A complete normal-form bisimilarity for state / Dariusz Biernacki, Sergueï Lenglet, and Piotr Polesiuk -- 7. Identifiers in registers : describing network algorithms with logic / Benedikt Bollig, Patricia Bouyer, and Fabian Reiter -- 8. The impatient may use limited optimism to minimize regret / Michaël Cadilhac, Guillermo A. Pérez, and Marie van den Bogaard -- 9. Causality in linear logic : full completeness and interjectivity (unit-free multiplicative-additive fragment) / Simon Castellan and Nobuko Yoshida -- 10. Rewriting abstract structures : materialization explained categorically / Andrea Corradini, Tobias Heindel, Barbara König, Dennis Nolte, and Arend Rensink -- 11. Two-way Parikh automata with a visibly pushdown stack / Luc Dartois, Emmanuel Filiot, and Jean-Marc Talbot -- 12. Kleene algebra with hypotheses / Amina Doumane, Denis Kuperberg, Damien Pous, and Pierre Pradic -- 13. Trees in partial higher dimensional automata / Jérémy Dubut -- 14. The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains / Mnacho Echenim, Radu Iosif, and Nicolas Peltier -- 15. Continuous reachability for unordered data petri nets is in PTime / Utkarsh Gupta, Preey Shah, S. Akshay, and Piotr Hofman |
| Summary |
This open access book constitutes the proceedings of the 22nd International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2019, which took place in Prague, Czech Republic, in April 2019, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2019. The 29 papers presented in this volume were carefully reviewed and selected from 85 submissions. They deal with foundational research with a clear significance for software science. -- Provided by publisher |
| Notes |
International conference proceedings |
|
Includes author index |
|
Online resource; title from PDF title page (SpringerLink, viewed April 10, 2019) |
| Subject |
Computer software -- Congresses
|
|
Software engineering -- Congresses
|
|
Computer software
|
|
Software engineering
|
| Genre/Form |
proceedings (reports)
|
|
Conference papers and proceedings
|
|
Conference papers and proceedings.
|
|
Actes de congrès.
|
| Form |
Electronic book
|
| Author |
Bojańczyk, Mikołaj, editor
|
|
Simpson, Alex, editor
|
|
ETAPS (Conference) (22nd : 2019 : Prague, Czech Republic)
|
| ISBN |
9783030171278 |
|
3030171272 |
|
