Search Results - "2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)"

Church Meets Cook and Levin by Mazza, Damiano

“…The Cook-Levin theorem (the statement that SAT is NP-complete) is a central result in structural complexity theory. Is it possible to prove it using the…”
Get full text

Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing by Lempiainen, Tuomo

“…Hella et al. (PODC 2012, Distributed Computing 2015) identified seven different message-passing models of distributed computing- one of which is the…”
Get full text

Factor Varieties and Symbolic Computation by Salibra, Antonino, Manzonetto, Giulio, Favro, Giordano

“…We propose an algebraization of classical and non-classical logics, based on factor varieties and decomposition operators. In particular, we provide a new…”
Get full text

Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems by Preoteasa, Viorel, Tripakis, Stavros

“…Feedback is an essential composition operator in many classes of reactive and other systems. This paper studies feedback in the context of compositional…”
Get full text

Rewriting modulo symmetric monoidal structure by Bonchi, Filippo, Gadducci, Fabio, Kissinger, Aleks, Sobocinski, Pawel, Zanasi, Fabio

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

Interaction Graphs: Full Linear Logic by Seiller, Thomas

“…Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI)…”
Get full text

Understanding Gentzen and Frege Systems for QBF by Beyersdorff, Olaf, Pich, Jan

“…Recently Beyersdorff, Bonacina, and Chew [10] introduced a natural class of Frege systems for quantified Boolean formulas (QBF) and showed strong lower bounds…”
Get full text

Infinitary Lambda Calculi from a Linear Perspective by Lago, Ugo Dal

“…We introduce a linear infinitary λ-calculus, called ℓΛ ∞ , in which two exponential modalities are available, the first one being the usual, finitary one, the…”
Get full text

Quantifier Free Definability on Infinite Algebras by Khoussainov, Bakh

“…An operation f : A n → A on the domain A of an algebra A is definable if there exists a first order logic formula ϕ ( x̄ , y ) with parameters from A such that…”
Get full text

Towards Completeness via Proof Search in the Linear Time µ-calculus : The case of Büchi inclusions by Doumane, Amina, Baelde, David, Hirschi, Lucca, Saurin, Alexis

“…Modal µ-calculus is one of the central languages of logic and verification, whose study involves notoriously complex objects: automata over infinite structures…”
Get full text

Order-Invariance of Two-Variable Logic is Decidable by Zeume, Thomas, Harwath, Frederik

“…It is shown that order-invariance of two-variable first-logic is decidable in the finite. This is an immediate consequence of a decision procedure obtained for…”
Get full text

On the Satisfiability of Some Simple Probabilistic Logics by Chakraborty, Souymodip, Katoen, Joost-Pieter

“…This paper shows that the satisfiability problems for a bounded fragment of probabilistic CTL (called bounded PCTL) and an extension of the modal μ-calculus…”
Get full text

A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory by 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…”
Get full text

Proving Liveness of Parameterized Programs by Farzan, Azadeh, Kincaid, Zachary, Podelski, Andreas

“…Correctness of multi-threaded programs typically requires that they satisfy liveness properties. For example, a program may require that no thread is starved…”
Get full text

A Step Up in Expressiveness of Decidable Fixpoint Logics by Benedikt, Michael, Bourhis, Pierre, Boom, Michael Vanden

“…Guardedness restrictions are one of the principal means to obtain decidable logics - operators such as negation are restricted so that the free variables are…”
Get full text

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives by Chatterjee, Krishnendu, Doyen, Laurent

“…Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model…”
Get full text

Denotational semantics of recursive types in synthetic guarded domain theory by Mogelberg, Rasmus Ejlers, Paviotti, Marco

“…Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for…”
Get full text

The Complexity of Coverability in ν-Petri Nets by Lazic, Ranko, Schmitz, Sylvain

“…We show that the coverability problem in ν-Petri nets is complete for 'double Ackermann' time, thus closing an open complexity gap between an Ackermann lower…”
Get full text

Games with bound guess actions by Colcombet, Thomas, Goller, Stefan

“…We introduce games with (bound) guess actions. These are games in which the players may be asked along the play to provide numbers that need to satisfy some…”
Get full text

Proving Differential Privacy via Probabilistic Couplings by Barthe, Gilles, Gaboardi, Marco, Gregoire, 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…”
Get full text