The SCEAS System
Navigation Menu

Conferences in DBLP

Conference for Computer Science Logic (CSL) (csl)
1999 (conf/csl/1999)

  1. Victor Vianu
    Topological Queries in Spatial Databases. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:1- [Conf]
  2. José L. Balcázar
    The Consistency Dimension, Compactness, and Query Learning. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:2-13 [Conf]
  3. Martin Grohe
    Descriptive and Parameterized Complexity. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:14-31 [Conf]
  4. Peter D. Mosses
    Logical Specification of Operational Semantics. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:32-49 [Conf]
  5. Giorgio Delzanno, Javier Esparza, Andreas Podelski
    Constraint-Based Analysis of Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:50-66 [Conf]
  6. Erich Grädel, Stephan Kreutzer
    Descriptive Complexity Theory for Constraint Databases. [Citation Graph (3, 0)][DBLP]
    CSL, 1999, pp:67-81 [Conf]
  7. Daniel Leivant
    Applicative Control and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:82-95 [Conf]
  8. Thomas Arts, Jürgen Giesl
    Applying Rewriting Techniques to the Verification of Erlang Processes. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:96-110 [Conf]
  9. Jesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, Henrik Hulgaard
    Difference Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:111-125 [Conf]
  10. Martin Fränzle
    Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:126-140 [Conf]
  11. Yonit Kesten, Amir Pnueli
    Verifying Liveness by Augmented Abstraction. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:141-156 [Conf]
  12. Thomas Marthedal Rasmussen
    Signed Interval Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:157-171 [Conf]
  13. Yoram Hirshfeld, Alexander Moshe Rabinovich
    Quantitative Temporal Logic. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:172-187 [Conf]
  14. Volker Diekert, Paul Gastin
    An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:188-203 [Conf]
  15. Eduardo Bonelli
    Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:204-219 [Conf]
  16. Maribel Fernández, Ian Mackie
    Closed Reductions in the lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:220-234 [Conf]
  17. Samin S. Ishtiaq, David J. Pym
    Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:235-249 [Conf]
  18. Vincent Balat, Roberto Di Cosmo
    A Linear Logical View of Linear Type Isomorphisms. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:250-265 [Conf]
  19. Marina De Vos, Dirk Vermeir
    Choice Logic Programs and Nash Equilibria in Strategic Games. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:266-276 [Conf]
  20. Shigeki Hagihara, Naoki Yonezaki
    Resolution Method for Modal Logic with Well-Founded Frames. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:277-291 [Conf]
  21. Stephan Tobies
    A NExpTime-Complete Description Logic Strictly Contained in C2. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:292-306 [Conf]
  22. Carlos Areces, Patrick Blackburn, Maarten Marx
    A Road-Map on Complexity for Hybrid Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:307-321 [Conf]
  23. Clemens Lautemann, Bernhard Weinzinger
    MonadicNLIN and Quantifier-Free Reductions. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:322-337 [Conf]
  24. Jerzy Marcinkowski
    Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:338-349 [Conf]
  25. Julian C. Bradfield
    Fixpoint Alternation and the Game Quantifier. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:350-361 [Conf]
  26. Jacobo Torán
    Lower Bounds for Space in Resolution. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:362-373 [Conf]
  27. Iain A. Stewart
    Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:374-388 [Conf]
  28. Lev D. Beklemishev
    Open Least Element Principle and Bounded Query Computation. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:389-404 [Conf]
  29. Andrew D. Ker, Hanno Nickau, C.-H. Luke Ong
    A Universal Innocent Game Model for the Böhm Tree Lambda Theory. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:405-419 [Conf]
  30. Adriana B. Compagnoni, Healfdene Goguen
    Anti-Symmetry of Higher-Order Subtyping. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:420-438 [Conf]
  31. Herman Geuvers, Erik Poll, Jan Zwanenburg
    Safe Proof Checking in Type Theory with Y. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:439-452 [Conf]
  32. Thorsten Altenkirch, Bernhard Reus
    Monadic Presentations of Lambda Terms Using Generalized Inductive Types. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:453-468 [Conf]
  33. Luca Roversi
    A P-Time Completeness Proof for Light Logics. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:469-483 [Conf]
  34. Helmut Seidl, Andreas Neumann
    On Guarding Nested Fixpoints. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:484-498 [Conf]
  35. Antonín Kucera, Javier Esparza
    A Logical Viewpoint on Process-Algebraic Quotients. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:499-514 [Conf]
  36. Paul Gastin, Michael W. Mislove
    A Truly Concurrent Semantics for a Simple Parallel Programming Language. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:515-529 [Conf]
  37. Jo Erskine Hannay
    Specification Refinement with System F. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:530-545 [Conf]
  38. Furio Honsell, Donald Sannella
    Pre-logical Relations. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:546-561 [Conf]
  39. Yoshiki Kinoshita, John Power
    Data-Refinement for Call-By-Value Programming Languages. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:562-576 [Conf]
  40. Aart Middeldorp
    Term Rewriting. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:577- [Conf]
  41. Douglas J. Howe
    Interactive Theorem Proving Using Type Theory. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:578- [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