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

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science
LICS, 2009.

TEST

@proceedings{LICS-2009,
	address       = "Los Angeles, California, USA",
	ee            = "http://www.computer.org/csdl/proceedings/lics/2009/3746/00/index.html",
	isbn          = "978-0-7695-3746-7",
	publisher     = "{IEEE Computer Society}",
	title         = "{Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science}",
	year          = 2009,
}

Contents (43 items)

LICS-2009-Clarke #explosion #problem: My 27-year Quest to Overcome the State Explosion Problem (EMC), p. 3.
LICS-2009-Leroux #induction #invariant #problem #reachability: The General Vector Addition System Reachability Problem by Presburger Inductive Invariants (JL), pp. 4–13.
LICS-2009-Ghica #game studies #hardware #program analysis #semantics #synthesis: Applications of Game Semantics: From Program Analysis to Hardware Synthesis (DRG), pp. 17–26.
LICS-2009-Kahlon #bound #communication #decidability #thread: Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks (VK), pp. 27–36.
LICS-2009-BengtsonJPV #calculus #logic #mobile #named #process: Psi-calculi: Mobile Processes, Nominal Data, and Logic (JB, MJ, JP, BV), pp. 39–48.
LICS-2009-BonsangueRS #algebra #polynomial: An Algebra for Kripke Polynomial Coalgebras (MMB, JJMMR, AS), pp. 49–58.
LICS-2009-NainV #semantics: Trace Semantics is Fully Abstract (SN, MYV), pp. 59–68.
LICS-2009-DreyerAB #logic: Logical Step-Indexed Logical Relations (DD, AA, LB), pp. 71–80.
LICS-2009-Dominguez #calculus #logic #polymorphism #similarity: Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (LD), pp. 81–90.
LICS-2009-CarraroS #reflexive #λ-calculus: Reflexive Scott Domains are Not Complete for the Extensional λ Calculus (AC, AS), pp. 91–100.
LICS-2009-PfenningS #logic programming #order #semantics: Substructural Operational Semantics as Ordered Logic Programming (FP, RJS), pp. 101–110.
LICS-2009-DawarGHL #logic #rank: Logics with Rank Operators (AD, MG, BH, BL), pp. 113–122.
LICS-2009-KieronskiT #equivalence #finite #first-order #logic #on the #satisfiability: On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations (EK, LT), pp. 123–132.
LICS-2009-HofmannS #pointer #reachability #source code: Pointer Programs and Undirected Reachability (MH, US), pp. 133–142.
LICS-2009-Friedmann #algorithm #bound #exponential #game studies: An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (OF), pp. 145–156.
LICS-2009-Tan #automaton #graph #infinity #reachability: Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.
LICS-2009-CaiZL #automaton #bound: An Improved Lower Bound for the Complementation of Rabin Automata (YC, TZ, HL), pp. 167–176.
LICS-2009-KobayashiO #calculus #higher-order #model checking #recursion #type system #μ-calculus: A Type System Equivalent to the Modal μ-Calculus Model Checking of Higher-Order Recursion Schemes (NK, CHLO), pp. 179–188.
LICS-2009-GhicaB #approximate #named #semantics: Clipping: A Semantics-Directed Syntactic Approximation (DRG, AB), pp. 189–198.
LICS-2009-ChatterjeeDH: Expressiveness and Closure Properties for Quantitative Languages (KC, LD, TAH), pp. 199–208.
LICS-2009-Baez: Computation and the Periodic Table (JB), p. 211.
LICS-2009-Mimram #first-order: The Structure of First-Order Causality (SM), pp. 212–221.
LICS-2009-PaganiT #linear #logic #problem: The Inverse Taylor Expansion Problem in Linear Logic (MP, CT), pp. 222–231.
LICS-2009-GollerMT #complexity #on the #process #verification: On the Computational Complexity of Verifying One-Counter Processes (SG, RM, AWT), pp. 235–244.
LICS-2009-BokerK #automaton: Co-ing Büchi Made Tight and Useful (UB, OK), pp. 245–254.
LICS-2009-BojanczykSW #algebra #logic: Wreath Products of Forest Algebras, with Applications to Tree Logics (MB, HS, IW), pp. 255–263.
LICS-2009-Lataillade #system f: Dinatural Terms in System F (JDL), pp. 267–276.
LICS-2009-AltenkirchM: Indexed Containers (TA, PM), pp. 277–285.
LICS-2009-OngT #functional #reachability: Functional Reachability (CHLO, NT), pp. 286–295.
LICS-2009-RougemontT #analysis #probability #process #statistics: Statistic Analysis for Probabilistic Processes (MdR, MT), pp. 299–308.
LICS-2009-ChenHKM #automaton #markov #model checking #specification: Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (TC, TH, JPK, AM), pp. 309–318.
LICS-2009-BertrandGG #decidability #game studies #probability: Qualitative Determinacy and Decidability of Stochastic Games with Signals (NB, BG, HG), pp. 319–328.
LICS-2009-Rossman #game studies: Combining Ehrenfeucht-Fraïssé Games (BR), p. 331.
LICS-2009-HansenKM #concurrent #game studies #reachability: Winning Concurrent Reachability Games Requires Doubly-Exponential Patience (KAH, MK, PBM), pp. 332–341.
LICS-2009-BiancoMM #logic: Graded Computation Tree Logic (AB, FM, AM), pp. 342–351.
LICS-2009-LiangM #calculus #proving: A Unified Sequent Calculus for Focused Proofs (CL, DM), pp. 355–364.
LICS-2009-CreusGMT #normalisation #term rewriting: Non-linear Rewrite Closure and Weak Normalization (CC, GG, FM, AT), pp. 365–374.
LICS-2009-BasaldellaF #exponential #interactive: Ludics with Repetitions (Exponentials, Interactive Types and Completeness) (MB, CF), pp. 375–384.
LICS-2009-DurandHN #complexity: Trichotomy in the Complexity of Minimal Inference (AD, MH, GN), pp. 387–396.
LICS-2009-ChenF #logic #problem: A Logic for PTIME and a Parameterized Halting Problem (YC, JF), pp. 397–406.
LICS-2009-KazakovP #complexity #logic #problem #satisfiability: A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics (YK, IPH), pp. 407–416.
LICS-2009-BulatovM #complexity #constraints: The Complexity of Global Cardinality Constraints (AAB, DM), pp. 419–428.
LICS-2009-MadelaineM #complexity #first-order #logic #similarity: The Complexity of Positive First-order Logic without Equality (FRM, BM), pp. 429–438.

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer ScienceLICS, 2009.

Contents (43 items)

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science
LICS, 2009.