Worrell / Kobayashi | Foundations of Software Science and Computation Structures | Buch | 978-3-031-57230-2 | sack.de

Buch, Englisch, Band 14575, 272 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 441 g

Reihe: Lecture Notes in Computer Science

Worrell / Kobayashi

Foundations of Software Science and Computation Structures

27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II
2024
ISBN: 978-3-031-57230-2
Verlag: Springer Nature Switzerland

27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II

Buch, Englisch, Band 14575, 272 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 441 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-031-57230-2
Verlag: Springer Nature Switzerland

The two open access volumes LNCS 14574 and 14575 constitute the proceedings of the 27th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2024, which took place in Luxembourg in April 2024.
The 24 full papers included in this book were carefully reviewed and selected from 79 submissions. They were organized in topical sections as follows: 
Part I: Infinite games; categorical semantics; automata and synthesis; Part II: Types and programming languages; logic and proofs; infinite-state systems.
Worrell / Kobayashi Foundations of Software Science and Computation Structures jetzt bestellen!

Zielgruppe

Research

Autoren/Hrsg.

Worrell, James
Kobayashi, Naoki

Fachgebiete

Weitere Infos & Material

Types and Programming Languages.- From Rewrite Rules to Axioms in the lambdaPi-Calculus Modulo Theory.- Light Genericity.- Logical Predicates in Higher-Order Mathematical Operational Semantics.- On Basic Feasible Functionals and the Interpretation Method.- Logic and Proofs.- Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems.- A Resolution-Based Interactive Proof System for UNSAT.- Craig Interpolation for Decidable First-Order Fragments.- Clones, closed categories, and combinatory logic.- Infinite-State Systems.- Reachability in Fixed VASS: Expressiveness and Lower Bounds.- From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.- Dimension-Minimality and Primality of Counter Nets.- Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability.

Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.