The proceedings contain 76 papers. The topics discussed include: abstract interpretation: past, present and future;computer-checked mathematics: a formal proof of the odd order theorem;citations for the test-of-time a...
ISBN:
(纸本)9781450328869
The proceedings contain 76 papers. The topics discussed include: abstract interpretation: past, present and future;computer-checked mathematics: a formal proof of the odd order theorem;citations for the test-of-time award from 1994;infinite-state energy games;beta reduction is invariant, indeed;regular combinators for string transformations*;weight monitoring with linear temporal logic: complexity and decidability*;graph logics with rational relations: the role of word combinatorics;effective interpolation and preservation in guarded logics*;on the discriminating power of passivation and higher-order interaction;a domain-theoretic approach to Brownian motion and general continuous stochastic processes;and two-way cost automata and cost logics over infinite trees*.
The proceedings contain 95 papers. The topics discussed include: towards a more efficient approach for the satisfiability of two-variable logic;demonic lattices and semilattices in relational semigroups with ordinary ...
ISBN:
(纸本)9781665448956
The proceedings contain 95 papers. The topics discussed include: towards a more efficient approach for the satisfiability of two-variable logic;demonic lattices and semilattices in relational semigroups with ordinary composition;on logics and homomorphism closure;universal Skolem sets;evidenced frames: a unifying framework broadening realizability models;behavioral preorders via graded monads;the undecidability of system F typability and type checking for reductionists;complexity lower bounds from algorithm design;on the logical structure of choice and bar induction principles;compositional relational reasoning via operational game semantics;continuous one-counter automata;and in search of lost time: axiomatizing parallel composition in process algebras.
The proceedings contain 64 papers. The topics discussed include: transducers of polynomial growth;normalization for multimodal type theory;computing the density of the positivity set for linear recurrence sequences;qu...
ISBN:
(纸本)9781450393515
The proceedings contain 64 papers. The topics discussed include: transducers of polynomial growth;normalization for multimodal type theory;computing the density of the positivity set for linear recurrence sequences;quantum weakest preconditions for reasoning about expected runtimes of quantum programs;on the Skolem problem and the Skolem conjecture;on the satisfiability of context-free string constraints with subword-ordering;identity testing for radical expressions;varieties of quantitative algebras and their monads;quantum expectation transformers for cost analysis;solvability of orbit-finite systems of linear equations;semantics for two-dimensional type theory;and the amazing mixed polynomial closure and its applications to two-variable first-order logic.
The proceedings contain 72 papers. The topics discussed include: complete game logic with sabotage;an expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications;non-elem...
ISBN:
(纸本)9798400706608
The proceedings contain 72 papers. The topics discussed include: complete game logic with sabotage;an expressively complete local past propositional dynamic logic over Mazurkiewicz traces and its applications;non-elementary compression of first-order proofs in deep inference using epsilon-terms;verifying unboundedness via amalgamation;genericity through stratification;deterministic sub-exponential algorithm for discounted-sum games with unary weights;decidability and complexity of decision problems for affine continuous VASS;injective hardness condition for PCSPs;on the decidability of monadic second-order logic with arithmetic predicates;element-free probability distributions and random partitions;the complexity of resilience problems via valued constraint satisfaction problems;and discounted-sum automata with real-valued discount factors.
The proceedings contain 67 papers. The topics discussed include: commutativity in automated verification;applications of information inequalities to database theory problems;a system of inference based on proof search...
ISBN:
(纸本)9798350335873
The proceedings contain 67 papers. The topics discussed include: commutativity in automated verification;applications of information inequalities to database theory problems;a system of inference based on proof search: an extended abstract;the descriptive complexity of graph neural networks;simulating logspace-recursion with logarithmic quantifier depth;embedded finite models beyond restricted quantifier collapse;distal combinatorial tools for graphs of bounded twin-width;a categorical account of composition methods in logic;the logic of prefixes and suffixes is elementary under homogeneity;revisiting membership problems in subclasses of rational relations;verifying linear temporal specifications of constant-rate multi-mode systems;and a higher-order indistinguishability logic for cryptographic reasoning.
The proceedings contain 73 papers. The topics discussed include: a tale of intersection types;automatic structures: twenty years later;logic beyond formulas: a proof system on graphs;a higher structure identity princi...
ISBN:
(纸本)9781450371049
The proceedings contain 73 papers. The topics discussed include: a tale of intersection types;automatic structures: twenty years later;logic beyond formulas: a proof system on graphs;a higher structure identity principle;the integers as a higher inductive type;space-efficient query evaluation over probabilistic event streams;algebraic models of simple type theories: a polynomial approach;approximating values of generalized-reachability stochastic games;reconciling noninterference and gradual typing;deciding differential privacy for programs with finite inputs and outputs;universal equivalence and majority of probabilistic programs over finite fields;and modal logics with composition on finite forests: expressivity and complexity.
The proceedings contain 62 papers. The topics discussed include: separation and covering for group based concatenation hierarchies;why propositional quantification makes modal logics on trees robustly hard?;higher-kin...
ISBN:
(纸本)9781728136080
The proceedings contain 62 papers. The topics discussed include: separation and covering for group based concatenation hierarchies;why propositional quantification makes modal logics on trees robustly hard?;higher-kinded data types: syntax and semantics;model comparison games for horn description logics;the logic of action lattices is undecidable;point-width and max-CSPs;path spaces of higher inductive types in homotopy type theory;perspective games;the geometry of Bayesian programming;categorical semantics for time travel;backprop as functor: a compositional perspective on supervised learning;descriptive complexity for minimal time of cellular automata;a sequent calculus for opetopes;and approximate span liftings: compositional semantics for relaxations of differential privacy.
The proceedings contain 59 papers. The topics discussed include: from qualitative to quantitative proofs of security properties using first-order conditional logic;regular functions and cost register automata;reasonin...
The proceedings contain 59 papers. The topics discussed include: from qualitative to quantitative proofs of security properties using first-order conditional logic;regular functions and cost register automata;reasoning about data repetitions with counter systems;on the context-freeness problem for vector addition systems;an optimal Gaifman normal form construction for structures of bounded degree;topological structure of quantum algorithms;on the query complexity of real functionals;magnitude monadic logic over words and the use of relative internal set theory;model checking for successor-invariant first-order logic on minor-closed graph classes;dynamic logic of propositional assignments: a well-behaved variant of PDL;the complexity of model checking multi-stack systems;maximum matching and linear programming in fixed-point logic with counting;and adding an equivalence relation to the interval logic ABB: complexity and expressiveness.
The proceedings contain 63 papers. The topics discussed include: on building constructive formal theories of computation noting the roles of Turing, Church, and Brouwer;term rewriting and lambda calculus;dense-timed p...
ISBN:
(纸本)9780769547695
The proceedings contain 63 papers. The topics discussed include: on building constructive formal theories of computation noting the roles of Turing, Church, and Brouwer;term rewriting and lambda calculus;dense-timed pushdown automata;approximate verification of the symbolic dynamics of Markov chains;regular transformations of infinite strings;modular construction of cut-free sequent calculi for paraconsistent logics;combining deduction modulo and logics of fixed-point definitions;graph logics with rational relations and the generalized intersection problem;collapsible pushdown automata and labeled recursion schemes: equivalence, safety and effective selection;decidable problems for probabilistic automata on infinite words;decomposing quantified conjunctive (or disjunctive) formulas;strong complementarity and non-locality in categorical quantum mechanics;and first-order and monadic second-order model-checking on ordered structures.
暂无评论