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
Published on 6. April 2024
Book
Paperback/Softback
XVI, 272 pages
978-3-031-57230-2 (ISBN)
Description
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.
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.
More details
Series
Edition
2024
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
11 farbige Abbildungen, 26 s/w Abbildungen
XVI, 272 p. 37 illus., 11 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 16 mm
Weight
441 gr
ISBN-13
978-3-031-57230-2 (9783031572302)
DOI
10.1007/978-3-031-57231-9
Schweitzer Classification
Content
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.