Conferences in DBLP
Reviewers. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:- [Conf ] Foreward. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:- [Conf ] Organizing Committee. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:- [Conf ] Conference Organization. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:- [Conf ] Randal E. Bryant Formal Verification of Infinite State Systems Using Boolean Methods. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:3-4 [Conf ] Mikolaj Bojanczyk , Anca Muscholl , Thomas Schwentick , Luc Segoufin , Claire David Two-Variable Logic on Words with Data. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:7-16 [Conf ] Stéphane Demri , Ranko Lazic LTL with the Freeze Quantifier and Register Automata. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:17-26 [Conf ] Guoqiang Pan , Moshe Y. Vardi Fixed-Parameter Hierarchies inside PSPACE. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:27-36 [Conf ] Martin Otto The Boundedness Problem for Monadic Universal First-Order Logic. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:37-48 [Conf ] Marcelo P. Fiore , Sam Staton A Congruence Rule Format for Name-Passing Process Calculi from Mathematical Structural Operational Semantics. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:49-58 [Conf ] Catuscia Palamidessi , Vijay A. Saraswat , Frank D. Valencia , Björn Victor On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:59-68 [Conf ] Filippo Bonchi , Barbara König , Ugo Montanari Saturated Semantics for Reactive Systems. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:69-80 [Conf ] C.-H. Luke Ong On Model-Checking Trees Generated by Higher-Order Recursion Schemes. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:81-90 [Conf ] Dietrich Kuske , Markus Lohrey Monadic Chain Logic Over Iterations and Applications to Pushdown Systems. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:91-100 [Conf ] Vineet Kahlon , Aarti Gupta An Automata-Theoretic Approach for Model Checking Threads for LTL Propert. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:101-110 [Conf ] Tachio Terauchi , Alex Aiken On Typability for Rank-2 Intersection Types with Polymorphic Recursion. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:111-122 [Conf ] Andreas Blass Adapting Logics. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:123- [Conf ] Adam Barth , John C. Mitchell Managing Digital Rights using Linear Logic. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:127-136 [Conf ] Matthew J. Parkinson , Richard Bornat , Cristiano Calcagno Variables as Resource in Hoare Logics. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:137-146 [Conf ] Jonathan Hayman , Glynn Winskel Independence and Concurrent Separation Logic. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:147-156 [Conf ] Daniel Leivant Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:157-168 [Conf ] Ugo Dal Lago Context Semantics, Linear Logic and Computational Complexity. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:169-178 [Conf ] Olivier Laurent , Lorenzo Tortora de Falco Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:179-188 [Conf ] Alexis Maciel , Toniann Pitassi Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:189-200 [Conf ] Benoit Larose , Cynthia Loten , Claude Tardif A Characterisation of First-Order Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:201-210 [Conf ] Laura Chaubard , Jean-Eric Pin , Howard Straubing First Order Formulas with Modular Ppredicates. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:211-220 [Conf ] Emil W. Kiss , Matthew Valeriote On Tractability and Congruence Distributivity. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:221-230 [Conf ] Lutz Schröder , Dirk Pattinson PSPACE Bounds for Rank-1 Modal Logics. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:231-242 [Conf ] Orna Kupferman Avoiding Determinization. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:243-254 [Conf ] Nir Piterman From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:255-264 [Conf ] Orna Kupferman , Moshe Y. Vardi Memoryful Branching-Time Logic. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:265-274 [Conf ] Nir Piterman , Amir Pnueli Faster Solutions of Rabin and Streett Games. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:275-284 [Conf ] Mikolaj Bojanczyk , Thomas Colcombet Bounds in w-Regularity. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:285-296 [Conf ] Søren B. Lassen Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:297-306 [Conf ] Thierry Coquand , Arnaud Spiwack A Proof of Strong Normalisation using Domain Theory. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:307-316 [Conf ] Giulio Manzonetto , Antonino Salibra Boolean Algebras for Lambda Calculus. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:317-326 [Conf ] Makoto Tatsuta , Mariangiola Dezani-Ciancaglini Normalisation is Insensible to lambda-Term Identity or Difference. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:327-338 [Conf ] John W. Dawson Shaken Foundations or Groundbreaking Realignment? A Centennial Assessment of Kurt Gödel's Impact on Logic, Mathematics, and Computer Science. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:339-341 [Conf ] Andrew D. Gordon Provable Implementations of Security Protocols. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:345-346 [Conf ] Tomás Brázdil , Václav Brozek , Vojtech Forejt , Antonín Kucera Stochastic Games with Branching-Time Winning Objectives. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:349-358 [Conf ] Dexter Kozen Coinductive Proof Principles for Stochastic Processes. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:359-366 [Conf ] Patricia Bouyer , Thomas Brihaye , Fabrice Chevalier Control in o-minimal Hybrid Systems. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:367-378 [Conf ] Thomas Ball , Orna Kupferman An Abstraction-Refinement Framework for Multi-Agent Systems. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:379-388 [Conf ] Daniele Varacca , Hagen Völzer Temporal Logics and Model Checking for Fairly Correct Systems. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:389-398 [Conf ] Sharon Shoham , Orna Grumberg 3-Valued Abstraction: More Precision at Less Cost. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:399-410 [Conf ] Anuj Dawar , Martin Grohe , Stephan Kreutzer , Nicole Schweikardt Approximation Schemes for First-Order Definable Optimisation Problems. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:411-420 [Conf ] Eldar Fischer , Frédéric Magniez , Michel de Rougemont Approximate Satisfiability and Equivalence. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:421-430 [Conf ]