Foundations of Software Science and Computation Structures
portes grátis
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
Kobayashi, Naoki; Worrell, James
Springer International Publishing AG
04/2024
272
Mole
9783031572302
15 a 20 dias
Descrição não disponível.
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Open Access;program analysis;categorical models and logics;language theory, automata, and games;concurrency theory;modal, spatial, and temporal logics;logics of programming;software specification and refinement;emerging models of computation;models of software security;logical aspects of computational complexity
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.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Open Access;program analysis;categorical models and logics;language theory, automata, and games;concurrency theory;modal, spatial, and temporal logics;logics of programming;software specification and refinement;emerging models of computation;models of software security;logical aspects of computational complexity
