The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Algebra for Tree Languages. [Citation Graph (, )][DBLP]

  2. Forcing and Type Theory. [Citation Graph (, )][DBLP]

  3. Functional Interpretations of Intuitionistic Linear Logic. [Citation Graph (, )][DBLP]

  4. Fixed-Point Definability and Polynomial Time. [Citation Graph (, )][DBLP]

  5. Kleene's Amazing Second Recursion Theorem. [Citation Graph (, )][DBLP]

  6. Typed Applicative Structures and Normalization by Evaluation for System Fomega. [Citation Graph (, )][DBLP]

  7. Jumping Boxes. [Citation Graph (, )][DBLP]

  8. Tree-Width for First Order Formulae. [Citation Graph (, )][DBLP]

  9. Algorithmic Analysis of Array-Accessing Programs. [Citation Graph (, )][DBLP]

  10. Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]

  11. Cardinality Quantifiers in MLO over Trees. [Citation Graph (, )][DBLP]

  12. From Coinductive Proofs to Exact Real Arithmetic. [Citation Graph (, )][DBLP]

  13. On the Relation between Sized-Types Based Termination and Semantic Labelling. [Citation Graph (, )][DBLP]

  14. Expanding the Realm of Systematic Proof Theory. [Citation Graph (, )][DBLP]

  15. EXPTIME Tableaux for the Coalgebraic µ-Calculus. [Citation Graph (, )][DBLP]

  16. On the Word Problem for SP{Sigma Pi}-Categories, and the Properties of Two-Way Communication. [Citation Graph (, )][DBLP]

  17. Intersection, Universally Quantified, and Reference Types. [Citation Graph (, )][DBLP]

  18. Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata. [Citation Graph (, )][DBLP]

  19. Enriching an Effect Calculus with Linear Types. [Citation Graph (, )][DBLP]

  20. Degrees of Undecidability in Term Rewriting. [Citation Graph (, )][DBLP]

  21. Upper Bounds on Stream I/O Using Semantic Interpretations. [Citation Graph (, )][DBLP]

  22. Craig Interpolation for Linear Temporal Languages. [Citation Graph (, )][DBLP]

  23. On Model Checking Boolean BI. [Citation Graph (, )][DBLP]

  24. Efficient Type-Checking for Amortised Heap-Space Analysis. [Citation Graph (, )][DBLP]

  25. Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries. [Citation Graph (, )][DBLP]

  26. On the Parameterised Intractability of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]

  27. Automatic Structures of Bounded Degree Revisited. [Citation Graph (, )][DBLP]

  28. Nondeterminism and Observable Sequentiality. [Citation Graph (, )][DBLP]

  29. A Decidable Spatial Logic with Cone-Shaped Cardinal Directions. [Citation Graph (, )][DBLP]

  30. Focalisation and Classical Realisability. [Citation Graph (, )][DBLP]

  31. Decidable Extensions of Church's Problem. [Citation Graph (, )][DBLP]

  32. Nested Hoare Triples and Frame Rules for Higher-Order Store. [Citation Graph (, )][DBLP]

  33. A Complete Characterization of Observational Equivalence in Polymorphic lambda-Calculus with General References. [Citation Graph (, )][DBLP]

  34. Non-Commutative First-Order Sequent Calculus. [Citation Graph (, )][DBLP]

  35. Model Checking FO(R) over One-Counter Processes and beyond. [Citation Graph (, )][DBLP]

  36. Confluence of Pure Differential Nets with Promotion. [Citation Graph (, )][DBLP]

  37. Decision Problems for Nash Equilibria in Stochastic Games. [Citation Graph (, )][DBLP]

  38. On the Complexity of Branching-Time Logics. [Citation Graph (, )][DBLP]

  39. Nominal Domain Theory for Concurrency. [Citation Graph (, )][DBLP]

  40. The Ackermann Award 2009. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002