Výsledky vyhledávání - "Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science"

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science

“…This volume contains the proceedings of the Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) held at Columbia University in New York…”
Získat plný text

The Probabilistic Model Checking Landscape Autor Katoen, Joost-Pieter

“…Randomization is a key element in sequential and distributed computing. Reasoning about randomized algorithms is highly non-trivial. In the 1980s, this…”
Získat plný text

Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints Autor Staton, Sam, Yang, Hongseok, Wood, Frank, Heunen, Chris, Kammar, Ohad

“…We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft…”
Získat plný text

Quantitative Algebraic Reasoning Autor Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“…We develop a quantitative analogue of equational reasoning which we call quantitative algebra. We define an equality relation indexed by rationals: a = ε b…”
Získat plný text

First-order definability of rational transductions: An algebraic approach Autor Filiot, Emmanuel, Gauwin, Olivier, Lhote, Nathan

“…The algebraic theory of rational languages has provided powerful decidability results. Among them, one of the most fundamental is the definability of a…”
Získat plný text

Proving Differential Privacy via Probabilistic Couplings Autor Barthe, Gilles, Gaboardi, Marco, Grégoire, Benjamin, Hsu, Justin, Strub, Pierre-Yves

“…Over the last decade, differential privacy has achieved widespread adoption within the privacy community. Moreover, it has attracted significant attention from…”
Získat plný text

Reasoning about Recursive Probabilistic Programs Autor Olmedo, Federico, Kaminski, Benjamin Lucien, Katoen, Joost-Pieter, Matheja, Christoph

“…This paper presents a wp--style calculus for obtaining expectations on the outcomes of (mutually) recursive probabilistic programs. We provide several proof…”
Získat plný text

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns Autor Cooper, Martin C., Živný, Stanislav

“…Characterising tractable fragments of the constraint satisfaction problem (CSP) is an important challenge in theoretical computer science and artificial…”
Získat plný text

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems Autor Barto, Libor, Pinsker, Michael

“…We prove that an ω-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its…”
Získat plný text

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings Autor Carayol, Arnaud, Löding, Christof, Serre, Olivier

“…This article is inspired by two works from the early 90s. The first one is by Bogaert and Tison who considered a model of automata on finite ranked trees where…”
Získat plný text

Rewriting modulo symmetric monoidal structure Autor Bonchi, Filippo, Gadducci, Fabio, Kissinger, Aleks, Sobociński, Paweł, Zanasi, Fabio

“…String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer…”
Získat plný text

Hybrid realizability for intuitionistic and classical choice Autor Blot, Valentin

“…In intuitionistic realizability like Kleene's or Kreisel's, the axiom of choice is trivially realized. It is even provable in Martin-Löf's intuitionistic type…”
Získat plný text

Definability equals recognizability for graphs of bounded treewidth Autor Bojańczyk, Mikołaj, Pilipczuk, Michał

“…We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if,…”
Získat plný text

Coinduction All the Way Up Autor Pous, Damien

“…We revisit coinductive proof principles from a lattice theoretic point of view. By associating to any monotone function a function which we call the companion,…”
Získat plný text

On Thin Air Reads Towards an Event Structures Model of Relaxed Memory Autor Jeffrey, Alan, Riely, James

“…This is the first paper to propose a pure event structures model of relaxed memory. We propose confusion-free event structures over an alphabet with a…”
Získat plný text

A categorical approach to open and interconnected dynamical systems Autor Fong, Brendan, Sobociński, Paweł, Rapisarda, Paolo

“…In his 1986 Automatica paper Willems introduced the influential behavioural approach to control theory with an investigation of linear time-invariant (LTI)…”
Získat plný text

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete Autor Englert, Matthias, Lazić, Ranko, Totzke, Patrick

“…Blondin et al. showed at LICS 2015 that two-dimensional vector addition systems with states have reachability witnesses of length exponential in the number of…”
Získat plný text

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable Autor Clemente, Lorenzo, Parys, Paweł, Salvati, Sylvain, Walukiewicz, Igor

“…A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown…”
Získat plný text

Interacting Frobenius Algebras are Hopf Autor Duncan, Ross, Dunne, Kevin

“…Theories featuring the interaction between a Frobenius algebra and a Hopf algebra have recently appeared in several areas in computer science: concurrent…”
Získat plný text

A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory Autor Hou (Favonia), Kuen-Bang, Finster, Eric, Licata, Daniel R., Lumsdaine, Peter LeFanu

“…This paper contributes to recent investigations of the use of homotopy type theory to give machine-checked proofs of constructions from homotopy theory. We…”
Získat plný text