The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
2001 (conf/lics/2001)

  1. Andrew W. Appel
    Foundational Proof-Carrying Code. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  2. Ahmed Bouajjani, Anca Muscholl, Tayssir Touili
    Permutation Rewriting and Algorithmic Verification. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  3. Orna Kupferman, Moshe Y. Vardi
    Synthesizing Distributed Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  4. Kazushige Terui
    Light Affine Calculus and Polytime Strong Normalization. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  5. Frank Pfenning
    Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  6. Hongwei Xi
    Dependent Types for Program Termination Verification. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  7. Wolfgang Thomas
    The Engineering Challenge for Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  8. John C. Mitchell, Ajith Ramanathan, Andre Scedrov, Vanessa Teague
    Probabilistic Polynominal-Time Process Calculus and Security Protocol Analysis. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:3-8 [Conf]
  9. Frédéric Blanqui
    Definitions by Rewriting in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:9-18 [Conf]
  10. Harald Rueß, Natarajan Shankar
    Deconstructing Shostak. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:19-28 [Conf]
  11. Aaron Stump, Clark W. Barrett, David L. Dill, Jeremy R. Levitt
    A Decision Procedure for an Extensional Theory of Arrays. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:29-37 [Conf]
  12. Guillem Godoy, Robert Nieuwenhuis
    On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:38-50 [Conf]
  13. Satyaki Das, David L. Dill
    Successive Approximation of Abstract Transition Relations. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:51-60 [Conf]
  14. Scott D. Stoller
    A Bound on Attacks on Payment Protocols. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:61-70 [Conf]
  15. Lefteris M. Kirousis, Phokion G. Kolaitis
    A Dichotomy in the Complexity of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:71-80 [Conf]
  16. Harald Ganzinger
    Relating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:81-92 [Conf]
  17. Marcelo P. Fiore, Daniele Turi
    Semantics of Name and Value Passing. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:93-104 [Conf]
  18. James Laird
    A Fully Abstract Game Semantics of Local Exceptions. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:105-114 [Conf]
  19. Martín Hötzel Escardó, Alex K. Simpson
    A Universal Characterization of the Closed Euclidean Interval. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:115-128 [Conf]
  20. Yuri Gurevich
    Logician in the Land of OS: Abstract State Machines in Microsoft. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:129-138 [Conf]
  21. Jeremy Avigad
    Eliminating Definitions and Skolem Functions in First-Order Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:139-146 [Conf]
  22. Wieslaw Szwast, Lidia Tendera
    On the Decision Problem for the Guarded Fragment with Transitivity. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:147-156 [Conf]
  23. André Arnold, Giacomo Lenzi, Jerzy Marcinkowski
    The Hierarchy inside Closed Monadic Sigma1 Collapses on the Infinite Binary Tree. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:157-166 [Conf]
  24. Taneli Huuskonen, Tapani Hyttinen
    On Definability of Order in Logic with Choice. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:167-176 [Conf]
  25. Stephen A. Cook, Antonina Kolokolova
    A Second-Order System for Polytime Reasoning Using Graedel's Theorem. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:177-186 [Conf]
  26. David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
    The Crane Beach Conjecture. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:187-196 [Conf]
  27. Micah Adler, Neil Immerman
    An n! Lower Bound on Formula Size. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:197-0 [Conf]
  28. Dexter Kozen, Jerzy Tiuryn
    Intuitionistic Linear Logic and Partial Correctness. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:259-268 [Conf]
  29. Eugene Asarin, Ahmed Bouajjani
    Perturbed Turing Machines and Hybrid Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:269-278 [Conf]
  30. Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar
    From Verification to Control: Dynamic Programs for Omega-Regular Objectives. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:279-290 [Conf]
  31. Rajeev Alur, Salvatore La Torre
    Deterministic Generators and Games for LTL Fragments. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:291-302 [Conf]
  32. Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott
    Normalization by Evaluation for Typed Lambda Calculus with Coproducts. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:303-310 [Conf]
  33. Nobuko Yoshida, Martin Berger, Kohei Honda
    Strong Normalisation in the pi-Calculus. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:311-322 [Conf]
  34. Alan Jeffrey
    A Symbolic Labelled Transition System for Coinductive Subtyping of Fµ< Types. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:323-333 [Conf]
  35. Antonino Salibra
    A Continuum of Theories of Lambda Calculus without Semantics. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:334-346 [Conf]
  36. David Janin, Giacomo Lenzi
    Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:347-356 [Conf]
  37. Martin Lange, Colin Stirling
    Focus Games for Satisfiability and Completeness of Temporal Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:357-365 [Conf]
  38. Panagiotis Manolios, Richard J. Trefler
    Safety and Liveness in Branching Time. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:366-0 [Conf]
  39. Serge Abiteboul
    Semistructured Data: from Practice to Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:379-0 [Conf]
  40. Glenn Bruns, Patrice Godefroid
    Temporal Logic Query Checking. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:409-417 [Conf]
  41. Noga Alon, Tova Milo, Frank Neven, Dan Suciu, Victor Vianu
    Typechecking XML Views of Relational Databases. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:421-430 [Conf]
  42. Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
    A Model-Theoretic Approach to Regular String Relations. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:431-0 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002