Pages that link to "Item:Q4635585"

The following pages link to Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Q4635585):

Displayed 50 items.

• Nonelementary Complexities for Branching VASS, MELL, and Extensions (Q2946760) ‎ (← links)
• Trade-off analysis meets probabilistic model checking (Q4635586) ‎ (← links)
• Abstract interpretation (Q4635587) ‎ (← links)
• Infinite-state energy games (Q4635588) ‎ (← links)
• Beta reduction is invariant, indeed (Q4635589) ‎ (← links)
• Regular combinators for string transformations (Q4635591) ‎ (← links)
• Asymptotic behaviour in temporal logic (Q4635593) ‎ (← links)
• Weight monitoring with linear temporal logic (Q4635594) ‎ (← links)
• Graph logics with rational relations (Q4635595) ‎ (← links)
• Effective interpolation and preservation in guarded logics (Q4635596) ‎ (← links)
• On the discriminating power of passivation and higher-order interaction (Q4635597) ‎ (← links)
• A domain-theoretic approach to Brownian motion and general continuous stochastic processes (Q4635598) ‎ (← links)
• Two-way cost automata and cost logics over infinite trees (Q4635599) ‎ (← links)
• Decomposition theorems and model-checking for the modal <i>μ</i> -calculus (Q4635600) ‎ (← links)
• Logic for communicating automata with parameterized topology (Q4635601) ‎ (← links)
• Logical characterization of weighted pebble walking automata (Q4635602) ‎ (← links)
• Coinduction up-to in a fibrational setting (Q4635603) ‎ (← links)
• Model checking existential logic on partially ordered sets (Q4635604) ‎ (← links)
• Zero-reachability in probabilistic multi-counter automata (Q4635605) ‎ (← links)
• The complexity of admissibility in Omega-regular games (Q4635606) ‎ (← links)
• On the characterization of models of <i>H</i> (Q4635607) ‎ (← links)
• A decision procedure for satisfiability in separation logic with inductive predicates (Q4635608) ‎ (← links)
• Secure equilibria in weighted games (Q4635610) ‎ (← links)
• Weak MSO (Q4635611) ‎ (← links)
• Symmetry in concurrent games (Q4635612) ‎ (← links)
• Decidability of weak logics with deterministic transitive closure (Q4635613) ‎ (← links)
• Equality and fixpoints in the calculus of structures (Q4635614) ‎ (← links)
• The tractability frontier of graph-like first-order query sets (Q4635615) ‎ (← links)
• One hierarchy spawns another (Q4635616) ‎ (← links)
• On the total variation distance of labelled Markov chains (Q4635617) ‎ (← links)
• System F with coercion constraints (Q4635618) ‎ (← links)
• The geometry of synchronization (Q4635620) ‎ (← links)
• On the pigeonhole and related principles in deep inference and monotone systems (Q4635621) ‎ (← links)
• Expressive completeness of separation logic with two variables and no separating conjunction (Q4635622) ‎ (← links)
• A new correctness criterion for MLL proof nets (Q4635623) ‎ (← links)
• On periodically iterated morphisms (Q4635624) ‎ (← links)
• Pattern logics and auxiliary relations (Q4635625) ‎ (← links)
• Substitution, jumps, and algebraic effects (Q4635626) ‎ (← links)
• Satisfiability modulo counting (Q4635627) ‎ (← links)
• Achieving new upper bounds for the hypergraph duality problem through logic (Q4635628) ‎ (← links)
• KAT + B! (Q4635629) ‎ (← links)
• Symmetric normalisation for intuitionistic logic (Q4635630) ‎ (← links)
• Equilibria of concurrent games on event structures (Q4635631) ‎ (← links)
• Subclasses of presburger arithmetic and the weak EXP hierarchy (Q4635632) ‎ (← links)
• Senescent ground tree rewrite systems (Q4635633) ‎ (← links)
• Preservation and decomposition theorems for bounded degree structures (Q4635634) ‎ (← links)
• No proof nets for MLL with units (Q4635635) ‎ (← links)
• Abstract interpretation from Büchi automata (Q4635636) ‎ (← links)
• Memoryful geometry of interaction (Q4635637) ‎ (← links)
• Axioms and decidability for type isomorphism in the presence of sums (Q4635638) ‎ (← links)