BibSLEIGH — Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science
LICS, 2011.

TEST

@proceedings{LICS-2011,
	address       = "Toronto, Ontario, Canada",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2011/4412/00/index.html",
	isbn          = "978-0-7695-4412-0",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science}",
	year          = 2011,
}

Contents (43 items)

LICS-2011-Atserias #finite #tutorial: A Why-on-Earth Tutorial on Finite Model Theory (AA), p. 3.
LICS-2011-Panangaden #semantics: The Meaning of Semantics (PP), pp. 4–5.
LICS-2011-Tiwari #biology #logic: Logic in Software, Dynamical and Biological Systems (AT), pp. 9–10.
LICS-2011-CarayolHS: Qualitative Tree Languages (AC, AH, OS), pp. 13–22.
LICS-2011-KufleitnerL #infinity #word: Languages of Dot-Depth One over Infinite Words (MK, AL), pp. 23–32.
LICS-2011-BrazdilBCFK #markov #multi #process: Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (TB, VB, KC, VF, AK), pp. 33–42.
LICS-2011-BokerCHK #cumulative #specification: Temporal Specifications with Accumulative Values (UB, KC, TAH, OK), pp. 43–52.
LICS-2011-BirkedalMSS: First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees (LB, REM, JS, KS), pp. 55–64.
LICS-2011-ChurchillLM #game studies #imperative #proving #semantics #source code: Imperative Programs as Proofs via Game Semantics (MC, JL, GM), pp. 65–74.
LICS-2011-MurawskiT #game studies #semantics: Game Semantics for Good General References (ASM, NT), pp. 75–84.
LICS-2011-EhrhardPT #probability: The Computational Meaning of Probabilistic Coherence Spaces (TE, MP, CT), pp. 87–96.
LICS-2011-Goubault-LarrecqV #random: Continuous Random Variables (JGL, DV), pp. 97–106.
LICS-2011-AckermanFR: Noncomputable Conditional Distributions (NLA, CEF, DMR), pp. 107–116.
LICS-2011-Pitassi #complexity #overview #proving #state of the art: Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results (TP), p. 119.
LICS-2011-Marion #analysis #complexity #type system: A Type System for Complexity Flow Analysis (JYM), pp. 123–132.
LICS-2011-LagoG #dependent type #linear: Linear Dependent Types and Relative Completeness (UDL, MG), pp. 133–142.
LICS-2011-BarrasJSW #decidability #first-order #higher-order #named #type system: CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory (BB, JPJ, PYS, QW), pp. 143–151.
LICS-2011-Clairambault #higher-order #morphism: Isomorphisms of Types in the Presence of Higher-Order References (PC), pp. 152–161.
LICS-2011-ChenF #logic: Listings and Logics (YC, JF), pp. 165–174.
LICS-2011-HerrmannZ #complexity #quantum #satisfiability: Computational Complexity of Quantum Satisfiability (CH, MZ), pp. 175–184.
LICS-2011-LeC #algorithm #formal method #random: Formalizing Randomized Matching Algorithms (DTML, SAC), pp. 185–194.
LICS-2011-Miquel #program transformation: Forcing as a Program Transformation (AM), pp. 197–206.
LICS-2011-Heijltjes #linear #logic #proving: Proof Nets for Additive Linear Logic with Units (WH), pp. 207–216.
LICS-2011-Kobayashi #higher-order #model checking #theory and practice: Higher-Order Model Checking: From Theory to Practice (NK0), pp. 219–224.
LICS-2011-GoncharovS #monad: Powermonads and Tensors of Unranked Effects (SG, LS), pp. 227–236.
LICS-2011-HasuoH #geometry #higher-order #interactive #quantum #semantics: Semantics of Higher-Order Quantum Computation via Geometry of Interaction (IH, NH), pp. 237–246.
LICS-2011-HurDV #garbage collection #logic: Separation Logic in the Presence of Garbage Collection (CKH, DD, VV), pp. 247–256.
LICS-2011-KrishnaswamiB #semantics #source code: Ultrametric Semantics of Reactive Programs (NRK, NB), pp. 257–266.
LICS-2011-FigueiraFSS #bound #recursion: Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.
LICS-2011-GollerL #complexity #term rewriting #verification: The Complexity of Verifying Ground Tree Rewrite Systems (SG, AWL), pp. 279–288.
LICS-2011-KontinenKLV #complexity #dependence #logic: Complexity of Two-Variable Dependence Logic and IF-Logic (JK, AK, PL, JV), pp. 289–298.
LICS-2011-Barto #constraints #problem #revisited: The Dichotomy for Conservative Constraint Satisfaction Problems Revisited (LB), pp. 301–310.
LICS-2011-MadelaineM #first-order #logic #similarity: A Tetrachotomy for Positive First-Order Logic without Equality (FRM, BM), pp. 311–320.
LICS-2011-BodirskyPT #decidability: Decidability of Definability (MB, MP, TT), pp. 321–328.
LICS-2011-Krokhin #complexity #first-order: The Complexity of Evaluating First-Order Sentences over a Fixed Structure (AAK), p. 331.
LICS-2011-BenediktPR #specification: Regular Repair of Specifications (MB, GP, CR), pp. 335–344.
LICS-2011-AminofKL #approximate #automaton: Rigorous Approximated Determinization of Weighted Automata (BA, OK, RL), pp. 345–354.
LICS-2011-BojanczykKL #automaton: Automata with Group Actions (MB, BK, SL), pp. 355–364.
LICS-2011-Figueira #decidability #logic #word: A Decidable Two-Way Logic on Data Words (DF), pp. 365–374.
LICS-2011-MarcinkowskiM #logic: The Ultimate Undecidability Result for the Halpern-Shoham Logic (JM, JM), pp. 377–386.
LICS-2011-BresolinMSS #decidability #logic #what: What’s Decidable about Halpern and Shoham’s Interval Logic? The Maximal Fragment ABBL (DB, AM, PS, GS), pp. 387–396.
LICS-2011-AbdullaM #petri net: Computing Optimal Coverability Costs in Priced Timed Petri Nets (PAA, RM), pp. 399–408.
LICS-2011-RideauW #concurrent: Concurrent Strategies (SR, GW), pp. 409–418.

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer ScienceLICS, 2011.

Contents (43 items)

Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science
LICS, 2011.