Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter


Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS, 2015.

TEST
DBLP
Scholar
Full names Links ISxN
@proceedings{LICS-2015,
	address       = "Kyoto, Japan",
	isbn          = "978-1-4799-8875-4",
	publisher     = "{IEEE}",
	title         = "{Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science}",
	year          = 2015,
}

Contents (66 items)

LICS-2015-Ong #higher-order #model checking #overview #perspective
Higher-Order Model Checking: An Overview (LO), pp. 1–15.
LICS-2015-Kifer #privacy
Privacy and the Price of Data (DK), p. 16.
LICS-2015-OHearn #category theory #facebook #logic
From Categorical Logic to Facebook Engineering (PWO), pp. 17–20.
LICS-2015-Pitts #symmetry
Names and Symmetry in Computer Science (AMP), pp. 21–22.
LICS-2015-Smith #data flow
Recent Developments in Quantitative Information Flow (GS), pp. 23–31.
LICS-2015-BlondinFGHM #2d #reachability
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (MB, AF, SG, CH, PM), pp. 32–43.
LICS-2015-BrazdilKKN #behaviour #probability
Long-Run Average Behaviour of Probabilistic Vector Addition Systems (TB, SK, AK, PN), pp. 44–55.
LICS-2015-LerouxS #reachability
Demystifying Reachability in Vector Addition Systems (JL, SS), pp. 56–67.
LICS-2015-BrunetP #automaton #petri net
Petri Automata for Kleene Allegories (PB, DP), pp. 68–79.
LICS-2015-HeijltjesH #bound #complexity #logic #petri net #proving
Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (WH, DJDH), pp. 80–91.
LICS-2015-LicataB #approach
A Cubical Approach to Synthetic Homotopy Theory (DRL, GB), pp. 92–103.
LICS-2015-DisneyF #game studies #semantics
Game Semantics for Type Soundness (TD, CF), pp. 104–114.
LICS-2015-HackettH #exclamation #source code
Programs for Cheap! (JH, GH), pp. 115–126.
LICS-2015-Munch-Maccagnoni #representation #λ-calculus
Polarised Intermediate Representation of λ Calculus with Sums (GMM, GS), pp. 127–140.
LICS-2015-AccattoliC #on the
On the Relative Usefulness of Fireballs (BA, CSC), pp. 141–155.
LICS-2015-MurawskiRT #automaton #similarity
Bisimilarity in Fresh-Register Automata (ASM, SJR, NT), pp. 156–167.
LICS-2015-CzerwinskiJ #branch #process #similarity
Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME (WC, PJ), pp. 168–179.
LICS-2015-HeH #branch #similarity
Branching Bisimilarity on Normed BPA Is EXPTIME-Complete (CH, MH), pp. 180–191.
LICS-2015-Reiter #automaton #distributed #graph
Distributed Graph Automata (FR), pp. 192–201.
LICS-2015-Place #quantifier #regular expression
Separating Regular Languages with Two Quantifiers Alternations (TP), pp. 202–213.
LICS-2015-Bojanczyk #game studies
Star Height via Games (MB), pp. 214–219.
LICS-2015-TsukadaO #game studies #nondeterminism #semantics
Nondeterminism in Game Semantics via Sheaves (TT, CHLO), pp. 220–231.
LICS-2015-CastellanCW #game studies #parallel
The Parallel Intensionally Fully Abstract Games Model of PCF (SC, PC, GW), pp. 232–243.
LICS-2015-ChatterjeeKK #markov #multi #process
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (KC, ZK, JK), pp. 244–256.
LICS-2015-ClementeR #multi #problem #worst-case
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (LC, JFR), pp. 257–268.
LICS-2015-ChatterjeeHL #algorithm
Improved Algorithms for One-Pair and k-Pair Streett Objectives (KC, MH, VL), pp. 269–280.
LICS-2015-GogaczM #decidability #query
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable (TG, JM), pp. 281–292.
LICS-2015-BenediktCCB #bound #complexity #logic
The Complexity of Boundedness for Guarded Logics (MB, BtC, TC, MVB), pp. 293–304.
LICS-2015-AmarilliB #finite #query #strict
Finite Open-World Query Answering with Number Restrictions (AA, MB), pp. 305–316.
LICS-2015-BienvenuKP #complexity #owl #query
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (MB, SK, VVP), pp. 317–328.
LICS-2015-FigueiraL #graph #logic #performance #query
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.
LICS-2015-Carreiro #bisimulation #invariant #logic
PDL Is the Bisimulation-Invariant Fragment of Weak Chain Logic (FC), pp. 341–352.
LICS-2015-EnqvistSV #algebra #bisimulation #higher-order #logic #monad
Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras (SE, FS, YV), pp. 353–365.
LICS-2015-CanavoiGLP #fixpoint #logic
Defining Winning Strategies in Fixed-Point Logic (FC, EG, SL, WP), pp. 366–377.
LICS-2015-BenediktCB #decidability #fixpoint #logic
Interpolation with Decidable Fixpoint Logics (MB, BtC, MVB), pp. 378–389.
LICS-2015-DasR #axiom #infinity
A Complete Axiomatization of MSO on Infinite Trees (AD, CR), pp. 390–401.
LICS-2015-MaillardM
A Fibrational Account of Local States (KM, PAM), pp. 402–413.
LICS-2015-AdamekMUM
Varieties of Languages in a Category (JA, RSRM, HU, SM), pp. 414–425.
LICS-2015-Edalat #calculus #difference
Extensions of Domain Maps in Differential and Integral Calculus (AE), pp. 426–437.
LICS-2015-PaulyB #set
Descriptive Set Theory in the Category of Represented Spaces (AP, MdB), pp. 438–449.
LICS-2015-HeunenL #algebra #commutative
Domains of Commutative C-Subalgebras (CH, BL), pp. 450–461.
LICS-2015-CarvalhoMM #algebra #complexity
From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (CC, FRM, BM), pp. 462–474.
LICS-2015-KlinKOT #constraints #finite #problem
Locally Finite Constraint Satisfaction Problems (BK, EK, JO, ST), pp. 475–486.
LICS-2015-DalmauEHLR #complexity #problem
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (VD, LE, PH, BL, AR), pp. 487–498.
LICS-2015-GasconTS #polynomial #problem #unification
One Context Unification Problems Solvable in Polynomial Time (AG, AT, MSS), pp. 499–510.
LICS-2015-KotekSVZ
Extending ALCQIO with Trees (TK, MS, HV, FZ), pp. 511–522.
LICS-2015-AckermanFL #feedback
Feedback Turing Computability, and Turing Computability as Feedback (NLA, CEF, RSL), pp. 523–534.
LICS-2015-EndrullisGH #encoding
Regularity Preserving but Not Reflecting Encodings (JE, CG, DH), pp. 535–546.
LICS-2015-BeckmannP #deduction
Hyper Natural Deduction (AB, NP), pp. 547–558.
LICS-2015-LagoFVY #parallel
Parallelism and Synchronization in an Infinitary Context (UDL, CF, BV, AY), pp. 559–572.
LICS-2015-Hadzihasanovic #axiom #diagrams #quantum
A Diagrammatic Axiomatisation for Qubit Entanglement (AH), pp. 573–584.
LICS-2015-MoninN #approach
A Unifying Approach to the Gamma Question (BM, AN), pp. 585–596.
LICS-2015-McIverMR #data flow #markov #modelling #monad
Abstract Hidden Markov Models: A Monadic Account of Quantitative Information Flow (AM, CM, TMR), pp. 597–608.
LICS-2015-CarayolS #game studies #how #question
How Good Is a Strategy in a Game with Nature? (AC, OS), pp. 609–620.
LICS-2015-AtseriasB #probability
Entailment among Probabilistic Implications (AA, JLB), pp. 621–632.
LICS-2015-CrubilleL #metric #reasoning
Metric Reasoning about ?-Terms: The Affine Case (RC, UDL), pp. 633–644.
LICS-2015-BozzelliP #complexity #equilibrium #logic #on the
On the Complexity of Temporal Equilibrium Logic (LB, DP), pp. 645–656.
LICS-2015-BaazLR #complexity #proving
A Note on the Complexity of Classical and Intuitionistic Proofs (MB, AL, GR), pp. 657–666.
LICS-2015-LechnerOW #complexity #linear #on the
On the Complexity of Linear Arithmetic with Divisibility (AL, JO, JW), pp. 667–676.
LICS-2015-GradelPSK #first-order #polynomial
Characterising Choiceless Polynomial Time with First-Order Interpretations (EG, WP, SS, LK), pp. 677–688.
LICS-2015-KrebsV #bound #logic #refinement
Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (AK, OV), pp. 689–700.
LICS-2015-BallePP #approximate #automaton #canonical
A Canonical Form for Weighted Automata and Applications to Approximate Minimization (BB, PP, DP), pp. 701–712.
LICS-2015-KobayashiL #abstraction #model checking #refinement
Automata-Based Abstraction Refinement for μHORS Model Checking (NK, XL), pp. 713–724.
LICS-2015-ChatterjeeHO #automaton
Nested Weighted Automata (KC, TAH, JO), pp. 725–737.
LICS-2015-ClementeL #automaton #revisited
Timed Pushdown Automata Revisited (LC, SL), pp. 738–749.
LICS-2015-BokerHO #problem
The Target Discounted-Sum Problem (UB, TAH, JO), pp. 750–761.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.