Conferences in DBLP
Paul-André Melliès Functorial Boxes in String Diagrams. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:1-30 [Conf ] C.-H. Luke Ong Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:31-40 [Conf ] Luc Segoufin Automata and Logics for Words and Trees over an Infinite Alphabet. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:41-57 [Conf ] Miroslaw Truszczynski Nonmonotonic Logics and Their Algebraic Foundations. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:58-71 [Conf ] Andreas Abel Semi-continuous Sized Types and Termination. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:72-88 [Conf ] Jirí Srba Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:89-103 [Conf ] Klaus Aehlig A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:104-118 [Conf ] Sandra Alves , Maribel Fernández , Mário Florido , Ian Mackie The Power of Linear Functions. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:119-134 [Conf ] Sergei N. Artëmov , Roman Kuznets Logical Omniscience Via Proof Complexity. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:135-149 [Conf ] Vincent Atassi , Patrick Baillot , Kazushige Terui Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:150-166 [Conf ] Guillaume Bagan MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:167-181 [Conf ] Nick Benton Abstracting Allocation. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:182-196 [Conf ] Manuel Bodirsky , Hubie Chen Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:197-211 [Conf ] Guillaume Bonfante , R. Kahle , Jean-Yves Marion , Isabel Oitavem Towards an Implicit Characterization of NC ^{k} . [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:212-224 [Conf ] Arnaud Carayol , Christophe Morvan On Rational Trees. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:225-239 [Conf ] Rohit Chadha , Paulo Mateus , Amílcar Sernadas Reasoning About States of Probabilistic Sequential Programs. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:240-255 [Conf ] Krishnendu Chatterjee Concurrent Games with Tail Objectives. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:256-270 [Conf ] Krishnendu Chatterjee Nash Equilibrium for Upward-Closed Objectives. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:271-286 [Conf ] Krishnendu Chatterjee , Laurent Doyen , Thomas A. Henzinger , Jean-François Raskin Algorithms for Omega-Regular Games with Imperfect Information^{, } . [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:287-302 [Conf ] Véronique Cortier , Michaël Rusinowitch , Eugen Zalinescu Relating Two Standard Notions of Secrecy. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:303-318 [Conf ] Paolo Di Giamberardino , Claudia Faggian Jump from Parallel to Sequential Proofs: Multiplicatives. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:319-333 [Conf ] Arnaud Durand , Frédéric Olive First-Order Queries over One Unary Function. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:334-348 [Conf ] Stefan Göller , Markus Lohrey Infinite State Model-Checking of Propositional Dynamic Logics. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:349-364 [Conf ] Will Harwood , Faron Moller , Anton Setzer Weak Bisimulation Approximants. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:365-379 [Conf ] Lauri Hella , Jose Maria Turull Torres Complete Problems for Higher Order Logics. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:380-394 [Conf ] Thomas A. Henzinger , Nir Piterman Solving Games Without Determinization. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:395-410 [Conf ] Lukasz Kaiser Game Quantification on Automatic Structures and Hierarchical Model Checking Games. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:411-425 [Conf ] Clemens Lautemann , Pascal Tesson , Denis Thérien An Algebraic Point of View on the Crane Beach Property. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:426-440 [Conf ] Stephane Lengrand , Roy Dyckhoff , James McKinna A Sequent Calculus for Type Theory. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:441-455 [Conf ] Tobias Löw , Thomas Streicher Universality Results for Models in Locally Boolean Domains. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:456-470 [Conf ] Florent R. Madelaine Universal Structures and the Logic of Forbidden Patterns. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:471-485 [Conf ] Jerzy Marcinkowski On the Expressive Power of Graph Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:486-500 [Conf ] Ursula Martin , Erik A. Mathiesen , Paulo Oliva Hoare Logic in the Abstract. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:501-515 [Conf ] Wojciech Moczydlowski Normalization of IZF with Replacement. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:516-530 [Conf ] Michele Pagani Acyclicity and Coherence in Multiplicative Exponential Linear Logic. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:531-545 [Conf ] Alexander Moshe Rabinovich Church Synthesis Problem with Parameters. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:546-561 [Conf ] Alexander Moshe Rabinovich , Wolfgang Thomas Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:562-574 [Conf ] Bernhard Reus , Jan Schwinghammer Separation Logic for Higher-Order Store. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:575-590 [Conf ] Sven Schewe , Bernd Finkbeiner Satisfiability and Finite Model Property for the Alternating-Time mu -Calculus. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:591-605 [Conf ] Ulrich Schöpp Space-Efficient Computation by Interaction. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:606-621 [Conf ] Samson Abramsky , Erich Grädel , Johann A. Makowsky The Ackermann Award 2006. [Citation Graph (0, 0)][DBLP ] CSL, 2006, pp:622-626 [Conf ]