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

AvNaoki Kobayashi,James Worrell

Häftad, Engelska, 2024

Del 14575 i serien Lecture Notes in Computer Science

438 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2024-04-06
Mått:155 x 235 x 16 mm
Vikt:441 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:272
Upplaga:2024
Förlag:Springer International Publishing AG
ISBN:9783031572302

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Matematikens grunder inom Naturvetenskap och teknik
Programmeringsböcker inom Data och IT

Innehållsförteckning

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.